./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '4c8d69d1f3064c47045f447426cd788cf9b3338c09ab601cc7dd6947b7697cf1'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c8d69d1f3064c47045f447426cd788cf9b3338c09ab601cc7dd6947b7697cf1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:01:16,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:01:16,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:01:16,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:01:16,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:01:16,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:01:16,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:01:16,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:01:16,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:01:16,407 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:01:16,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:01:16,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:01:16,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:01:16,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:01:16,407 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:01:16,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:01:16,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:01:16,408 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:01:16,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:01:16,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:01:16,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:01:16,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:01:16,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:01:16,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:01:16,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:01:16,408 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:01:16,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:01:16,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:01:16,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:01:16,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:01:16,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:01:16,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:01:16,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:01:16,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:01:16,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:01:16,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:01:16,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:01:16,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:01:16,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:01:16,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:01:16,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:01:16,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:01:16,410 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c8d69d1f3064c47045f447426cd788cf9b3338c09ab601cc7dd6947b7697cf1 [2024-11-07 11:01:16,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:01:16,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:01:16,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:01:16,648 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:01:16,648 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:01:16,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i [2024-11-07 11:01:18,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:01:18,472 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:01:18,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i [2024-11-07 11:01:18,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d91420ed4/9169f9894d514e09a964f1259d55407f/FLAGc83e40825 [2024-11-07 11:01:18,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d91420ed4/9169f9894d514e09a964f1259d55407f [2024-11-07 11:01:18,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:01:18,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:01:18,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:01:18,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:01:18,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:01:18,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d2d698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18, skipping insertion in model container [2024-11-07 11:01:18,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:01:18,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i[917,930] [2024-11-07 11:01:18,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:01:18,698 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:01:18,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i[917,930] [2024-11-07 11:01:18,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:01:18,767 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:01:18,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18 WrapperNode [2024-11-07 11:01:18,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:01:18,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:01:18,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:01:18,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:01:18,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,820 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 537 [2024-11-07 11:01:18,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:01:18,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:01:18,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:01:18,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:01:18,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,841 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 11:01:18,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:01:18,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:01:18,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:01:18,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:01:18,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (1/1) ... [2024-11-07 11:01:18,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:01:18,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:01:18,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 11:01:18,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 11:01:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:01:18,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 11:01:18,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 11:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 11:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 11:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 11:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 11:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 11:01:18,923 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 11:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 11:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:01:18,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:01:19,053 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:01:19,055 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:01:19,693 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-07 11:01:19,694 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:01:19,704 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:01:19,704 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 11:01:19,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:01:19 BoogieIcfgContainer [2024-11-07 11:01:19,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:01:19,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:01:19,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:01:19,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:01:19,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:01:18" (1/3) ... [2024-11-07 11:01:19,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d607cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:01:19, skipping insertion in model container [2024-11-07 11:01:19,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:18" (2/3) ... [2024-11-07 11:01:19,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d607cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:01:19, skipping insertion in model container [2024-11-07 11:01:19,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:01:19" (3/3) ... [2024-11-07 11:01:19,713 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-88.i [2024-11-07 11:01:19,724 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:01:19,724 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:01:19,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:01:19,772 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b50ae43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:01:19,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 11:01:19,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:01:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 11:01:19,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:19,785 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:19,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:19,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:19,789 INFO L85 PathProgramCache]: Analyzing trace with hash -100183722, now seen corresponding path program 1 times [2024-11-07 11:01:19,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:19,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087557597] [2024-11-07 11:01:19,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:19,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:20,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:20,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087557597] [2024-11-07 11:01:20,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087557597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:20,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:20,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 11:01:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281820541] [2024-11-07 11:01:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:20,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 11:01:20,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:20,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 11:01:20,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 11:01:20,139 INFO L87 Difference]: Start difference. First operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:20,172 INFO L93 Difference]: Finished difference Result 231 states and 361 transitions. [2024-11-07 11:01:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 11:01:20,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-07 11:01:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:20,181 INFO L225 Difference]: With dead ends: 231 [2024-11-07 11:01:20,181 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 11:01:20,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 11:01:20,187 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:20,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 11:01:20,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-07 11:01:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:01:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2024-11-07 11:01:20,228 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2024-11-07 11:01:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:20,229 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2024-11-07 11:01:20,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2024-11-07 11:01:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 11:01:20,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:20,231 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:20,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:01:20,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:20,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:20,232 INFO L85 PathProgramCache]: Analyzing trace with hash 753164736, now seen corresponding path program 1 times [2024-11-07 11:01:20,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:20,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407273645] [2024-11-07 11:01:20,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:20,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:20,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:20,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407273645] [2024-11-07 11:01:20,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407273645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:20,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:20,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:01:20,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184384149] [2024-11-07 11:01:20,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:20,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:01:20,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:20,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:01:20,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:20,629 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:20,684 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2024-11-07 11:01:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:01:20,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-07 11:01:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:20,687 INFO L225 Difference]: With dead ends: 229 [2024-11-07 11:01:20,687 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 11:01:20,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:20,688 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:20,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 11:01:20,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-07 11:01:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:01:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-11-07 11:01:20,705 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2024-11-07 11:01:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:20,708 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-11-07 11:01:20,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-11-07 11:01:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 11:01:20,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:20,710 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:20,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:01:20,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:20,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash -122854270, now seen corresponding path program 1 times [2024-11-07 11:01:20,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:20,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344820760] [2024-11-07 11:01:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:20,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:21,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:21,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344820760] [2024-11-07 11:01:21,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344820760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:21,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:21,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:01:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811609595] [2024-11-07 11:01:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:21,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:01:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:21,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:01:21,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:21,138 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:21,182 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2024-11-07 11:01:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:01:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-07 11:01:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:21,184 INFO L225 Difference]: With dead ends: 234 [2024-11-07 11:01:21,184 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 11:01:21,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:21,186 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:21,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 484 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 11:01:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-07 11:01:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:01:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-11-07 11:01:21,204 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2024-11-07 11:01:21,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:21,204 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-11-07 11:01:21,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:21,205 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-11-07 11:01:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 11:01:21,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:21,207 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:21,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:01:21,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:21,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash 557204100, now seen corresponding path program 1 times [2024-11-07 11:01:21,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:21,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203525889] [2024-11-07 11:01:21,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:21,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:21,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:21,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203525889] [2024-11-07 11:01:21,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203525889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:21,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:21,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:01:21,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666844479] [2024-11-07 11:01:21,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:21,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:01:21,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:21,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:01:21,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:21,480 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:21,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:21,508 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2024-11-07 11:01:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:01:21,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-07 11:01:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:21,511 INFO L225 Difference]: With dead ends: 238 [2024-11-07 11:01:21,511 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 11:01:21,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:21,516 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:21,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 485 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 11:01:21,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-07 11:01:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:01:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2024-11-07 11:01:21,526 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2024-11-07 11:01:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:21,526 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2024-11-07 11:01:21,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2024-11-07 11:01:21,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 11:01:21,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:21,531 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:21,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:01:21,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:21,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1962755834, now seen corresponding path program 1 times [2024-11-07 11:01:21,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:21,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803734233] [2024-11-07 11:01:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:21,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:21,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:21,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803734233] [2024-11-07 11:01:21,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803734233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:21,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:21,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:01:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904353484] [2024-11-07 11:01:21,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:21,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:01:21,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:21,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:01:21,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:21,795 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:21,830 INFO L93 Difference]: Finished difference Result 242 states and 349 transitions. [2024-11-07 11:01:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:01:21,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-07 11:01:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:21,832 INFO L225 Difference]: With dead ends: 242 [2024-11-07 11:01:21,833 INFO L226 Difference]: Without dead ends: 124 [2024-11-07 11:01:21,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:21,834 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:21,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-07 11:01:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-07 11:01:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:01:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2024-11-07 11:01:21,849 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 143 [2024-11-07 11:01:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:21,850 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2024-11-07 11:01:21,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2024-11-07 11:01:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 11:01:21,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:21,853 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:21,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:01:21,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:21,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:21,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1960908792, now seen corresponding path program 1 times [2024-11-07 11:01:21,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:21,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383664818] [2024-11-07 11:01:21,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:21,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:23,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:24,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:24,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383664818] [2024-11-07 11:01:24,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383664818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:24,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:24,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:01:24,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130502226] [2024-11-07 11:01:24,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:24,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 11:01:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:24,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 11:01:24,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:01:24,098 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:24,967 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2024-11-07 11:01:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:01:24,967 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-07 11:01:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:24,969 INFO L225 Difference]: With dead ends: 307 [2024-11-07 11:01:24,969 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 11:01:24,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-07 11:01:24,970 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 391 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:24,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 548 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 11:01:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 11:01:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 141. [2024-11-07 11:01:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 122 states have internal predecessors, (169), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:01:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2024-11-07 11:01:24,983 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 143 [2024-11-07 11:01:24,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:24,983 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2024-11-07 11:01:24,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:24,983 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2024-11-07 11:01:24,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 11:01:24,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:24,984 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:24,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:01:24,984 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:24,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash 163957603, now seen corresponding path program 1 times [2024-11-07 11:01:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:24,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104809069] [2024-11-07 11:01:24,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:24,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:26,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:26,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104809069] [2024-11-07 11:01:26,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104809069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:26,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:26,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:01:26,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473219003] [2024-11-07 11:01:26,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:26,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 11:01:26,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:26,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 11:01:26,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:01:26,971 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:27,678 INFO L93 Difference]: Finished difference Result 339 states and 488 transitions. [2024-11-07 11:01:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:01:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2024-11-07 11:01:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:27,680 INFO L225 Difference]: With dead ends: 339 [2024-11-07 11:01:27,680 INFO L226 Difference]: Without dead ends: 201 [2024-11-07 11:01:27,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-07 11:01:27,682 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 359 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:27,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 399 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 11:01:27,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-07 11:01:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 139. [2024-11-07 11:01:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:01:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. [2024-11-07 11:01:27,719 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 200 transitions. Word has length 145 [2024-11-07 11:01:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:27,719 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 200 transitions. [2024-11-07 11:01:27,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 200 transitions. [2024-11-07 11:01:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 11:01:27,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:27,724 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:27,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:01:27,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:27,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash -224934086, now seen corresponding path program 1 times [2024-11-07 11:01:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:27,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662778699] [2024-11-07 11:01:27,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:27,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662778699] [2024-11-07 11:01:27,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662778699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:27,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:27,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:01:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064028778] [2024-11-07 11:01:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:27,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:01:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:27,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:01:27,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:01:27,936 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:27,978 INFO L93 Difference]: Finished difference Result 278 states and 401 transitions. [2024-11-07 11:01:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:01:27,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-07 11:01:27,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:27,980 INFO L225 Difference]: With dead ends: 278 [2024-11-07 11:01:27,980 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 11:01:27,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:01:27,980 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:27,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 11:01:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-07 11:01:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 123 states have (on average 1.3739837398373984) internal successors, (169), 123 states have internal predecessors, (169), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:01:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 203 transitions. [2024-11-07 11:01:28,001 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 203 transitions. Word has length 145 [2024-11-07 11:01:28,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:28,002 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 203 transitions. [2024-11-07 11:01:28,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 203 transitions. [2024-11-07 11:01:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 11:01:28,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:28,003 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:28,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:01:28,004 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:28,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1744053021, now seen corresponding path program 1 times [2024-11-07 11:01:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:28,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780094424] [2024-11-07 11:01:28,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:28,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:29,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:29,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780094424] [2024-11-07 11:01:29,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780094424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:29,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:29,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 11:01:29,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974047894] [2024-11-07 11:01:29,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:29,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:01:29,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:29,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:01:29,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:01:29,610 INFO L87 Difference]: Start difference. First operand 142 states and 203 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:30,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:30,228 INFO L93 Difference]: Finished difference Result 364 states and 521 transitions. [2024-11-07 11:01:30,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:01:30,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2024-11-07 11:01:30,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:30,230 INFO L225 Difference]: With dead ends: 364 [2024-11-07 11:01:30,230 INFO L226 Difference]: Without dead ends: 225 [2024-11-07 11:01:30,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-07 11:01:30,231 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 545 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:30,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 399 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 11:01:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-07 11:01:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2024-11-07 11:01:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 127 states have internal predecessors, (175), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:01:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 209 transitions. [2024-11-07 11:01:30,243 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 209 transitions. Word has length 145 [2024-11-07 11:01:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:30,243 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 209 transitions. [2024-11-07 11:01:30,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 209 transitions. [2024-11-07 11:01:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 11:01:30,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:30,244 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:30,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 11:01:30,244 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:30,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash 885375514, now seen corresponding path program 1 times [2024-11-07 11:01:30,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:30,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864987373] [2024-11-07 11:01:30,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:30,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:31,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:31,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864987373] [2024-11-07 11:01:31,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864987373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:31,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:31,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 11:01:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4018847] [2024-11-07 11:01:31,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:31,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:01:31,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:01:31,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:01:31,274 INFO L87 Difference]: Start difference. First operand 146 states and 209 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:31,796 INFO L93 Difference]: Finished difference Result 352 states and 502 transitions. [2024-11-07 11:01:31,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:01:31,797 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-11-07 11:01:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:31,798 INFO L225 Difference]: With dead ends: 352 [2024-11-07 11:01:31,798 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 11:01:31,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-07 11:01:31,798 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 560 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:31,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 513 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 11:01:31,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 11:01:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 163. [2024-11-07 11:01:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 144 states have (on average 1.4027777777777777) internal successors, (202), 144 states have internal predecessors, (202), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:01:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 236 transitions. [2024-11-07 11:01:31,808 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 236 transitions. Word has length 146 [2024-11-07 11:01:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:31,808 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 236 transitions. [2024-11-07 11:01:31,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 236 transitions. [2024-11-07 11:01:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 11:01:31,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:31,810 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:31,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 11:01:31,810 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:31,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:31,810 INFO L85 PathProgramCache]: Analyzing trace with hash 143086974, now seen corresponding path program 1 times [2024-11-07 11:01:31,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:31,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744924692] [2024-11-07 11:01:31,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:33,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:33,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744924692] [2024-11-07 11:01:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744924692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:33,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:01:33,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285553275] [2024-11-07 11:01:33,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:33,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 11:01:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:33,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 11:01:33,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:01:33,346 INFO L87 Difference]: Start difference. First operand 163 states and 236 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:33,995 INFO L93 Difference]: Finished difference Result 329 states and 476 transitions. [2024-11-07 11:01:33,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:01:33,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-11-07 11:01:33,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:33,997 INFO L225 Difference]: With dead ends: 329 [2024-11-07 11:01:33,997 INFO L226 Difference]: Without dead ends: 169 [2024-11-07 11:01:33,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-07 11:01:33,997 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 280 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:33,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 390 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 11:01:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-07 11:01:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2024-11-07 11:01:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.3828125) internal successors, (177), 128 states have internal predecessors, (177), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:01:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 211 transitions. [2024-11-07 11:01:34,006 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 211 transitions. Word has length 147 [2024-11-07 11:01:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:34,006 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 211 transitions. [2024-11-07 11:01:34,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 211 transitions. [2024-11-07 11:01:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 11:01:34,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:34,008 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:34,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 11:01:34,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:34,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:34,008 INFO L85 PathProgramCache]: Analyzing trace with hash 945808159, now seen corresponding path program 1 times [2024-11-07 11:01:34,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:34,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550058348] [2024-11-07 11:01:34,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:34,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:34,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550058348] [2024-11-07 11:01:34,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550058348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:34,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:34,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:01:34,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59378265] [2024-11-07 11:01:34,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:34,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:01:34,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:34,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:01:34,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:34,600 INFO L87 Difference]: Start difference. First operand 147 states and 211 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:34,824 INFO L93 Difference]: Finished difference Result 436 states and 628 transitions. [2024-11-07 11:01:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:01:34,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-11-07 11:01:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:34,827 INFO L225 Difference]: With dead ends: 436 [2024-11-07 11:01:34,827 INFO L226 Difference]: Without dead ends: 292 [2024-11-07 11:01:34,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:01:34,829 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 137 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:34,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 379 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 11:01:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-07 11:01:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 233. [2024-11-07 11:01:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 196 states have (on average 1.3520408163265305) internal successors, (265), 196 states have internal predecessors, (265), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 11:01:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 333 transitions. [2024-11-07 11:01:34,851 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 333 transitions. Word has length 147 [2024-11-07 11:01:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:34,852 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 333 transitions. [2024-11-07 11:01:34,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 333 transitions. [2024-11-07 11:01:34,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 11:01:34,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:34,853 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:34,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 11:01:34,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:34,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1270086649, now seen corresponding path program 1 times [2024-11-07 11:01:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:34,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318409993] [2024-11-07 11:01:34,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:34,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:35,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:35,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318409993] [2024-11-07 11:01:35,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318409993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:35,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:35,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:01:35,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517683452] [2024-11-07 11:01:35,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:35,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:01:35,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:35,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:01:35,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:01:35,392 INFO L87 Difference]: Start difference. First operand 233 states and 333 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:35,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:35,739 INFO L93 Difference]: Finished difference Result 418 states and 595 transitions. [2024-11-07 11:01:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:01:35,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-07 11:01:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:35,742 INFO L225 Difference]: With dead ends: 418 [2024-11-07 11:01:35,742 INFO L226 Difference]: Without dead ends: 274 [2024-11-07 11:01:35,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:01:35,744 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 43 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:35,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 523 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 11:01:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-07 11:01:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 238. [2024-11-07 11:01:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 201 states have (on average 1.3532338308457712) internal successors, (272), 201 states have internal predecessors, (272), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 11:01:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 340 transitions. [2024-11-07 11:01:35,773 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 340 transitions. Word has length 151 [2024-11-07 11:01:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:35,774 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 340 transitions. [2024-11-07 11:01:35,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 340 transitions. [2024-11-07 11:01:35,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 11:01:35,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:35,776 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:35,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 11:01:35,776 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:35,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:35,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1488941367, now seen corresponding path program 1 times [2024-11-07 11:01:35,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:35,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141243826] [2024-11-07 11:01:35,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:35,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:36,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:36,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141243826] [2024-11-07 11:01:36,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141243826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:36,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:36,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:01:36,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649060362] [2024-11-07 11:01:36,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:36,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:01:36,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:36,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:01:36,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:01:36,272 INFO L87 Difference]: Start difference. First operand 238 states and 340 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:36,808 INFO L93 Difference]: Finished difference Result 449 states and 639 transitions. [2024-11-07 11:01:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:01:36,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-07 11:01:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:36,811 INFO L225 Difference]: With dead ends: 449 [2024-11-07 11:01:36,811 INFO L226 Difference]: Without dead ends: 300 [2024-11-07 11:01:36,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:01:36,813 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 120 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:36,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 638 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 11:01:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-07 11:01:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 244. [2024-11-07 11:01:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 207 states have internal predecessors, (278), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 11:01:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 346 transitions. [2024-11-07 11:01:36,842 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 346 transitions. Word has length 151 [2024-11-07 11:01:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:36,843 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 346 transitions. [2024-11-07 11:01:36,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 346 transitions. [2024-11-07 11:01:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 11:01:36,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:36,845 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:36,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 11:01:36,845 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:36,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash -541227323, now seen corresponding path program 1 times [2024-11-07 11:01:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:36,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121331847] [2024-11-07 11:01:36,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:36,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:38,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:38,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121331847] [2024-11-07 11:01:38,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121331847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:38,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:38,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 11:01:38,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063134709] [2024-11-07 11:01:38,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:38,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:01:38,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:38,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:01:38,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:01:38,376 INFO L87 Difference]: Start difference. First operand 244 states and 346 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:39,201 INFO L93 Difference]: Finished difference Result 473 states and 670 transitions. [2024-11-07 11:01:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:01:39,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2024-11-07 11:01:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:39,203 INFO L225 Difference]: With dead ends: 473 [2024-11-07 11:01:39,203 INFO L226 Difference]: Without dead ends: 324 [2024-11-07 11:01:39,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-07 11:01:39,204 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 527 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:39,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 492 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 11:01:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-07 11:01:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 240. [2024-11-07 11:01:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.3399014778325122) internal successors, (272), 203 states have internal predecessors, (272), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 11:01:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 340 transitions. [2024-11-07 11:01:39,233 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 340 transitions. Word has length 152 [2024-11-07 11:01:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:39,233 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 340 transitions. [2024-11-07 11:01:39,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:01:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 340 transitions. [2024-11-07 11:01:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 11:01:39,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:39,236 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:39,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 11:01:39,236 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:39,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash 422808358, now seen corresponding path program 1 times [2024-11-07 11:01:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:39,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575516315] [2024-11-07 11:01:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:41,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:41,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575516315] [2024-11-07 11:01:41,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575516315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:41,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:41,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 11:01:41,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737418039] [2024-11-07 11:01:41,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:41,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 11:01:41,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:41,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 11:01:41,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 11:01:41,480 INFO L87 Difference]: Start difference. First operand 240 states and 340 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 11:01:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:42,174 INFO L93 Difference]: Finished difference Result 473 states and 667 transitions. [2024-11-07 11:01:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:01:42,175 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 152 [2024-11-07 11:01:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:42,176 INFO L225 Difference]: With dead ends: 473 [2024-11-07 11:01:42,176 INFO L226 Difference]: Without dead ends: 326 [2024-11-07 11:01:42,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-07 11:01:42,177 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 426 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:42,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 542 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 11:01:42,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-07 11:01:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 297. [2024-11-07 11:01:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 260 states have (on average 1.3461538461538463) internal successors, (350), 260 states have internal predecessors, (350), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 11:01:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 418 transitions. [2024-11-07 11:01:42,198 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 418 transitions. Word has length 152 [2024-11-07 11:01:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:42,198 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 418 transitions. [2024-11-07 11:01:42,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 11:01:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 418 transitions. [2024-11-07 11:01:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 11:01:42,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:42,199 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:42,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 11:01:42,199 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:42,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:42,200 INFO L85 PathProgramCache]: Analyzing trace with hash 705062213, now seen corresponding path program 1 times [2024-11-07 11:01:42,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:42,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318405638] [2024-11-07 11:01:42,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:42,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:43,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:43,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318405638] [2024-11-07 11:01:43,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318405638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:43,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:43,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 11:01:43,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051349258] [2024-11-07 11:01:43,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:43,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:01:43,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:43,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:01:43,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:01:43,479 INFO L87 Difference]: Start difference. First operand 297 states and 418 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:44,010 INFO L93 Difference]: Finished difference Result 665 states and 941 transitions. [2024-11-07 11:01:44,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:01:44,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-07 11:01:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:44,013 INFO L225 Difference]: With dead ends: 665 [2024-11-07 11:01:44,013 INFO L226 Difference]: Without dead ends: 473 [2024-11-07 11:01:44,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-07 11:01:44,014 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 322 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:44,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 568 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 11:01:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-07 11:01:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 305. [2024-11-07 11:01:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 268 states have (on average 1.3507462686567164) internal successors, (362), 268 states have internal predecessors, (362), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 11:01:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 430 transitions. [2024-11-07 11:01:44,041 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 430 transitions. Word has length 152 [2024-11-07 11:01:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:44,041 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 430 transitions. [2024-11-07 11:01:44,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 430 transitions. [2024-11-07 11:01:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 11:01:44,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:44,043 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:44,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 11:01:44,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:44,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1628395318, now seen corresponding path program 1 times [2024-11-07 11:01:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:44,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537606473] [2024-11-07 11:01:44,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:44,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:45,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:45,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537606473] [2024-11-07 11:01:45,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537606473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:45,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:45,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 11:01:45,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023787802] [2024-11-07 11:01:45,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:45,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:01:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:45,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:01:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:01:45,746 INFO L87 Difference]: Start difference. First operand 305 states and 430 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:46,404 INFO L93 Difference]: Finished difference Result 501 states and 714 transitions. [2024-11-07 11:01:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:01:46,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2024-11-07 11:01:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:46,406 INFO L225 Difference]: With dead ends: 501 [2024-11-07 11:01:46,406 INFO L226 Difference]: Without dead ends: 305 [2024-11-07 11:01:46,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-07 11:01:46,407 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 269 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:46,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 522 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 11:01:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-07 11:01:46,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 245. [2024-11-07 11:01:46,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 208 states have (on average 1.3173076923076923) internal successors, (274), 208 states have internal predecessors, (274), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 11:01:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 342 transitions. [2024-11-07 11:01:46,429 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 342 transitions. Word has length 154 [2024-11-07 11:01:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:46,430 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 342 transitions. [2024-11-07 11:01:46,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 342 transitions. [2024-11-07 11:01:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 11:01:46,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:46,431 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:46,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 11:01:46,431 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:46,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:46,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1686606453, now seen corresponding path program 1 times [2024-11-07 11:01:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:46,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289762643] [2024-11-07 11:01:46,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:46,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:46,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:46,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289762643] [2024-11-07 11:01:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289762643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:46,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:46,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:01:46,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251425792] [2024-11-07 11:01:46,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:46,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 11:01:46,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:46,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 11:01:46,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 11:01:46,504 INFO L87 Difference]: Start difference. First operand 245 states and 342 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:46,530 INFO L93 Difference]: Finished difference Result 406 states and 571 transitions. [2024-11-07 11:01:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 11:01:46,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2024-11-07 11:01:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:46,532 INFO L225 Difference]: With dead ends: 406 [2024-11-07 11:01:46,532 INFO L226 Difference]: Without dead ends: 247 [2024-11-07 11:01:46,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 11:01:46,534 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:46,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:46,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-07 11:01:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-07 11:01:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 210 states have (on average 1.3142857142857143) internal successors, (276), 210 states have internal predecessors, (276), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 11:01:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 344 transitions. [2024-11-07 11:01:46,559 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 344 transitions. Word has length 154 [2024-11-07 11:01:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:46,559 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 344 transitions. [2024-11-07 11:01:46,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:01:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 344 transitions. [2024-11-07 11:01:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 11:01:46,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:46,560 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:46,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 11:01:46,560 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:46,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1541026190, now seen corresponding path program 1 times [2024-11-07 11:01:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:46,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441037445] [2024-11-07 11:01:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:01:47,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:47,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441037445] [2024-11-07 11:01:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441037445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:47,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:47,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 11:01:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028356629] [2024-11-07 11:01:47,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:47,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 11:01:47,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:47,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 11:01:47,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 11:01:47,840 INFO L87 Difference]: Start difference. First operand 247 states and 344 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-07 11:01:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:48,529 INFO L93 Difference]: Finished difference Result 252 states and 349 transitions. [2024-11-07 11:01:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:01:48,529 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 154 [2024-11-07 11:01:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:48,531 INFO L225 Difference]: With dead ends: 252 [2024-11-07 11:01:48,531 INFO L226 Difference]: Without dead ends: 250 [2024-11-07 11:01:48,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-07 11:01:48,532 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 364 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:48,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 482 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 11:01:48,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-07 11:01:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-11-07 11:01:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 213 states have (on average 1.3098591549295775) internal successors, (279), 213 states have internal predecessors, (279), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 11:01:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 347 transitions. [2024-11-07 11:01:48,561 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 347 transitions. Word has length 154 [2024-11-07 11:01:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:48,562 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 347 transitions. [2024-11-07 11:01:48,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-07 11:01:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 347 transitions. [2024-11-07 11:01:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 11:01:48,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:48,563 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:48,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 11:01:48,563 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:48,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:48,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1539179148, now seen corresponding path program 1 times [2024-11-07 11:01:48,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:48,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925435885] [2024-11-07 11:01:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:48,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 11:01:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 11:01:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:01:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 11:01:50,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:50,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925435885] [2024-11-07 11:01:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925435885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:01:50,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154248963] [2024-11-07 11:01:50,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:50,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:01:50,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:01:50,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:01:50,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 11:01:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-07 11:01:51,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:51,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2024-11-07 11:01:51,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 85 [2024-11-07 11:01:52,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 85 [2024-11-07 11:01:53,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 85 [2024-11-07 11:01:54,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 85 [2024-11-07 11:01:54,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 85 [2024-11-07 11:01:55,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 85 [2024-11-07 11:01:57,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 99 [2024-11-07 11:01:59,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 99 [2024-11-07 11:02:00,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 99 [2024-11-07 11:02:01,272 INFO L349 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2024-11-07 11:02:01,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 111 [2024-11-07 11:02:02,612 INFO L349 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2024-11-07 11:02:02,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 511 treesize of output 462 [2024-11-07 11:02:04,818 INFO L349 Elim1Store]: treesize reduction 96, result has 41.8 percent of original size [2024-11-07 11:02:04,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1177 treesize of output 1225