./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label04.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/Problem02_label04.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', 'dfc7a2daf16de8ab0ea0e11c62b30033c40981748d5071b1cd9dbc5bcc0c3347'] 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/Problem02_label04.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 dfc7a2daf16de8ab0ea0e11c62b30033c40981748d5071b1cd9dbc5bcc0c3347 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:54:40,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:54:40,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:54:40,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:54:40,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:54:40,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:54:40,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:54:40,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:54:40,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:54:40,427 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:54:40,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:54:40,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:54:40,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:54:40,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:54:40,428 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:54:40,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:54:40,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:54:40,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:54:40,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:54:40,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:54:40,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:54:40,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:54:40,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:54:40,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:54:40,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:54:40,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:54:40,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:54:40,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:54:40,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:54:40,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:54:40,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:54:40,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:54:40,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:54:40,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:54:40,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:54:40,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:54:40,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:54:40,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:54:40,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:54:40,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:54:40,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:54:40,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:54:40,434 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 -> dfc7a2daf16de8ab0ea0e11c62b30033c40981748d5071b1cd9dbc5bcc0c3347 [2024-11-06 18:54:40,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:54:40,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:54:40,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:54:40,757 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:54:40,757 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:54:40,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label04.c [2024-11-06 18:54:42,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:54:42,405 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:54:42,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label04.c [2024-11-06 18:54:42,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34d8cd8fd/5c8420c2c73e47a58ebdb5889f11bb99/FLAGdb468fb39 [2024-11-06 18:54:42,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34d8cd8fd/5c8420c2c73e47a58ebdb5889f11bb99 [2024-11-06 18:54:42,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:54:42,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:54:42,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:54:42,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:54:42,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:54:42,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:54:42" (1/1) ... [2024-11-06 18:54:42,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12eb0c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:42, skipping insertion in model container [2024-11-06 18:54:42,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:54:42" (1/1) ... [2024-11-06 18:54:42,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:54:42,917 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/Problem02_label04.c[17470,17483] [2024-11-06 18:54:42,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:54:42,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:54:43,002 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/Problem02_label04.c[17470,17483] [2024-11-06 18:54:43,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:54:43,023 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:54:43,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43 WrapperNode [2024-11-06 18:54:43,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:54:43,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:54:43,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:54:43,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:54:43,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (1/1) ... [2024-11-06 18:54:43,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (1/1) ... [2024-11-06 18:54:43,090 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-06 18:54:43,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:54:43,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:54:43,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:54:43,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:54:43,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (1/1) ... [2024-11-06 18:54:43,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (1/1) ... [2024-11-06 18:54:43,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (1/1) ... [2024-11-06 18:54:43,128 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 18:54:43,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (1/1) ... [2024-11-06 18:54:43,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (1/1) ... [2024-11-06 18:54:43,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (1/1) ... [2024-11-06 18:54:43,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (1/1) ... [2024-11-06 18:54:43,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (1/1) ... [2024-11-06 18:54:43,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (1/1) ... [2024-11-06 18:54:43,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:54:43,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:54:43,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:54:43,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:54:43,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (1/1) ... [2024-11-06 18:54:43,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:54:43,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:54:43,222 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 18:54:43,228 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 18:54:43,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:54:43,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:54:43,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:54:43,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:54:43,317 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:54:43,318 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:54:44,261 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-06 18:54:44,261 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:54:44,277 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:54:44,280 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:54:44,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:44 BoogieIcfgContainer [2024-11-06 18:54:44,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:54:44,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:54:44,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:54:44,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:54:44,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:54:42" (1/3) ... [2024-11-06 18:54:44,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d058a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:54:44, skipping insertion in model container [2024-11-06 18:54:44,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:43" (2/3) ... [2024-11-06 18:54:44,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d058a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:54:44, skipping insertion in model container [2024-11-06 18:54:44,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:44" (3/3) ... [2024-11-06 18:54:44,291 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label04.c [2024-11-06 18:54:44,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:54:44,302 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:54:44,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:54:44,371 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;@21645e56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:54:44,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:54:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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 18:54:44,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-06 18:54:44,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:44,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:44,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:44,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:44,395 INFO L85 PathProgramCache]: Analyzing trace with hash 585738029, now seen corresponding path program 1 times [2024-11-06 18:54:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:44,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433709717] [2024-11-06 18:54:44,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:44,976 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 18:54:44,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433709717] [2024-11-06 18:54:44,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433709717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:44,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:44,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:54:44,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743546947] [2024-11-06 18:54:44,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:44,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:44,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:45,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:45,009 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 18:54:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:45,785 INFO L93 Difference]: Finished difference Result 600 states and 1037 transitions. [2024-11-06 18:54:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:45,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 106 [2024-11-06 18:54:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:45,798 INFO L225 Difference]: With dead ends: 600 [2024-11-06 18:54:45,800 INFO L226 Difference]: Without dead ends: 309 [2024-11-06 18:54:45,806 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 18:54:45,809 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 60 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:45,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 18:54:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-06 18:54:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-06 18:54:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 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 18:54:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2024-11-06 18:54:45,844 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 106 [2024-11-06 18:54:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:45,845 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2024-11-06 18:54:45,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 18:54:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2024-11-06 18:54:45,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 18:54:45,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:45,849 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 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 18:54:45,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:54:45,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:45,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:45,850 INFO L85 PathProgramCache]: Analyzing trace with hash 318496888, now seen corresponding path program 1 times [2024-11-06 18:54:45,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:45,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418510470] [2024-11-06 18:54:45,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:46,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:46,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418510470] [2024-11-06 18:54:46,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418510470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:46,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:46,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:46,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151929353] [2024-11-06 18:54:46,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:46,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:46,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:46,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:46,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:46,094 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 18:54:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:46,568 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2024-11-06 18:54:46,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 111 [2024-11-06 18:54:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:46,572 INFO L225 Difference]: With dead ends: 758 [2024-11-06 18:54:46,572 INFO L226 Difference]: Without dead ends: 453 [2024-11-06 18:54:46,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:54:46,574 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 58 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:46,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 248 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:54:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-06 18:54:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2024-11-06 18:54:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 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 18:54:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions. [2024-11-06 18:54:46,606 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 111 [2024-11-06 18:54:46,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:46,610 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 578 transitions. [2024-11-06 18:54:46,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 18:54:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2024-11-06 18:54:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-06 18:54:46,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:46,613 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:46,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:54:46,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:46,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:46,615 INFO L85 PathProgramCache]: Analyzing trace with hash 924088573, now seen corresponding path program 1 times [2024-11-06 18:54:46,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:46,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483588444] [2024-11-06 18:54:46,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:46,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:46,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:46,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483588444] [2024-11-06 18:54:46,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483588444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:46,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:46,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:54:46,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453799249] [2024-11-06 18:54:46,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:46,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:46,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:46,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:46,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:46,740 INFO L87 Difference]: Start difference. First operand 453 states and 578 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 18:54:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:47,174 INFO L93 Difference]: Finished difference Result 1325 states and 1691 transitions. [2024-11-06 18:54:47,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:47,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2024-11-06 18:54:47,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:47,181 INFO L225 Difference]: With dead ends: 1325 [2024-11-06 18:54:47,182 INFO L226 Difference]: Without dead ends: 874 [2024-11-06 18:54:47,182 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 18:54:47,183 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 185 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:47,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:54:47,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-06 18:54:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-06 18:54:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.2302405498281788) internal successors, (1074), 873 states have internal predecessors, (1074), 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 18:54:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1074 transitions. [2024-11-06 18:54:47,217 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1074 transitions. Word has length 123 [2024-11-06 18:54:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:47,217 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1074 transitions. [2024-11-06 18:54:47,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 18:54:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1074 transitions. [2024-11-06 18:54:47,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-06 18:54:47,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:47,223 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:47,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:54:47,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:47,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:47,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1386859920, now seen corresponding path program 1 times [2024-11-06 18:54:47,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:47,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980334660] [2024-11-06 18:54:47,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:47,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:47,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:47,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980334660] [2024-11-06 18:54:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980334660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:47,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:47,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:47,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797660653] [2024-11-06 18:54:47,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:47,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:47,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:47,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:47,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:47,396 INFO L87 Difference]: Start difference. First operand 874 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 18:54:47,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:47,830 INFO L93 Difference]: Finished difference Result 2594 states and 3192 transitions. [2024-11-06 18:54:47,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:47,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 136 [2024-11-06 18:54:47,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:47,837 INFO L225 Difference]: With dead ends: 2594 [2024-11-06 18:54:47,837 INFO L226 Difference]: Without dead ends: 1722 [2024-11-06 18:54:47,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:54:47,839 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 57 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:47,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 290 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:54:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2024-11-06 18:54:47,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1716. [2024-11-06 18:54:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1715 states have (on average 1.1900874635568512) internal successors, (2041), 1715 states have internal predecessors, (2041), 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 18:54:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2041 transitions. [2024-11-06 18:54:47,872 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2041 transitions. Word has length 136 [2024-11-06 18:54:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:47,873 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2041 transitions. [2024-11-06 18:54:47,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 18:54:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2041 transitions. [2024-11-06 18:54:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-06 18:54:47,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:47,877 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:47,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:54:47,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:47,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1212192576, now seen corresponding path program 1 times [2024-11-06 18:54:47,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:47,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261522546] [2024-11-06 18:54:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:47,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:54:48,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:48,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261522546] [2024-11-06 18:54:48,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261522546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:48,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:48,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:48,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57557668] [2024-11-06 18:54:48,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:48,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:48,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:48,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:48,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:48,020 INFO L87 Difference]: Start difference. First operand 1716 states and 2041 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 18:54:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:48,459 INFO L93 Difference]: Finished difference Result 3852 states and 4554 transitions. [2024-11-06 18:54:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:48,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 152 [2024-11-06 18:54:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:48,466 INFO L225 Difference]: With dead ends: 3852 [2024-11-06 18:54:48,467 INFO L226 Difference]: Without dead ends: 1856 [2024-11-06 18:54:48,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:54:48,469 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 158 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:48,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 66 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:54:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2024-11-06 18:54:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1854. [2024-11-06 18:54:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.119805720453319) internal successors, (2075), 1853 states have internal predecessors, (2075), 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 18:54:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2075 transitions. [2024-11-06 18:54:48,503 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2075 transitions. Word has length 152 [2024-11-06 18:54:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:48,503 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2075 transitions. [2024-11-06 18:54:48,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 18:54:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2075 transitions. [2024-11-06 18:54:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-06 18:54:48,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:48,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:48,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:54:48,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:48,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash -145608568, now seen corresponding path program 1 times [2024-11-06 18:54:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:48,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22141554] [2024-11-06 18:54:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:48,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:48,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:48,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22141554] [2024-11-06 18:54:48,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22141554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:48,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:48,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449013517] [2024-11-06 18:54:48,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:48,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:48,636 INFO L87 Difference]: Start difference. First operand 1854 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 18:54:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:49,064 INFO L93 Difference]: Finished difference Result 4404 states and 4920 transitions. [2024-11-06 18:54:49,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:49,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 153 [2024-11-06 18:54:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:49,073 INFO L225 Difference]: With dead ends: 4404 [2024-11-06 18:54:49,073 INFO L226 Difference]: Without dead ends: 2412 [2024-11-06 18:54:49,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:54:49,078 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:49,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 70 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:54:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2024-11-06 18:54:49,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2272. [2024-11-06 18:54:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.095112285336856) internal successors, (2487), 2271 states have internal predecessors, (2487), 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 18:54:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2487 transitions. [2024-11-06 18:54:49,124 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2487 transitions. Word has length 153 [2024-11-06 18:54:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:49,127 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 2487 transitions. [2024-11-06 18:54:49,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 18:54:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2487 transitions. [2024-11-06 18:54:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-06 18:54:49,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:49,131 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:49,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:54:49,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:49,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1045227919, now seen corresponding path program 1 times [2024-11-06 18:54:49,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:49,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382006828] [2024-11-06 18:54:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:49,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-06 18:54:49,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:49,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382006828] [2024-11-06 18:54:49,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382006828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:49,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:49,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:54:49,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696965195] [2024-11-06 18:54:49,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:49,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:49,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:49,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:49,271 INFO L87 Difference]: Start difference. First operand 2272 states and 2487 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 18:54:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:49,485 INFO L93 Difference]: Finished difference Result 4248 states and 4654 transitions. [2024-11-06 18:54:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 165 [2024-11-06 18:54:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:49,492 INFO L225 Difference]: With dead ends: 4248 [2024-11-06 18:54:49,492 INFO L226 Difference]: Without dead ends: 1836 [2024-11-06 18:54:49,494 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 18:54:49,495 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 154 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:49,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 18 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:54:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-06 18:54:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1556. [2024-11-06 18:54:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1555 states have (on average 1.0771704180064308) internal successors, (1675), 1555 states have internal predecessors, (1675), 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 18:54:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1675 transitions. [2024-11-06 18:54:49,529 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1675 transitions. Word has length 165 [2024-11-06 18:54:49,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:49,529 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1675 transitions. [2024-11-06 18:54:49,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 18:54:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1675 transitions. [2024-11-06 18:54:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-06 18:54:49,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:49,533 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-06 18:54:49,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 18:54:49,533 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:49,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:49,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1306375099, now seen corresponding path program 1 times [2024-11-06 18:54:49,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:49,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420918696] [2024-11-06 18:54:49,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:49,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 18:54:49,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:49,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420918696] [2024-11-06 18:54:49,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420918696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:49,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:49,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:54:49,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743968735] [2024-11-06 18:54:49,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:49,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:54:49,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:49,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:54:49,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:54:49,882 INFO L87 Difference]: Start difference. First operand 1556 states and 1675 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 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 18:54:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:50,543 INFO L93 Difference]: Finished difference Result 3140 states and 3388 transitions. [2024-11-06 18:54:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:54:50,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 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 180 [2024-11-06 18:54:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:50,544 INFO L225 Difference]: With dead ends: 3140 [2024-11-06 18:54:50,544 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:54:50,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:54:50,547 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 172 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:50,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 62 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:54:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:54:50,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:54:50,548 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 18:54:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:54:50,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2024-11-06 18:54:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:50,550 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:54:50,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 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 18:54:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:54:50,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:54:50,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:54:50,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 18:54:50,556 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:50,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:54:50,738 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:54:50,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:54:50 BoogieIcfgContainer [2024-11-06 18:54:50,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:54:50,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:54:50,759 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:54:50,760 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:54:50,760 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:44" (3/4) ... [2024-11-06 18:54:50,762 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:54:50,779 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 18:54:50,784 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:54:50,784 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:54:50,785 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:54:50,910 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:54:50,911 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:54:50,911 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:54:50,912 INFO L158 Benchmark]: Toolchain (without parser) took 8280.43ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 90.4MB in the beginning and 91.7MB in the end (delta: -1.3MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2024-11-06 18:54:50,912 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:54:50,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.85ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 64.4MB in the end (delta: 25.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:54:50,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.42ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 59.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:54:50,913 INFO L158 Benchmark]: Boogie Preprocessor took 95.64ms. Allocated memory is still 117.4MB. Free memory was 59.2MB in the beginning and 54.6MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:54:50,914 INFO L158 Benchmark]: RCFGBuilder took 1094.49ms. Allocated memory is still 117.4MB. Free memory was 54.4MB in the beginning and 67.2MB in the end (delta: -12.8MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2024-11-06 18:54:50,917 INFO L158 Benchmark]: TraceAbstraction took 6475.40ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 66.5MB in the beginning and 102.0MB in the end (delta: -35.4MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2024-11-06 18:54:50,917 INFO L158 Benchmark]: Witness Printer took 151.70ms. Allocated memory is still 192.9MB. Free memory was 102.0MB in the beginning and 91.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:54:50,919 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.73ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.85ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 64.4MB in the end (delta: 25.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.42ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 59.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.64ms. Allocated memory is still 117.4MB. Free memory was 59.2MB in the beginning and 54.6MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1094.49ms. Allocated memory is still 117.4MB. Free memory was 54.4MB in the beginning and 67.2MB in the end (delta: -12.8MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6475.40ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 66.5MB in the beginning and 102.0MB in the end (delta: -35.4MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * Witness Printer took 151.70ms. Allocated memory is still 192.9MB. Free memory was 102.0MB in the beginning and 91.7MB in the end (delta: 10.3MB). 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: 500]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 918 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 918 mSDsluCounter, 1004 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 576 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3079 IncrementalHoareTripleChecker+Invalid, 3655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 576 mSolverCounterUnsat, 883 mSDtfsCounter, 3079 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2272occurred in iteration=6, InterpolantAutomatonStates: 26, 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, 430 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1126 NumberOfCodeBlocks, 1126 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1118 ConstructedInterpolants, 0 QuantifiedInterpolants, 4218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 329/329 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: 616]: Loop Invariant Derived loop invariant: (((((((((a28 == 10) && (a17 <= 8)) || (((a17 <= 8) && (a28 <= 10)) && (a11 != 1))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || ((a28 == 10) && (a19 == 1))) || ((a17 <= 8) && (a28 <= 7))) || (((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (((a25 == 1) && (a17 <= 8)) && (a28 <= 10))) || ((((a25 == 1) && (a19 == 1)) && (a11 != 1)) && (a28 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-11-06 18:54:50,949 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