./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label02.c --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/eca-rers2012/Problem10_label02.c', '-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', 'dabfb11a5597c878c4111fedcc12f0c41145d68b0087981aef78b30abe61727d'] 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/eca-rers2012/Problem10_label02.c -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 dabfb11a5597c878c4111fedcc12f0c41145d68b0087981aef78b30abe61727d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:35:37,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:35:37,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:35:37,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:35:37,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:35:37,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:35:37,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:35:37,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:35:37,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:35:37,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:35:37,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:35:37,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:35:37,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:35:37,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:35:37,512 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:35:37,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:35:37,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:35:37,513 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:35:37,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:35:37,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:35:37,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:35:37,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:35:37,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:35:37,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:35:37,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:35:37,514 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:35:37,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:35:37,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:35:37,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:35:37,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:35:37,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:35:37,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:35:37,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:35:37,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:35:37,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:35:37,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:35:37,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:35:37,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:35:37,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:35:37,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:35:37,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:35:37,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:35:37,516 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 -> dabfb11a5597c878c4111fedcc12f0c41145d68b0087981aef78b30abe61727d [2024-11-06 19:35:37,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:35:37,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:35:37,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:35:37,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:35:37,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:35:37,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label02.c [2024-11-06 19:35:39,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:35:39,533 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:35:39,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label02.c [2024-11-06 19:35:39,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/507e7178f/25c7de5bb37a463c8dea8080ac0bf53a/FLAGd2a68da2a [2024-11-06 19:35:39,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/507e7178f/25c7de5bb37a463c8dea8080ac0bf53a [2024-11-06 19:35:39,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:35:39,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:35:39,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:35:39,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:35:39,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:35:39,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:35:39" (1/1) ... [2024-11-06 19:35:39,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52adc3b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:39, skipping insertion in model container [2024-11-06 19:35:39,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:35:39" (1/1) ... [2024-11-06 19:35:39,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:35:40,016 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/eca-rers2012/Problem10_label02.c[6766,6779] [2024-11-06 19:35:40,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:35:40,133 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:35:40,166 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/eca-rers2012/Problem10_label02.c[6766,6779] [2024-11-06 19:35:40,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:35:40,232 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:35:40,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40 WrapperNode [2024-11-06 19:35:40,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:35:40,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:35:40,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:35:40,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:35:40,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (1/1) ... [2024-11-06 19:35:40,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (1/1) ... [2024-11-06 19:35:40,315 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-06 19:35:40,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:35:40,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:35:40,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:35:40,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:35:40,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (1/1) ... [2024-11-06 19:35:40,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (1/1) ... [2024-11-06 19:35:40,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (1/1) ... [2024-11-06 19:35:40,379 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-06 19:35:40,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (1/1) ... [2024-11-06 19:35:40,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (1/1) ... [2024-11-06 19:35:40,413 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (1/1) ... [2024-11-06 19:35:40,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (1/1) ... [2024-11-06 19:35:40,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (1/1) ... [2024-11-06 19:35:40,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (1/1) ... [2024-11-06 19:35:40,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:35:40,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:35:40,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:35:40,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:35:40,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (1/1) ... [2024-11-06 19:35:40,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:35:40,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:35:40,494 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-06 19:35:40,498 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-06 19:35:40,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:35:40,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:35:40,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:35:40,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:35:40,590 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:35:40,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:35:41,868 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-06 19:35:41,868 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:35:41,884 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:35:41,885 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:35:41,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:35:41 BoogieIcfgContainer [2024-11-06 19:35:41,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:35:41,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:35:41,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:35:41,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:35:41,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:35:39" (1/3) ... [2024-11-06 19:35:41,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233ae302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:35:41, skipping insertion in model container [2024-11-06 19:35:41,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:40" (2/3) ... [2024-11-06 19:35:41,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233ae302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:35:41, skipping insertion in model container [2024-11-06 19:35:41,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:35:41" (3/3) ... [2024-11-06 19:35:41,899 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label02.c [2024-11-06 19:35:41,914 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:35:41,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:35:41,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:35:41,993 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;@166766de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:35:41,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:35:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:42,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-06 19:35:42,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:42,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:35:42,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:42,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash 118092897, now seen corresponding path program 1 times [2024-11-06 19:35:42,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:42,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342081872] [2024-11-06 19:35:42,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:42,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:35:42,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:42,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342081872] [2024-11-06 19:35:42,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342081872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:42,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:42,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:35:42,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708579309] [2024-11-06 19:35:42,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:42,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:35:42,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:42,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:35:42,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:35:42,516 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:43,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:43,421 INFO L93 Difference]: Finished difference Result 567 states and 981 transitions. [2024-11-06 19:35:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:35:43,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-06 19:35:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:43,435 INFO L225 Difference]: With dead ends: 567 [2024-11-06 19:35:43,436 INFO L226 Difference]: Without dead ends: 282 [2024-11-06 19:35:43,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:35:43,448 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 119 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:43,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 66 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:35:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-06 19:35:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-06 19:35:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4661921708185053) internal successors, (412), 281 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2024-11-06 19:35:43,499 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 59 [2024-11-06 19:35:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:43,499 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2024-11-06 19:35:43,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2024-11-06 19:35:43,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-06 19:35:43,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:43,504 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:35:43,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:35:43,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:43,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 362712702, now seen corresponding path program 1 times [2024-11-06 19:35:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:43,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366588077] [2024-11-06 19:35:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:35:43,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:43,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366588077] [2024-11-06 19:35:43,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366588077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:43,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:43,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:35:43,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460484568] [2024-11-06 19:35:43,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:43,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:35:43,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:43,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:35:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:35:43,828 INFO L87 Difference]: Start difference. First operand 282 states and 412 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:44,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:44,409 INFO L93 Difference]: Finished difference Result 840 states and 1231 transitions. [2024-11-06 19:35:44,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:35:44,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2024-11-06 19:35:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:44,417 INFO L225 Difference]: With dead ends: 840 [2024-11-06 19:35:44,418 INFO L226 Difference]: Without dead ends: 560 [2024-11-06 19:35:44,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:35:44,422 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 76 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:44,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 66 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:35:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-06 19:35:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-06 19:35:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3076923076923077) internal successors, (731), 559 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 731 transitions. [2024-11-06 19:35:44,470 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 731 transitions. Word has length 129 [2024-11-06 19:35:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:44,470 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 731 transitions. [2024-11-06 19:35:44,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 731 transitions. [2024-11-06 19:35:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-06 19:35:44,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:44,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-06 19:35:44,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:35:44,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:44,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:44,482 INFO L85 PathProgramCache]: Analyzing trace with hash -775661752, now seen corresponding path program 1 times [2024-11-06 19:35:44,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:44,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794653548] [2024-11-06 19:35:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:35:45,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:45,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794653548] [2024-11-06 19:35:45,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794653548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:45,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:45,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 19:35:45,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275143510] [2024-11-06 19:35:45,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:45,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 19:35:45,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:45,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 19:35:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:35:45,046 INFO L87 Difference]: Start difference. First operand 560 states and 731 transitions. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:45,633 INFO L93 Difference]: Finished difference Result 1173 states and 1515 transitions. [2024-11-06 19:35:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 19:35:45,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-11-06 19:35:45,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:45,637 INFO L225 Difference]: With dead ends: 1173 [2024-11-06 19:35:45,637 INFO L226 Difference]: Without dead ends: 560 [2024-11-06 19:35:45,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:35:45,639 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:45,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:35:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-06 19:35:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-06 19:35:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3005366726296959) internal successors, (727), 559 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 727 transitions. [2024-11-06 19:35:45,659 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 727 transitions. Word has length 134 [2024-11-06 19:35:45,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:45,660 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 727 transitions. [2024-11-06 19:35:45,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 727 transitions. [2024-11-06 19:35:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-06 19:35:45,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:45,662 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:35:45,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:35:45,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:45,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:45,663 INFO L85 PathProgramCache]: Analyzing trace with hash -902911376, now seen corresponding path program 1 times [2024-11-06 19:35:45,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:45,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330011834] [2024-11-06 19:35:45,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:45,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:35:45,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:45,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330011834] [2024-11-06 19:35:45,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330011834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:45,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:45,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:35:45,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768895250] [2024-11-06 19:35:45,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:45,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:35:45,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:45,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:35:45,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:35:45,845 INFO L87 Difference]: Start difference. First operand 560 states and 727 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:46,350 INFO L93 Difference]: Finished difference Result 1674 states and 2176 transitions. [2024-11-06 19:35:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:35:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-06 19:35:46,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:46,356 INFO L225 Difference]: With dead ends: 1674 [2024-11-06 19:35:46,356 INFO L226 Difference]: Without dead ends: 1116 [2024-11-06 19:35:46,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:35:46,358 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:46,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:35:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-06 19:35:46,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2024-11-06 19:35:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.2475336322869954) internal successors, (1391), 1115 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1391 transitions. [2024-11-06 19:35:46,392 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1391 transitions. Word has length 150 [2024-11-06 19:35:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:46,392 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1391 transitions. [2024-11-06 19:35:46,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1391 transitions. [2024-11-06 19:35:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-06 19:35:46,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:46,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:35:46,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:35:46,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:46,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1604737013, now seen corresponding path program 1 times [2024-11-06 19:35:46,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:46,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595792054] [2024-11-06 19:35:46,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:46,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:35:46,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:46,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595792054] [2024-11-06 19:35:46,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595792054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:46,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:46,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:35:46,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597944520] [2024-11-06 19:35:46,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:46,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:35:46,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:46,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:35:46,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:35:46,709 INFO L87 Difference]: Start difference. First operand 1116 states and 1391 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:47,162 INFO L93 Difference]: Finished difference Result 2369 states and 2928 transitions. [2024-11-06 19:35:47,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:35:47,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2024-11-06 19:35:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:47,168 INFO L225 Difference]: With dead ends: 2369 [2024-11-06 19:35:47,168 INFO L226 Difference]: Without dead ends: 1255 [2024-11-06 19:35:47,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:35:47,170 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:47,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 82 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:35:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-06 19:35:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-06 19:35:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.223285486443381) internal successors, (1534), 1254 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1534 transitions. [2024-11-06 19:35:47,209 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1534 transitions. Word has length 151 [2024-11-06 19:35:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:47,210 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1534 transitions. [2024-11-06 19:35:47,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1534 transitions. [2024-11-06 19:35:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-06 19:35:47,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:47,214 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:35:47,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:35:47,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:47,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:47,215 INFO L85 PathProgramCache]: Analyzing trace with hash -593130910, now seen corresponding path program 1 times [2024-11-06 19:35:47,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:47,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684731130] [2024-11-06 19:35:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:47,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 19:35:47,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:47,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684731130] [2024-11-06 19:35:47,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684731130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:35:47,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688021560] [2024-11-06 19:35:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:47,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:35:47,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:35:47,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:35:47,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 19:35:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:47,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:35:47,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:35:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:35:47,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:35:47,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688021560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:47,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:35:47,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 19:35:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634803443] [2024-11-06 19:35:47,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:47,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:35:47,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:47,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:35:47,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:35:47,807 INFO L87 Difference]: Start difference. First operand 1255 states and 1534 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:48,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:48,288 INFO L93 Difference]: Finished difference Result 2369 states and 2923 transitions. [2024-11-06 19:35:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:35:48,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2024-11-06 19:35:48,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:48,297 INFO L225 Difference]: With dead ends: 2369 [2024-11-06 19:35:48,297 INFO L226 Difference]: Without dead ends: 1255 [2024-11-06 19:35:48,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:35:48,299 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 105 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:48,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 164 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:35:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-06 19:35:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-06 19:35:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.200956937799043) internal successors, (1506), 1254 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1506 transitions. [2024-11-06 19:35:48,328 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1506 transitions. Word has length 170 [2024-11-06 19:35:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:48,329 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1506 transitions. [2024-11-06 19:35:48,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1506 transitions. [2024-11-06 19:35:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-06 19:35:48,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:48,332 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:35:48,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:35:48,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:35:48,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1778156436, now seen corresponding path program 1 times [2024-11-06 19:35:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:48,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795816143] [2024-11-06 19:35:48,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 19:35:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:48,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795816143] [2024-11-06 19:35:48,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795816143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:35:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051302565] [2024-11-06 19:35:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:48,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:35:48,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:35:48,902 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:35:48,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 19:35:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:49,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:35:49,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:35:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-06 19:35:49,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:35:49,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051302565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:49,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:35:49,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-06 19:35:49,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142424856] [2024-11-06 19:35:49,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:49,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:35:49,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:49,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:35:49,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:35:49,276 INFO L87 Difference]: Start difference. First operand 1255 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:49,755 INFO L93 Difference]: Finished difference Result 1674 states and 2014 transitions. [2024-11-06 19:35:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:35:49,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2024-11-06 19:35:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:49,763 INFO L225 Difference]: With dead ends: 1674 [2024-11-06 19:35:49,763 INFO L226 Difference]: Without dead ends: 1672 [2024-11-06 19:35:49,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:35:49,766 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:49,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 11 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:35:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2024-11-06 19:35:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1255. [2024-11-06 19:35:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.2001594896331738) internal successors, (1505), 1254 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1505 transitions. [2024-11-06 19:35:49,803 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1505 transitions. Word has length 189 [2024-11-06 19:35:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:49,803 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1505 transitions. [2024-11-06 19:35:49,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1505 transitions. [2024-11-06 19:35:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-06 19:35:49,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:49,811 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:35:49,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 19:35:50,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:35:50,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:50,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:50,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1310250032, now seen corresponding path program 1 times [2024-11-06 19:35:50,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:50,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38772561] [2024-11-06 19:35:50,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:50,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-06 19:35:50,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:50,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38772561] [2024-11-06 19:35:50,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38772561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:50,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:50,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 19:35:50,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951856334] [2024-11-06 19:35:50,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:50,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 19:35:50,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:50,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 19:35:50,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:35:50,470 INFO L87 Difference]: Start difference. First operand 1255 states and 1505 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:50,930 INFO L93 Difference]: Finished difference Result 2290 states and 2777 transitions. [2024-11-06 19:35:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 19:35:50,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233 [2024-11-06 19:35:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:50,931 INFO L225 Difference]: With dead ends: 2290 [2024-11-06 19:35:50,931 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:35:50,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:35:50,934 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 118 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:50,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 24 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:35:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:35:50,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:35:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:35:50,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2024-11-06 19:35:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:50,937 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:35:50,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:35:50,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:35:50,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:35:50,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:35:50,947 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:35:50,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:35:51,060 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:35:51,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:35:51 BoogieIcfgContainer [2024-11-06 19:35:51,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:35:51,082 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:35:51,082 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:35:51,082 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:35:51,083 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:35:41" (3/4) ... [2024-11-06 19:35:51,089 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:35:51,107 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 19:35:51,108 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:35:51,109 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:35:51,109 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:35:51,234 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:35:51,234 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:35:51,235 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:35:51,236 INFO L158 Benchmark]: Toolchain (without parser) took 11471.94ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 75.2MB in the beginning and 100.5MB in the end (delta: -25.3MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2024-11-06 19:35:51,236 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:35:51,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.54ms. Allocated memory is still 100.7MB. Free memory was 75.1MB in the beginning and 48.3MB in the end (delta: 26.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 19:35:51,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.91ms. Allocated memory is still 100.7MB. Free memory was 48.3MB in the beginning and 40.7MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 19:35:51,236 INFO L158 Benchmark]: Boogie Preprocessor took 140.37ms. Allocated memory is still 100.7MB. Free memory was 40.7MB in the beginning and 65.1MB in the end (delta: -24.4MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-06 19:35:51,237 INFO L158 Benchmark]: RCFGBuilder took 1430.81ms. Allocated memory is still 100.7MB. Free memory was 65.1MB in the beginning and 48.7MB in the end (delta: 16.4MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2024-11-06 19:35:51,237 INFO L158 Benchmark]: TraceAbstraction took 9187.55ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 48.1MB in the beginning and 111.1MB in the end (delta: -63.0MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-11-06 19:35:51,237 INFO L158 Benchmark]: Witness Printer took 152.97ms. Allocated memory is still 201.3MB. Free memory was 111.1MB in the beginning and 100.5MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 19:35:51,239 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.54ms. Allocated memory is still 100.7MB. Free memory was 75.1MB in the beginning and 48.3MB in the end (delta: 26.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.91ms. Allocated memory is still 100.7MB. Free memory was 48.3MB in the beginning and 40.7MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.37ms. Allocated memory is still 100.7MB. Free memory was 40.7MB in the beginning and 65.1MB in the end (delta: -24.4MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1430.81ms. Allocated memory is still 100.7MB. Free memory was 65.1MB in the beginning and 48.7MB in the end (delta: 16.4MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9187.55ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 48.1MB in the beginning and 111.1MB in the end (delta: -63.0MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * Witness Printer took 152.97ms. Allocated memory is still 201.3MB. Free memory was 111.1MB in the beginning and 100.5MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 191]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 746 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 746 mSDsluCounter, 472 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 398 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3464 IncrementalHoareTripleChecker+Invalid, 3862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 398 mSolverCounterUnsat, 417 mSDtfsCounter, 3464 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1255occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 417 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1574 NumberOfCodeBlocks, 1574 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1564 ConstructedInterpolants, 0 QuantifiedInterpolants, 7694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 513 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 538/626 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: (((((((a10 == 0) && (14 == a4)) && (a12 == 0)) && (a19 == 8)) || (((14 == a4) && (a12 == 0)) && (1 <= a10))) || (((a1 <= 23) && (14 == a4)) && (a12 == 0))) || (((14 == a4) && (a12 == 0)) && (9 <= a19))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:35:51,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE