./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.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_operatoramount_amount100_file-92.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', 'e9518b729fb33f0de408129e2e0e3cb97ea8e11de366001cefdd2574471f584b'] 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_operatoramount_amount100_file-92.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 e9518b729fb33f0de408129e2e0e3cb97ea8e11de366001cefdd2574471f584b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:11:14,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:11:14,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:11:14,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:11:14,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:11:14,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:11:14,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:11:14,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:11:14,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:11:14,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:11:14,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:11:14,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:11:14,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:11:14,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:11:14,473 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:11:14,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:11:14,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:11:14,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:11:14,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:11:14,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:11:14,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:11:14,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:11:14,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:11:14,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:11:14,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:11:14,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:11:14,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:11:14,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:11:14,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:11:14,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:11:14,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:11:14,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:11:14,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:11:14,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:11:14,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:11:14,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:11:14,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:11:14,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:11:14,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:11:14,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:11:14,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:11:14,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:11:14,476 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 -> e9518b729fb33f0de408129e2e0e3cb97ea8e11de366001cefdd2574471f584b [2024-11-07 09:11:14,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:11:14,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:11:14,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:11:14,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:11:14,741 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:11:14,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i [2024-11-07 09:11:16,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:11:16,244 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:11:16,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i [2024-11-07 09:11:16,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c628f06b9/696ba96ceb974ee7b6c99a3621654b47/FLAGd66a07975 [2024-11-07 09:11:16,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c628f06b9/696ba96ceb974ee7b6c99a3621654b47 [2024-11-07 09:11:16,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:11:16,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:11:16,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:11:16,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:11:16,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:11:16,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3165118d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16, skipping insertion in model container [2024-11-07 09:11:16,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:11:16,422 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_operatoramount_amount100_file-92.i[916,929] [2024-11-07 09:11:16,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:11:16,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:11:16,518 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_operatoramount_amount100_file-92.i[916,929] [2024-11-07 09:11:16,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:11:16,564 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:11:16,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16 WrapperNode [2024-11-07 09:11:16,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:11:16,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:11:16,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:11:16,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:11:16,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,640 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 310 [2024-11-07 09:11:16,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:11:16,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:11:16,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:11:16,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:11:16,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,673 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 09:11:16,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:11:16,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:11:16,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:11:16,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:11:16,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (1/1) ... [2024-11-07 09:11:16,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:11:16,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:11:16,753 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 09:11:16,759 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 09:11:16,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:11:16,780 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:11:16,781 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:11:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:11:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:11:16,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:11:16,858 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:11:16,859 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:11:17,460 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-07 09:11:17,460 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:11:17,476 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:11:17,477 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:11:17,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:11:17 BoogieIcfgContainer [2024-11-07 09:11:17,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:11:17,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:11:17,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:11:17,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:11:17,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:11:16" (1/3) ... [2024-11-07 09:11:17,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162c1572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:11:17, skipping insertion in model container [2024-11-07 09:11:17,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:11:16" (2/3) ... [2024-11-07 09:11:17,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162c1572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:11:17, skipping insertion in model container [2024-11-07 09:11:17,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:11:17" (3/3) ... [2024-11-07 09:11:17,490 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-92.i [2024-11-07 09:11:17,503 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:11:17,503 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:11:17,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:11:17,573 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;@71cd93e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:11:17,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:11:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 102 states have (on average 1.5) internal successors, (153), 103 states have internal predecessors, (153), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 09:11:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 09:11:17,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:11:17,597 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:17,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:11:17,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:11:17,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1137290694, now seen corresponding path program 1 times [2024-11-07 09:11:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:11:17,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163108448] [2024-11-07 09:11:17,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:11:17,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:11:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:11:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:11:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:11:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:11:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:11:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:11:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:11:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:11:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:11:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 09:11:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:11:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 09:11:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:11:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 09:11:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:11:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 09:11:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:11:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 09:11:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 09:11:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 09:11:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 09:11:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 09:11:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 09:11:17,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:11:17,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163108448] [2024-11-07 09:11:17,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163108448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:11:17,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:11:17,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:11:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262017664] [2024-11-07 09:11:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:11:17,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:11:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:11:18,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:11:18,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:11:18,013 INFO L87 Difference]: Start difference. First operand has 127 states, 102 states have (on average 1.5) internal successors, (153), 103 states have internal predecessors, (153), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 09:11:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:11:18,052 INFO L93 Difference]: Finished difference Result 247 states and 410 transitions. [2024-11-07 09:11:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:11:18,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 159 [2024-11-07 09:11:18,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:11:18,060 INFO L225 Difference]: With dead ends: 247 [2024-11-07 09:11:18,060 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 09:11:18,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 09:11:18,065 INFO L432 NwaCegarLoop]: 190 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, 190 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 09:11:18,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:11:18,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 09:11:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-07 09:11:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 99 states have internal predecessors, (146), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 09:11:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2024-11-07 09:11:18,111 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 159 [2024-11-07 09:11:18,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:11:18,111 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2024-11-07 09:11:18,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 09:11:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2024-11-07 09:11:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 09:11:18,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:11:18,115 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:18,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:11:18,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:11:18,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:11:18,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1680904898, now seen corresponding path program 1 times [2024-11-07 09:11:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:11:18,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6297239] [2024-11-07 09:11:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:11:18,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:11:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:11:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:11:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:11:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:11:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:11:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:11:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:11:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:11:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:11:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 09:11:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:11:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 09:11:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:11:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 09:11:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:11:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 09:11:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:11:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 09:11:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 09:11:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 09:11:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 09:11:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 09:11:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 09:11:18,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:11:18,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6297239] [2024-11-07 09:11:18,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6297239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:11:18,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:11:18,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:11:18,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569469551] [2024-11-07 09:11:18,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:11:18,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:11:18,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:11:18,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:11:18,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:11:18,785 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 09:11:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:11:18,902 INFO L93 Difference]: Finished difference Result 363 states and 564 transitions. [2024-11-07 09:11:18,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:11:18,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2024-11-07 09:11:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:11:18,905 INFO L225 Difference]: With dead ends: 363 [2024-11-07 09:11:18,905 INFO L226 Difference]: Without dead ends: 243 [2024-11-07 09:11:18,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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 09:11:18,907 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 134 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:11:18,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 410 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:11:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-07 09:11:18,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2024-11-07 09:11:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 194 states have (on average 1.4742268041237114) internal successors, (286), 194 states have internal predecessors, (286), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 09:11:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 374 transitions. [2024-11-07 09:11:18,938 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 374 transitions. Word has length 159 [2024-11-07 09:11:18,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:11:18,939 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 374 transitions. [2024-11-07 09:11:18,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 09:11:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 374 transitions. [2024-11-07 09:11:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 09:11:18,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:11:18,942 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:18,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:11:18,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:11:18,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:11:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1831185428, now seen corresponding path program 1 times [2024-11-07 09:11:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:11:18,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764801377] [2024-11-07 09:11:18,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:11:18,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:11:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:11:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:11:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:11:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:11:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:11:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:11:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:11:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:11:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:11:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 09:11:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:11:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 09:11:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:11:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 09:11:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:11:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 09:11:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:11:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 09:11:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 09:11:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 09:11:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 09:11:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 09:11:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:19,443 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 09:11:19,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:11:19,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764801377] [2024-11-07 09:11:19,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764801377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:11:19,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:11:19,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:11:19,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122694551] [2024-11-07 09:11:19,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:11:19,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 09:11:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:11:19,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 09:11:19,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:11:19,445 INFO L87 Difference]: Start difference. First operand 241 states and 374 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 09:11:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:11:19,831 INFO L93 Difference]: Finished difference Result 1039 states and 1595 transitions. [2024-11-07 09:11:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 09:11:19,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 09:11:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:11:19,842 INFO L225 Difference]: With dead ends: 1039 [2024-11-07 09:11:19,842 INFO L226 Difference]: Without dead ends: 801 [2024-11-07 09:11:19,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:11:19,846 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 594 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:11:19,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 719 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 09:11:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-07 09:11:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 493. [2024-11-07 09:11:19,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 400 states have (on average 1.49) internal successors, (596), 400 states have internal predecessors, (596), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-07 09:11:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 772 transitions. [2024-11-07 09:11:19,967 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 772 transitions. Word has length 160 [2024-11-07 09:11:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:11:19,967 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 772 transitions. [2024-11-07 09:11:19,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 09:11:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 772 transitions. [2024-11-07 09:11:19,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 09:11:19,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:11:19,975 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:19,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:11:19,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:11:19,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:11:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1965198934, now seen corresponding path program 1 times [2024-11-07 09:11:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:11:19,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865236341] [2024-11-07 09:11:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:11:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:11:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:11:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:11:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:11:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:11:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:11:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:11:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:11:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:11:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:11:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 09:11:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:11:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 09:11:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:11:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 09:11:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:11:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 09:11:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:11:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 09:11:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 09:11:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 09:11:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 09:11:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 09:11:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 09:11:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:11:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865236341] [2024-11-07 09:11:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865236341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:11:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:11:20,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 09:11:20,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948063426] [2024-11-07 09:11:20,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:11:20,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:11:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:11:20,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:11:20,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:11:20,703 INFO L87 Difference]: Start difference. First operand 493 states and 772 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 09:11:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:11:21,588 INFO L93 Difference]: Finished difference Result 1163 states and 1795 transitions. [2024-11-07 09:11:21,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 09:11:21,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 09:11:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:11:21,598 INFO L225 Difference]: With dead ends: 1163 [2024-11-07 09:11:21,599 INFO L226 Difference]: Without dead ends: 917 [2024-11-07 09:11:21,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:11:21,601 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1178 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 09:11:21,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 895 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 09:11:21,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-07 09:11:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 739. [2024-11-07 09:11:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 602 states have (on average 1.4900332225913622) internal successors, (897), 603 states have internal predecessors, (897), 130 states have call successors, (130), 6 states have call predecessors, (130), 6 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-07 09:11:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1157 transitions. [2024-11-07 09:11:21,716 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1157 transitions. Word has length 160 [2024-11-07 09:11:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:11:21,717 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1157 transitions. [2024-11-07 09:11:21,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 09:11:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1157 transitions. [2024-11-07 09:11:21,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 09:11:21,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:11:21,722 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:21,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 09:11:21,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:11:21,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:11:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1230100243, now seen corresponding path program 1 times [2024-11-07 09:11:21,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:11:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708085449] [2024-11-07 09:11:21,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:11:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:11:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:11:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:11:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:11:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:11:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:11:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:11:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:11:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:11:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:11:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 09:11:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:11:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 09:11:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:11:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 09:11:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:11:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 09:11:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:11:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 09:11:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 09:11:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 09:11:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 09:11:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 09:11:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 09:11:42,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:11:42,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708085449] [2024-11-07 09:11:42,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708085449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:11:42,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:11:42,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 09:11:42,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162639744] [2024-11-07 09:11:42,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:11:42,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 09:11:42,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:11:42,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 09:11:42,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:11:42,226 INFO L87 Difference]: Start difference. First operand 739 states and 1157 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 09:11:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:11:47,593 INFO L93 Difference]: Finished difference Result 2625 states and 4046 transitions. [2024-11-07 09:11:47,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 09:11:47,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 09:11:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:11:47,604 INFO L225 Difference]: With dead ends: 2625 [2024-11-07 09:11:47,604 INFO L226 Difference]: Without dead ends: 1889 [2024-11-07 09:11:47,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:11:47,607 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 478 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:11:47,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 717 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-07 09:11:47,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2024-11-07 09:11:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 949. [2024-11-07 09:11:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 812 states have (on average 1.5160098522167487) internal successors, (1231), 813 states have internal predecessors, (1231), 130 states have call successors, (130), 6 states have call predecessors, (130), 6 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-07 09:11:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1491 transitions. [2024-11-07 09:11:47,684 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1491 transitions. Word has length 160 [2024-11-07 09:11:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:11:47,684 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1491 transitions. [2024-11-07 09:11:47,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 09:11:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1491 transitions. [2024-11-07 09:11:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 09:11:47,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:11:47,687 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:47,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 09:11:47,688 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:11:47,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:11:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1011245525, now seen corresponding path program 1 times [2024-11-07 09:11:47,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:11:47,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705038759] [2024-11-07 09:11:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:11:47,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:11:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:11:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:11:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:11:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:11:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:11:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:11:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:11:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:11:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:11:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 09:11:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:11:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 09:11:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:11:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 09:11:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:11:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 09:11:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:11:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 09:11:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 09:11:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 09:11:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 09:11:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 09:11:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:11:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 09:11:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:11:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705038759] [2024-11-07 09:11:50,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705038759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:11:50,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:11:50,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 09:11:50,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714361044] [2024-11-07 09:11:50,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:11:50,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 09:11:50,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:11:50,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 09:11:50,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:11:50,992 INFO L87 Difference]: Start difference. First operand 949 states and 1491 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 09:11:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:11:53,168 INFO L93 Difference]: Finished difference Result 2628 states and 4080 transitions. [2024-11-07 09:11:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 09:11:53,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 09:11:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:11:53,177 INFO L225 Difference]: With dead ends: 2628 [2024-11-07 09:11:53,177 INFO L226 Difference]: Without dead ends: 1682 [2024-11-07 09:11:53,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:11:53,180 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 384 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 09:11:53,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 751 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 09:11:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2024-11-07 09:11:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 949. [2024-11-07 09:11:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 812 states have (on average 1.5160098522167487) internal successors, (1231), 813 states have internal predecessors, (1231), 130 states have call successors, (130), 6 states have call predecessors, (130), 6 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-07 09:11:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1491 transitions. [2024-11-07 09:11:53,244 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1491 transitions. Word has length 160 [2024-11-07 09:11:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:11:53,245 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1491 transitions. [2024-11-07 09:11:53,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 09:11:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1491 transitions. [2024-11-07 09:11:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 09:11:53,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:11:53,251 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:53,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 09:11:53,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:11:53,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:11:53,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1013499885, now seen corresponding path program 1 times [2024-11-07 09:11:53,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:11:53,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873029500] [2024-11-07 09:11:53,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:11:53,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:11:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat