./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_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/Problem10_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', 'b7b6f186ede66b25b51c633a55bb25e291eb69596590009e014f685be0bc2be5'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_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 b7b6f186ede66b25b51c633a55bb25e291eb69596590009e014f685be0bc2be5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:35:42,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:35:42,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:35:42,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:35:42,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:35:42,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:35:42,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:35:42,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:35:42,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:35:42,440 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:35:42,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:35:42,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:35:42,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:35:42,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:35:42,441 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:35:42,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:35:42,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:35:42,441 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:35:42,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:35:42,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:35:42,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:35:42,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:35:42,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:35:42,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:35:42,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:35:42,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:35:42,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:35:42,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:35:42,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:35:42,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:35:42,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:35:42,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:35:42,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:35:42,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:35:42,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:35:42,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:35:42,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:35:42,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:35:42,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:35:42,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:35:42,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:35:42,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:35:42,444 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 -> b7b6f186ede66b25b51c633a55bb25e291eb69596590009e014f685be0bc2be5 [2024-11-06 19:35:42,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:35:42,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:35:42,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:35:42,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:35:42,766 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:35:42,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label04.c [2024-11-06 19:35:44,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:35:44,390 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:35:44,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label04.c [2024-11-06 19:35:44,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7577d2ccf/0a0c26cc8a8f47d584cdfe83880ee465/FLAG8d49c3979 [2024-11-06 19:35:44,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7577d2ccf/0a0c26cc8a8f47d584cdfe83880ee465 [2024-11-06 19:35:44,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:35:44,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:35:44,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:35:44,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:35:44,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:35:44,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:44,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9bd8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44, skipping insertion in model container [2024-11-06 19:35:44,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:44,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:35:44,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label04.c[7502,7515] [2024-11-06 19:35:44,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:35:44,836 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:35:44,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label04.c[7502,7515] [2024-11-06 19:35:44,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:35:44,970 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:35:44,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44 WrapperNode [2024-11-06 19:35:44,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:35:44,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:35:44,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:35:44,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:35:44,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:44,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:45,078 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-06 19:35:45,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:35:45,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:35:45,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:35:45,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:35:45,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:45,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:45,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:45,140 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 19:35:45,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:45,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:45,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:45,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:45,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:45,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:45,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:35:45,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:35:45,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:35:45,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:35:45,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (1/1) ... [2024-11-06 19:35:45,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:35:45,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:35:45,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 19:35:45,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 19:35:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:35:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:35:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:35:45,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:35:45,380 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:35:45,382 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:35:46,626 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-06 19:35:46,627 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:35:46,645 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:35:46,646 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:35:46,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:35:46 BoogieIcfgContainer [2024-11-06 19:35:46,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:35:46,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:35:46,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:35:46,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:35:46,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:35:44" (1/3) ... [2024-11-06 19:35:46,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fae52c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:35:46, skipping insertion in model container [2024-11-06 19:35:46,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:44" (2/3) ... [2024-11-06 19:35:46,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fae52c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:35:46, skipping insertion in model container [2024-11-06 19:35:46,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:35:46" (3/3) ... [2024-11-06 19:35:46,656 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label04.c [2024-11-06 19:35:46,671 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:35:46,671 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:35:46,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:35:46,748 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;@cc3a7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:35:46,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:35:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-06 19:35:46,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:46,768 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] [2024-11-06 19:35:46,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:46,773 INFO L85 PathProgramCache]: Analyzing trace with hash -215114758, now seen corresponding path program 1 times [2024-11-06 19:35:46,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:46,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580329009] [2024-11-06 19:35:46,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:35:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580329009] [2024-11-06 19:35:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580329009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:47,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:35:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713950787] [2024-11-06 19:35:47,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:47,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:35:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:47,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:35:47,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:35:47,480 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:48,759 INFO L93 Difference]: Finished difference Result 696 states and 1248 transitions. [2024-11-06 19:35:48,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:35:48,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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 66 [2024-11-06 19:35:48,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:48,774 INFO L225 Difference]: With dead ends: 696 [2024-11-06 19:35:48,776 INFO L226 Difference]: Without dead ends: 421 [2024-11-06 19:35:48,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:35:48,784 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 439 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:48,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 44 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:35:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-06 19:35:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-06 19:35:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3833333333333333) internal successors, (581), 420 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 581 transitions. [2024-11-06 19:35:48,855 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 581 transitions. Word has length 66 [2024-11-06 19:35:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:48,856 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 581 transitions. [2024-11-06 19:35:48,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 581 transitions. [2024-11-06 19:35:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-06 19:35:48,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:48,875 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:35:48,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:35:48,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:48,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2134418076, now seen corresponding path program 1 times [2024-11-06 19:35:48,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:48,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575947430] [2024-11-06 19:35:48,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:48,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-06 19:35:49,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:49,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575947430] [2024-11-06 19:35:49,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575947430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:49,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:49,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:35:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615054023] [2024-11-06 19:35:49,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:49,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:35:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:49,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:35:49,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:35:49,354 INFO L87 Difference]: Start difference. First operand 421 states and 581 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:49,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:49,884 INFO L93 Difference]: Finished difference Result 979 states and 1440 transitions. [2024-11-06 19:35:49,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:35:49,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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 247 [2024-11-06 19:35:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:49,891 INFO L225 Difference]: With dead ends: 979 [2024-11-06 19:35:49,891 INFO L226 Difference]: Without dead ends: 699 [2024-11-06 19:35:49,894 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 19:35:49,895 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 76 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:49,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 226 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:35:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-06 19:35:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 560. [2024-11-06 19:35:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3148479427549196) internal successors, (735), 559 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 735 transitions. [2024-11-06 19:35:49,919 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 735 transitions. Word has length 247 [2024-11-06 19:35:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:49,920 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 735 transitions. [2024-11-06 19:35:49,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 735 transitions. [2024-11-06 19:35:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-06 19:35:49,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:49,925 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:35:49,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:35:49,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:49,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1074368107, now seen corresponding path program 1 times [2024-11-06 19:35:49,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:49,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311228090] [2024-11-06 19:35:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-06 19:35:50,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311228090] [2024-11-06 19:35:50,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311228090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:50,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:50,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:35:50,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943527370] [2024-11-06 19:35:50,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:50,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:35:50,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:50,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:35:50,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:35:50,246 INFO L87 Difference]: Start difference. First operand 560 states and 735 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:50,724 INFO L93 Difference]: Finished difference Result 1118 states and 1533 transitions. [2024-11-06 19:35:50,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:35:50,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 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 253 [2024-11-06 19:35:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:50,728 INFO L225 Difference]: With dead ends: 1118 [2024-11-06 19:35:50,729 INFO L226 Difference]: Without dead ends: 699 [2024-11-06 19:35:50,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:35:50,734 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:50,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 34 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:35:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-06 19:35:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-06 19:35:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2808022922636104) internal successors, (894), 698 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 894 transitions. [2024-11-06 19:35:50,760 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 894 transitions. Word has length 253 [2024-11-06 19:35:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:50,760 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 894 transitions. [2024-11-06 19:35:50,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:50,761 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 894 transitions. [2024-11-06 19:35:50,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-06 19:35:50,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:50,767 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:35:50,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:35:50,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:50,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:50,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1070818898, now seen corresponding path program 1 times [2024-11-06 19:35:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:50,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896376621] [2024-11-06 19:35:50,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:50,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 19:35:51,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:51,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896376621] [2024-11-06 19:35:51,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896376621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:51,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:51,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:35:51,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763091950] [2024-11-06 19:35:51,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:51,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:35:51,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:51,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:35:51,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:35:51,115 INFO L87 Difference]: Start difference. First operand 699 states and 894 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:51,592 INFO L93 Difference]: Finished difference Result 1396 states and 1831 transitions. [2024-11-06 19:35:51,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:35:51,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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 321 [2024-11-06 19:35:51,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:51,596 INFO L225 Difference]: With dead ends: 1396 [2024-11-06 19:35:51,597 INFO L226 Difference]: Without dead ends: 838 [2024-11-06 19:35:51,598 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 19:35:51,598 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 76 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:51,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 215 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:35:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-06 19:35:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-06 19:35:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2461170848267622) internal successors, (1043), 837 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1043 transitions. [2024-11-06 19:35:51,619 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1043 transitions. Word has length 321 [2024-11-06 19:35:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:51,620 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1043 transitions. [2024-11-06 19:35:51,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1043 transitions. [2024-11-06 19:35:51,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-06 19:35:51,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:51,626 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-06 19:35:51,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:35:51,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:51,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:51,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1080639968, now seen corresponding path program 1 times [2024-11-06 19:35:51,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:51,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634220704] [2024-11-06 19:35:51,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-06 19:35:52,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:52,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634220704] [2024-11-06 19:35:52,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634220704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:52,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:52,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 19:35:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425930024] [2024-11-06 19:35:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:52,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 19:35:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:52,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 19:35:52,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:35:52,260 INFO L87 Difference]: Start difference. First operand 838 states and 1043 transitions. Second operand has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:52,710 INFO L93 Difference]: Finished difference Result 1590 states and 1995 transitions. [2024-11-06 19:35:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 19:35:52,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 6 states have internal predecessors, (255), 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 330 [2024-11-06 19:35:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:52,714 INFO L225 Difference]: With dead ends: 1590 [2024-11-06 19:35:52,714 INFO L226 Difference]: Without dead ends: 838 [2024-11-06 19:35:52,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:35:52,716 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:52,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 20 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:35:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-06 19:35:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-06 19:35:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2413381123058542) internal successors, (1039), 837 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1039 transitions. [2024-11-06 19:35:52,736 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1039 transitions. Word has length 330 [2024-11-06 19:35:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:52,736 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1039 transitions. [2024-11-06 19:35:52,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1039 transitions. [2024-11-06 19:35:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-11-06 19:35:52,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:52,742 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:35:52,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:35:52,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:52,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash -398245702, now seen corresponding path program 1 times [2024-11-06 19:35:52,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:52,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978728783] [2024-11-06 19:35:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 391 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:35:53,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:53,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978728783] [2024-11-06 19:35:53,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978728783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:35:53,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629578851] [2024-11-06 19:35:53,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:53,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:35:53,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:35:53,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:35:53,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 19:35:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:53,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:35:53,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:35:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-06 19:35:53,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:35:53,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629578851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:53,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:35:53,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-06 19:35:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434743880] [2024-11-06 19:35:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:53,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:35:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:53,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:35:53,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:35:53,751 INFO L87 Difference]: Start difference. First operand 838 states and 1039 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:54,264 INFO L93 Difference]: Finished difference Result 2091 states and 2637 transitions. [2024-11-06 19:35:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:35:54,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 366 [2024-11-06 19:35:54,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:54,275 INFO L225 Difference]: With dead ends: 2091 [2024-11-06 19:35:54,275 INFO L226 Difference]: Without dead ends: 1394 [2024-11-06 19:35:54,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:35:54,278 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:54,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 195 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:35:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-06 19:35:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2024-11-06 19:35:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.198851399856425) internal successors, (1670), 1393 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1670 transitions. [2024-11-06 19:35:54,312 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1670 transitions. Word has length 366 [2024-11-06 19:35:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:54,313 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1670 transitions. [2024-11-06 19:35:54,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1670 transitions. [2024-11-06 19:35:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-11-06 19:35:54,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:54,320 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:35:54,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:35:54,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:35:54,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:54,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash 627376470, now seen corresponding path program 1 times [2024-11-06 19:35:54,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:54,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173043098] [2024-11-06 19:35:54,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-06 19:35:54,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:54,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173043098] [2024-11-06 19:35:54,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173043098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:54,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:54,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:35:54,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321082679] [2024-11-06 19:35:54,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:54,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:35:54,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:54,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:35:54,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:35:54,843 INFO L87 Difference]: Start difference. First operand 1394 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:55,396 INFO L93 Difference]: Finished difference Result 3064 states and 3736 transitions. [2024-11-06 19:35:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:35:55,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 379 [2024-11-06 19:35:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:55,406 INFO L225 Difference]: With dead ends: 3064 [2024-11-06 19:35:55,406 INFO L226 Difference]: Without dead ends: 1811 [2024-11-06 19:35:55,409 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 19:35:55,410 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 76 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:55,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 225 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:35:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-06 19:35:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1672. [2024-11-06 19:35:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.1807301017354876) internal successors, (1973), 1671 states have internal predecessors, (1973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1973 transitions. [2024-11-06 19:35:55,449 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1973 transitions. Word has length 379 [2024-11-06 19:35:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:55,450 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 1973 transitions. [2024-11-06 19:35:55,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1973 transitions. [2024-11-06 19:35:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-11-06 19:35:55,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:35:55,457 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:35:55,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:35:55,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:35:55,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:35:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1407739099, now seen corresponding path program 1 times [2024-11-06 19:35:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:35:55,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917523254] [2024-11-06 19:35:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:35:55,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:35:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:35:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-06 19:35:56,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:35:56,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917523254] [2024-11-06 19:35:56,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917523254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:35:56,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:35:56,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 19:35:56,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185502481] [2024-11-06 19:35:56,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:35:56,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 19:35:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:35:56,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 19:35:56,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:35:56,079 INFO L87 Difference]: Start difference. First operand 1672 states and 1973 transitions. Second operand has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 6 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:35:56,649 INFO L93 Difference]: Finished difference Result 3119 states and 3668 transitions. [2024-11-06 19:35:56,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 19:35:56,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 6 states have internal predecessors, (191), 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 380 [2024-11-06 19:35:56,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:35:56,650 INFO L225 Difference]: With dead ends: 3119 [2024-11-06 19:35:56,650 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:35:56,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:35:56,654 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:35:56,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 19 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:35:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:35:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:35:56,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:35:56,655 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 380 [2024-11-06 19:35:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:35:56,655 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:35:56,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 6 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:35:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:35:56,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:35:56,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:35:56,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:35:56,662 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:35:56,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:35:56,775 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:35:56,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:35:56 BoogieIcfgContainer [2024-11-06 19:35:56,793 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:35:56,794 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:35:56,794 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:35:56,794 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:35:56,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:35:46" (3/4) ... [2024-11-06 19:35:56,797 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:35:56,818 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 19:35:56,818 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:35:56,822 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:35:56,823 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:35:56,938 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:35:56,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:35:56,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:35:56,940 INFO L158 Benchmark]: Toolchain (without parser) took 12493.91ms. Allocated memory was 117.4MB in the beginning and 293.6MB in the end (delta: 176.2MB). Free memory was 89.7MB in the beginning and 238.1MB in the end (delta: -148.3MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-11-06 19:35:56,941 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:35:56,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.16ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 62.4MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 19:35:56,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.76ms. Allocated memory is still 117.4MB. Free memory was 62.4MB in the beginning and 54.8MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 19:35:56,941 INFO L158 Benchmark]: Boogie Preprocessor took 138.48ms. Allocated memory is still 117.4MB. Free memory was 54.8MB in the beginning and 45.3MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 19:35:56,941 INFO L158 Benchmark]: RCFGBuilder took 1425.09ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 45.3MB in the beginning and 98.0MB in the end (delta: -52.7MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2024-11-06 19:35:56,942 INFO L158 Benchmark]: TraceAbstraction took 10143.91ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 97.3MB in the beginning and 249.8MB in the end (delta: -152.5MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. [2024-11-06 19:35:56,942 INFO L158 Benchmark]: Witness Printer took 145.57ms. Allocated memory is still 293.6MB. Free memory was 249.8MB in the beginning and 238.1MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 19:35:56,944 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.35ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.16ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 62.4MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.76ms. Allocated memory is still 117.4MB. Free memory was 62.4MB in the beginning and 54.8MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.48ms. Allocated memory is still 117.4MB. Free memory was 54.8MB in the beginning and 45.3MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1425.09ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 45.3MB in the beginning and 98.0MB in the end (delta: -52.7MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10143.91ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 97.3MB in the beginning and 249.8MB in the end (delta: -152.5MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. * Witness Printer took 145.57ms. Allocated memory is still 293.6MB. Free memory was 249.8MB in the beginning and 238.1MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. 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: 212]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 979 mSDsluCounter, 978 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 626 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3749 IncrementalHoareTripleChecker+Invalid, 4375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 626 mSolverCounterUnsat, 919 mSDtfsCounter, 3749 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1672occurred in iteration=7, InterpolantAutomatonStates: 33, 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, 278 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2708 NumberOfCodeBlocks, 2708 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2699 ConstructedInterpolants, 0 QuantifiedInterpolants, 10876 SizeOfPredicates, 0 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 2924/2969 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: ((((((a19 != 6) && (14 == a4)) && (a12 == 0)) || (((a10 == 0) && (14 == a4)) && (a12 == 0))) || (((a10 == 3) && (14 == a4)) && (a12 == 0))) || (((a10 == 4) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:35:56,974 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