./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label30.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/Problem03_label30.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', 'a272bf0f73a58d72dfba23a9c902bbeb665b6b76cc21acf92951a09cb8e04c47'] 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/Problem03_label30.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 a272bf0f73a58d72dfba23a9c902bbeb665b6b76cc21acf92951a09cb8e04c47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:57:22,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:57:22,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:57:22,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:57:22,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:57:22,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:57:22,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:57:22,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:57:22,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:57:22,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:57:22,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:57:22,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:57:22,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:57:22,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:57:22,668 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:57:22,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:57:22,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:57:22,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:57:22,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:57:22,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:57:22,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:57:22,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:57:22,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:57:22,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:57:22,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:57:22,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:57:22,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:57:22,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:57:22,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:57:22,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:57:22,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:57:22,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:57:22,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:57:22,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:57:22,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:57:22,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:57:22,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:57:22,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:57:22,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:57:22,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:57:22,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:57:22,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:57:22,671 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 -> a272bf0f73a58d72dfba23a9c902bbeb665b6b76cc21acf92951a09cb8e04c47 [2024-11-06 18:57:22,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:57:22,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:57:22,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:57:22,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:57:22,899 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:57:22,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label30.c [2024-11-06 18:57:23,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:57:24,257 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:57:24,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label30.c [2024-11-06 18:57:24,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3f8d1c0e/c08b94cd06444c82b146e9c883364bac/FLAGe0ea170b6 [2024-11-06 18:57:24,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3f8d1c0e/c08b94cd06444c82b146e9c883364bac [2024-11-06 18:57:24,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:57:24,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:57:24,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:57:24,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:57:24,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:57:24,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:57:24" (1/1) ... [2024-11-06 18:57:24,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5607410c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:24, skipping insertion in model container [2024-11-06 18:57:24,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:57:24" (1/1) ... [2024-11-06 18:57:24,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:57:24,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/Problem03_label30.c[57849,57862] [2024-11-06 18:57:24,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:57:24,923 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:57:25,035 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/Problem03_label30.c[57849,57862] [2024-11-06 18:57:25,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:57:25,058 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:57:25,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25 WrapperNode [2024-11-06 18:57:25,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:57:25,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:57:25,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:57:25,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:57:25,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (1/1) ... [2024-11-06 18:57:25,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (1/1) ... [2024-11-06 18:57:25,148 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-06 18:57:25,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:57:25,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:57:25,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:57:25,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:57:25,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (1/1) ... [2024-11-06 18:57:25,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (1/1) ... [2024-11-06 18:57:25,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (1/1) ... [2024-11-06 18:57:25,228 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 18:57:25,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (1/1) ... [2024-11-06 18:57:25,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (1/1) ... [2024-11-06 18:57:25,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (1/1) ... [2024-11-06 18:57:25,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (1/1) ... [2024-11-06 18:57:25,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (1/1) ... [2024-11-06 18:57:25,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (1/1) ... [2024-11-06 18:57:25,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:57:25,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:57:25,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:57:25,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:57:25,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (1/1) ... [2024-11-06 18:57:25,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:57:25,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:57:25,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 18:57:25,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 18:57:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:57:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:57:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:57:25,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:57:25,426 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:57:25,427 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:57:26,747 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-06 18:57:26,748 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:57:26,762 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:57:26,763 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:57:26,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:57:26 BoogieIcfgContainer [2024-11-06 18:57:26,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:57:26,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:57:26,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:57:26,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:57:26,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:57:24" (1/3) ... [2024-11-06 18:57:26,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee7d084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:57:26, skipping insertion in model container [2024-11-06 18:57:26,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:25" (2/3) ... [2024-11-06 18:57:26,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee7d084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:57:26, skipping insertion in model container [2024-11-06 18:57:26,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:57:26" (3/3) ... [2024-11-06 18:57:26,770 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label30.c [2024-11-06 18:57:26,780 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:57:26,780 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:57:26,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:57:26,835 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;@237d6950, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:57:26,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:57:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-06 18:57:26,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:26,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:26,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:26,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:26,859 INFO L85 PathProgramCache]: Analyzing trace with hash 174616531, now seen corresponding path program 1 times [2024-11-06 18:57:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:26,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413654243] [2024-11-06 18:57:26,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:26,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:57:27,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:27,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413654243] [2024-11-06 18:57:27,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413654243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:27,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:27,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:57:27,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403190376] [2024-11-06 18:57:27,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:27,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:27,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:27,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:27,650 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:28,462 INFO L93 Difference]: Finished difference Result 810 states and 1445 transitions. [2024-11-06 18:57:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:28,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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 175 [2024-11-06 18:57:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:28,475 INFO L225 Difference]: With dead ends: 810 [2024-11-06 18:57:28,476 INFO L226 Difference]: Without dead ends: 444 [2024-11-06 18:57:28,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:28,480 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 79 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:28,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 231 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 18:57:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-06 18:57:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2024-11-06 18:57:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.4288939051918736) internal successors, (633), 443 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 633 transitions. [2024-11-06 18:57:28,515 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 633 transitions. Word has length 175 [2024-11-06 18:57:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:28,516 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 633 transitions. [2024-11-06 18:57:28,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 633 transitions. [2024-11-06 18:57:28,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-06 18:57:28,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:28,519 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:28,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:57:28,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:28,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:28,520 INFO L85 PathProgramCache]: Analyzing trace with hash -93879212, now seen corresponding path program 1 times [2024-11-06 18:57:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:28,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522579746] [2024-11-06 18:57:28,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:28,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:57:28,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:28,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522579746] [2024-11-06 18:57:28,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522579746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:28,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:28,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:57:28,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230769949] [2024-11-06 18:57:28,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:28,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:28,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:28,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:28,690 INFO L87 Difference]: Start difference. First operand 444 states and 633 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 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 18:57:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:29,307 INFO L93 Difference]: Finished difference Result 1312 states and 1878 transitions. [2024-11-06 18:57:29,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:29,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 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 183 [2024-11-06 18:57:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:29,312 INFO L225 Difference]: With dead ends: 1312 [2024-11-06 18:57:29,312 INFO L226 Difference]: Without dead ends: 870 [2024-11-06 18:57:29,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:29,315 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:29,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 92 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:57:29,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-06 18:57:29,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 856. [2024-11-06 18:57:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.3941520467836257) internal successors, (1192), 855 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1192 transitions. [2024-11-06 18:57:29,356 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1192 transitions. Word has length 183 [2024-11-06 18:57:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:29,356 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1192 transitions. [2024-11-06 18:57:29,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 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 18:57:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1192 transitions. [2024-11-06 18:57:29,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-06 18:57:29,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:29,359 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:29,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:57:29,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:29,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:29,360 INFO L85 PathProgramCache]: Analyzing trace with hash 800099661, now seen corresponding path program 1 times [2024-11-06 18:57:29,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:29,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555546755] [2024-11-06 18:57:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:29,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:57:29,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:29,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555546755] [2024-11-06 18:57:29,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555546755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:29,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:29,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:57:29,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640494465] [2024-11-06 18:57:29,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:29,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:29,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:29,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:29,589 INFO L87 Difference]: Start difference. First operand 856 states and 1192 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 18:57:30,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:30,185 INFO L93 Difference]: Finished difference Result 2121 states and 3056 transitions. [2024-11-06 18:57:30,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:30,186 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 195 [2024-11-06 18:57:30,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:30,189 INFO L225 Difference]: With dead ends: 2121 [2024-11-06 18:57:30,190 INFO L226 Difference]: Without dead ends: 1267 [2024-11-06 18:57:30,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:30,191 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 236 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:30,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 407 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:57:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2024-11-06 18:57:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1265. [2024-11-06 18:57:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3291139240506329) internal successors, (1680), 1264 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1680 transitions. [2024-11-06 18:57:30,221 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1680 transitions. Word has length 195 [2024-11-06 18:57:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:30,222 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1680 transitions. [2024-11-06 18:57:30,222 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 18:57:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1680 transitions. [2024-11-06 18:57:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-06 18:57:30,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:30,226 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:30,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:57:30,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:30,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1457983073, now seen corresponding path program 1 times [2024-11-06 18:57:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:30,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136908789] [2024-11-06 18:57:30,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:30,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:57:30,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:30,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136908789] [2024-11-06 18:57:30,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136908789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:30,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:30,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:57:30,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065742915] [2024-11-06 18:57:30,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:30,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:30,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:30,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:30,488 INFO L87 Difference]: Start difference. First operand 1265 states and 1680 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:31,083 INFO L93 Difference]: Finished difference Result 3147 states and 4169 transitions. [2024-11-06 18:57:31,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:31,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 203 [2024-11-06 18:57:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:31,090 INFO L225 Difference]: With dead ends: 3147 [2024-11-06 18:57:31,090 INFO L226 Difference]: Without dead ends: 1884 [2024-11-06 18:57:31,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:31,094 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 214 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:31,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 366 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:57:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2024-11-06 18:57:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1877. [2024-11-06 18:57:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1876 states have (on average 1.273454157782516) internal successors, (2389), 1876 states have internal predecessors, (2389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2389 transitions. [2024-11-06 18:57:31,121 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2389 transitions. Word has length 203 [2024-11-06 18:57:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:31,121 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2389 transitions. [2024-11-06 18:57:31,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2389 transitions. [2024-11-06 18:57:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-06 18:57:31,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:31,125 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:31,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:57:31,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:31,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:31,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1450768731, now seen corresponding path program 1 times [2024-11-06 18:57:31,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:31,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187915221] [2024-11-06 18:57:31,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:31,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:57:31,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:31,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187915221] [2024-11-06 18:57:31,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187915221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:31,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:31,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:57:31,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56773871] [2024-11-06 18:57:31,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:31,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:31,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:31,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:31,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:31,369 INFO L87 Difference]: Start difference. First operand 1877 states and 2389 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:32,034 INFO L93 Difference]: Finished difference Result 5386 states and 6889 transitions. [2024-11-06 18:57:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:32,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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 210 [2024-11-06 18:57:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:32,044 INFO L225 Difference]: With dead ends: 5386 [2024-11-06 18:57:32,044 INFO L226 Difference]: Without dead ends: 3511 [2024-11-06 18:57:32,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:32,047 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 202 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:32,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 388 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:57:32,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2024-11-06 18:57:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3507. [2024-11-06 18:57:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3507 states, 3506 states have (on average 1.2187678265830006) internal successors, (4273), 3506 states have internal predecessors, (4273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 3507 states and 4273 transitions. [2024-11-06 18:57:32,095 INFO L78 Accepts]: Start accepts. Automaton has 3507 states and 4273 transitions. Word has length 210 [2024-11-06 18:57:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:32,096 INFO L471 AbstractCegarLoop]: Abstraction has 3507 states and 4273 transitions. [2024-11-06 18:57:32,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3507 states and 4273 transitions. [2024-11-06 18:57:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-06 18:57:32,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:32,101 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:32,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:57:32,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:32,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash 543920742, now seen corresponding path program 1 times [2024-11-06 18:57:32,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:32,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336199481] [2024-11-06 18:57:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:32,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:57:32,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336199481] [2024-11-06 18:57:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336199481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:32,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:32,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:57:32,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144325111] [2024-11-06 18:57:32,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:32,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:57:32,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:32,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:57:32,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:57:32,341 INFO L87 Difference]: Start difference. First operand 3507 states and 4273 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:33,310 INFO L93 Difference]: Finished difference Result 7029 states and 8578 transitions. [2024-11-06 18:57:33,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:57:33,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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 219 [2024-11-06 18:57:33,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:33,321 INFO L225 Difference]: With dead ends: 7029 [2024-11-06 18:57:33,322 INFO L226 Difference]: Without dead ends: 3524 [2024-11-06 18:57:33,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:57:33,326 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 438 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:33,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 191 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 18:57:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2024-11-06 18:57:33,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3101. [2024-11-06 18:57:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3101 states, 3100 states have (on average 1.2193548387096773) internal successors, (3780), 3100 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 3780 transitions. [2024-11-06 18:57:33,370 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 3780 transitions. Word has length 219 [2024-11-06 18:57:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:33,371 INFO L471 AbstractCegarLoop]: Abstraction has 3101 states and 3780 transitions. [2024-11-06 18:57:33,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 3780 transitions. [2024-11-06 18:57:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-06 18:57:33,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:33,375 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:33,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:57:33,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:33,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash 659726089, now seen corresponding path program 1 times [2024-11-06 18:57:33,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:33,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553496134] [2024-11-06 18:57:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:33,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:57:33,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:33,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553496134] [2024-11-06 18:57:33,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553496134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:33,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:33,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:57:33,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663973750] [2024-11-06 18:57:33,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:33,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:33,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:33,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:33,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:33,549 INFO L87 Difference]: Start difference. First operand 3101 states and 3780 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:34,217 INFO L93 Difference]: Finished difference Result 8057 states and 9768 transitions. [2024-11-06 18:57:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:34,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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 223 [2024-11-06 18:57:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:34,230 INFO L225 Difference]: With dead ends: 8057 [2024-11-06 18:57:34,230 INFO L226 Difference]: Without dead ends: 4958 [2024-11-06 18:57:34,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:34,234 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 218 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:34,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 218 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:57:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2024-11-06 18:57:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4956. [2024-11-06 18:57:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4956 states, 4955 states have (on average 1.205449041372351) internal successors, (5973), 4955 states have internal predecessors, (5973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 5973 transitions. [2024-11-06 18:57:34,308 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 5973 transitions. Word has length 223 [2024-11-06 18:57:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:34,309 INFO L471 AbstractCegarLoop]: Abstraction has 4956 states and 5973 transitions. [2024-11-06 18:57:34,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:34,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 5973 transitions. [2024-11-06 18:57:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-06 18:57:34,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:34,316 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:34,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 18:57:34,317 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:34,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:34,317 INFO L85 PathProgramCache]: Analyzing trace with hash 890126555, now seen corresponding path program 1 times [2024-11-06 18:57:34,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:34,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812504195] [2024-11-06 18:57:34,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:34,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:57:34,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:34,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812504195] [2024-11-06 18:57:34,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812504195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:57:34,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512994271] [2024-11-06 18:57:34,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:34,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:57:34,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:57:34,588 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 18:57:34,589 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 18:57:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:34,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:57:34,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:57:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:57:34,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:57:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:57:35,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512994271] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:57:35,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:57:35,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 6 [2024-11-06 18:57:35,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300289374] [2024-11-06 18:57:35,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:57:35,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:57:35,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:35,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:57:35,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:57:35,138 INFO L87 Difference]: Start difference. First operand 4956 states and 5973 transitions. Second operand has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:38,653 INFO L93 Difference]: Finished difference Result 41440 states and 50938 transitions. [2024-11-06 18:57:38,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 18:57:38,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 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 226 [2024-11-06 18:57:38,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:38,719 INFO L225 Difference]: With dead ends: 41440 [2024-11-06 18:57:38,719 INFO L226 Difference]: Without dead ends: 36486 [2024-11-06 18:57:38,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:57:38,727 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 2332 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 4273 mSolverCounterSat, 1233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2332 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 5506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1233 IncrementalHoareTripleChecker+Valid, 4273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:38,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2332 Valid, 473 Invalid, 5506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1233 Valid, 4273 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-06 18:57:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36486 states. [2024-11-06 18:57:39,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36486 to 36425. [2024-11-06 18:57:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36425 states, 36424 states have (on average 1.1623380188886447) internal successors, (42337), 36424 states have internal predecessors, (42337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36425 states to 36425 states and 42337 transitions. [2024-11-06 18:57:39,244 INFO L78 Accepts]: Start accepts. Automaton has 36425 states and 42337 transitions. Word has length 226 [2024-11-06 18:57:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:39,245 INFO L471 AbstractCegarLoop]: Abstraction has 36425 states and 42337 transitions. [2024-11-06 18:57:39,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 36425 states and 42337 transitions. [2024-11-06 18:57:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-06 18:57:39,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:39,281 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:39,294 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 18:57:39,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:57:39,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:39,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash -213655855, now seen corresponding path program 1 times [2024-11-06 18:57:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:39,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170622691] [2024-11-06 18:57:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:57:39,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170622691] [2024-11-06 18:57:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170622691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:39,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:57:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972134705] [2024-11-06 18:57:39,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:39,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:39,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:39,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:39,620 INFO L87 Difference]: Start difference. First operand 36425 states and 42337 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:40,399 INFO L93 Difference]: Finished difference Result 96861 states and 113027 transitions. [2024-11-06 18:57:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:40,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 2 states have internal predecessors, (253), 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 18:57:40,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:40,468 INFO L225 Difference]: With dead ends: 96861 [2024-11-06 18:57:40,468 INFO L226 Difference]: Without dead ends: 60438 [2024-11-06 18:57:40,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:40,504 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 178 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:40,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 189 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:57:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60438 states. [2024-11-06 18:57:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60438 to 58388. [2024-11-06 18:57:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58388 states, 58387 states have (on average 1.145289191087057) internal successors, (66870), 58387 states have internal predecessors, (66870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58388 states to 58388 states and 66870 transitions. [2024-11-06 18:57:41,183 INFO L78 Accepts]: Start accepts. Automaton has 58388 states and 66870 transitions. Word has length 253 [2024-11-06 18:57:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:41,183 INFO L471 AbstractCegarLoop]: Abstraction has 58388 states and 66870 transitions. [2024-11-06 18:57:41,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 58388 states and 66870 transitions. [2024-11-06 18:57:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-06 18:57:41,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:41,226 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:41,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 18:57:41,227 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:41,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash -74266971, now seen corresponding path program 1 times [2024-11-06 18:57:41,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:41,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125119493] [2024-11-06 18:57:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:41,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 100 proven. 6 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-06 18:57:41,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125119493] [2024-11-06 18:57:41,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125119493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:57:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257439410] [2024-11-06 18:57:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:41,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:57:41,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:57:41,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:57:41,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 18:57:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:41,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:57:41,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:57:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-06 18:57:42,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:57:42,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257439410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:42,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:57:42,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-06 18:57:42,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921129298] [2024-11-06 18:57:42,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:42,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:42,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:42,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:42,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:57:42,066 INFO L87 Difference]: Start difference. First operand 58388 states and 66870 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:42,824 INFO L93 Difference]: Finished difference Result 122875 states and 140458 transitions. [2024-11-06 18:57:42,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:42,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 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 272 [2024-11-06 18:57:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:42,895 INFO L225 Difference]: With dead ends: 122875 [2024-11-06 18:57:42,895 INFO L226 Difference]: Without dead ends: 64487 [2024-11-06 18:57:42,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:57:42,935 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 225 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:42,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 154 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:57:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64487 states. [2024-11-06 18:57:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64487 to 64077. [2024-11-06 18:57:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64077 states, 64076 states have (on average 1.1173294213121918) internal successors, (71594), 64076 states have internal predecessors, (71594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64077 states to 64077 states and 71594 transitions. [2024-11-06 18:57:43,752 INFO L78 Accepts]: Start accepts. Automaton has 64077 states and 71594 transitions. Word has length 272 [2024-11-06 18:57:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:43,753 INFO L471 AbstractCegarLoop]: Abstraction has 64077 states and 71594 transitions. [2024-11-06 18:57:43,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 64077 states and 71594 transitions. [2024-11-06 18:57:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-06 18:57:43,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:43,781 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:43,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 18:57:43,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:57:43,985 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:43,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1027062723, now seen corresponding path program 1 times [2024-11-06 18:57:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:43,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455966196] [2024-11-06 18:57:43,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 18:57:44,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:44,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455966196] [2024-11-06 18:57:44,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455966196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:44,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:44,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:57:44,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461597063] [2024-11-06 18:57:44,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:44,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:44,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:44,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:44,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:44,129 INFO L87 Difference]: Start difference. First operand 64077 states and 71594 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:44,918 INFO L93 Difference]: Finished difference Result 142686 states and 160167 transitions. [2024-11-06 18:57:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:44,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 2 states have internal predecessors, (251), 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 276 [2024-11-06 18:57:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:45,000 INFO L225 Difference]: With dead ends: 142686 [2024-11-06 18:57:45,000 INFO L226 Difference]: Without dead ends: 78611 [2024-11-06 18:57:45,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:45,040 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 170 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:45,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 179 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:57:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78611 states. [2024-11-06 18:57:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78611 to 75454. [2024-11-06 18:57:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75454 states, 75453 states have (on average 1.1244218255072693) internal successors, (84841), 75453 states have internal predecessors, (84841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75454 states to 75454 states and 84841 transitions. [2024-11-06 18:57:46,093 INFO L78 Accepts]: Start accepts. Automaton has 75454 states and 84841 transitions. Word has length 276 [2024-11-06 18:57:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:46,093 INFO L471 AbstractCegarLoop]: Abstraction has 75454 states and 84841 transitions. [2024-11-06 18:57:46,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 75454 states and 84841 transitions. [2024-11-06 18:57:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-11-06 18:57:46,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:46,132 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:46,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 18:57:46,132 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:46,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:46,133 INFO L85 PathProgramCache]: Analyzing trace with hash -321260320, now seen corresponding path program 1 times [2024-11-06 18:57:46,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:46,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221240001] [2024-11-06 18:57:46,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:46,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-06 18:57:46,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:46,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221240001] [2024-11-06 18:57:46,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221240001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:57:46,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026914052] [2024-11-06 18:57:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:46,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:57:46,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:57:46,533 INFO L229 MonitoredProcess]: Starting monitored process 4 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 18:57:46,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 18:57:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:46,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:57:46,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:57:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-06 18:57:46,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:57:46,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026914052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:46,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:57:46,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 18:57:46,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655629993] [2024-11-06 18:57:46,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:46,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:46,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:46,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:57:46,917 INFO L87 Difference]: Start difference. First operand 75454 states and 84841 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:47,665 INFO L93 Difference]: Finished difference Result 164151 states and 185418 transitions. [2024-11-06 18:57:47,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:47,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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 288 [2024-11-06 18:57:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:47,770 INFO L225 Difference]: With dead ends: 164151 [2024-11-06 18:57:47,771 INFO L226 Difference]: Without dead ends: 88699 [2024-11-06 18:57:47,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:57:47,929 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 78 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:47,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 390 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:57:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88699 states. [2024-11-06 18:57:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88699 to 86019. [2024-11-06 18:57:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86019 states, 86018 states have (on average 1.126148015531633) internal successors, (96869), 86018 states have internal predecessors, (96869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86019 states to 86019 states and 96869 transitions. [2024-11-06 18:57:48,680 INFO L78 Accepts]: Start accepts. Automaton has 86019 states and 96869 transitions. Word has length 288 [2024-11-06 18:57:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:48,680 INFO L471 AbstractCegarLoop]: Abstraction has 86019 states and 96869 transitions. [2024-11-06 18:57:48,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 86019 states and 96869 transitions. [2024-11-06 18:57:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-06 18:57:48,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:48,708 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:48,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 18:57:48,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:57:48,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:48,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:48,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1667401814, now seen corresponding path program 1 times [2024-11-06 18:57:48,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:48,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123455136] [2024-11-06 18:57:48,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:48,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-06 18:57:49,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:49,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123455136] [2024-11-06 18:57:49,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123455136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:49,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:49,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:57:49,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682362687] [2024-11-06 18:57:49,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:49,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:57:49,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:49,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:57:49,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:57:49,259 INFO L87 Difference]: Start difference. First operand 86019 states and 96869 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:49,992 INFO L93 Difference]: Finished difference Result 156650 states and 176677 transitions. [2024-11-06 18:57:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:57:49,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 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 293 [2024-11-06 18:57:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:50,066 INFO L225 Difference]: With dead ends: 156650 [2024-11-06 18:57:50,066 INFO L226 Difference]: Without dead ends: 68197 [2024-11-06 18:57:50,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:57:50,113 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 445 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:50,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 61 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:57:50,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68197 states. [2024-11-06 18:57:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68197 to 64941. [2024-11-06 18:57:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64941 states, 64940 states have (on average 1.0749307052663997) internal successors, (69806), 64940 states have internal predecessors, (69806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64941 states to 64941 states and 69806 transitions. [2024-11-06 18:57:50,959 INFO L78 Accepts]: Start accepts. Automaton has 64941 states and 69806 transitions. Word has length 293 [2024-11-06 18:57:50,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:50,959 INFO L471 AbstractCegarLoop]: Abstraction has 64941 states and 69806 transitions. [2024-11-06 18:57:50,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:50,960 INFO L276 IsEmpty]: Start isEmpty. Operand 64941 states and 69806 transitions. [2024-11-06 18:57:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-11-06 18:57:50,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:50,979 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:50,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 18:57:50,980 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:50,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:50,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1362121819, now seen corresponding path program 1 times [2024-11-06 18:57:50,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:50,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270183215] [2024-11-06 18:57:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:50,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 18:57:51,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:51,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270183215] [2024-11-06 18:57:51,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270183215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:51,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:51,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:57:51,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653430091] [2024-11-06 18:57:51,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:51,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:57:51,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:57:51,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:57:51,308 INFO L87 Difference]: Start difference. First operand 64941 states and 69806 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:52,228 INFO L93 Difference]: Finished difference Result 133164 states and 143104 transitions. [2024-11-06 18:57:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:57:52,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 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 303 [2024-11-06 18:57:52,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:52,287 INFO L225 Difference]: With dead ends: 133164 [2024-11-06 18:57:52,288 INFO L226 Difference]: Without dead ends: 66804 [2024-11-06 18:57:52,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:57:52,302 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 336 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:52,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 82 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:57:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66804 states. [2024-11-06 18:57:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66804 to 64734. [2024-11-06 18:57:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64734 states, 64733 states have (on average 1.0730693772882456) internal successors, (69463), 64733 states have internal predecessors, (69463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64734 states to 64734 states and 69463 transitions. [2024-11-06 18:57:52,774 INFO L78 Accepts]: Start accepts. Automaton has 64734 states and 69463 transitions. Word has length 303 [2024-11-06 18:57:52,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:52,774 INFO L471 AbstractCegarLoop]: Abstraction has 64734 states and 69463 transitions. [2024-11-06 18:57:52,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 64734 states and 69463 transitions. [2024-11-06 18:57:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-06 18:57:52,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:52,787 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:52,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 18:57:52,787 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:52,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:52,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1510138523, now seen corresponding path program 1 times [2024-11-06 18:57:52,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:52,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923487606] [2024-11-06 18:57:52,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:52,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 100 proven. 6 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-06 18:57:53,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:53,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923487606] [2024-11-06 18:57:53,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923487606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:57:53,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991854492] [2024-11-06 18:57:53,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:53,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:57:53,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:57:53,088 INFO L229 MonitoredProcess]: Starting monitored process 5 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 18:57:53,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 18:57:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:53,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:57:53,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:57:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-06 18:57:53,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:57:53,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991854492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:53,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:57:53,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 18:57:53,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850515120] [2024-11-06 18:57:53,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:53,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:53,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:53,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:57:53,360 INFO L87 Difference]: Start difference. First operand 64734 states and 69463 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:54,039 INFO L93 Difference]: Finished difference Result 128459 states and 137894 transitions. [2024-11-06 18:57:54,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:54,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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 309 [2024-11-06 18:57:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:54,107 INFO L225 Difference]: With dead ends: 128459 [2024-11-06 18:57:54,107 INFO L226 Difference]: Without dead ends: 63727 [2024-11-06 18:57:54,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:57:54,141 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 88 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:54,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 273 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:57:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63727 states. [2024-11-06 18:57:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63727 to 62290. [2024-11-06 18:57:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62290 states, 62289 states have (on average 1.0696110067588178) internal successors, (66625), 62289 states have internal predecessors, (66625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62290 states to 62290 states and 66625 transitions. [2024-11-06 18:57:54,890 INFO L78 Accepts]: Start accepts. Automaton has 62290 states and 66625 transitions. Word has length 309 [2024-11-06 18:57:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:54,890 INFO L471 AbstractCegarLoop]: Abstraction has 62290 states and 66625 transitions. [2024-11-06 18:57:54,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 62290 states and 66625 transitions. [2024-11-06 18:57:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-06 18:57:54,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:54,920 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:54,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 18:57:55,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-06 18:57:55,120 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:55,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:55,121 INFO L85 PathProgramCache]: Analyzing trace with hash -261254614, now seen corresponding path program 1 times [2024-11-06 18:57:55,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:55,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912730461] [2024-11-06 18:57:55,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:55,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 170 proven. 6 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2024-11-06 18:57:55,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:55,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912730461] [2024-11-06 18:57:55,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912730461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:57:55,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402389914] [2024-11-06 18:57:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:55,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:57:55,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:57:55,647 INFO L229 MonitoredProcess]: Starting monitored process 6 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 18:57:55,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 18:57:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:55,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:57:55,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:57:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-11-06 18:57:55,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:57:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402389914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:55,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:57:55,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 18:57:55,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42955388] [2024-11-06 18:57:55,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:55,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:55,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:55,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:57:55,856 INFO L87 Difference]: Start difference. First operand 62290 states and 66625 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:56,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:56,336 INFO L93 Difference]: Finished difference Result 97088 states and 103580 transitions. [2024-11-06 18:57:56,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:56,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 409 [2024-11-06 18:57:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:56,338 INFO L225 Difference]: With dead ends: 97088 [2024-11-06 18:57:56,338 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:57:56,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:57:56,368 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 159 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:56,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 289 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:57:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:57:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:57:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:57:56,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 409 [2024-11-06 18:57:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:56,372 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:57:56,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:57:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:57:56,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:57:56,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:57:56,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 18:57:56,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-06 18:57:56,582 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:56,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:57:59,493 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:57:59,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:57:59 BoogieIcfgContainer [2024-11-06 18:57:59,517 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:57:59,518 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:57:59,518 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:57:59,518 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:57:59,519 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:57:26" (3/4) ... [2024-11-06 18:57:59,520 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:57:59,544 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 18:57:59,546 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:57:59,547 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:57:59,549 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:57:59,691 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:57:59,691 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:57:59,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:57:59,692 INFO L158 Benchmark]: Toolchain (without parser) took 35138.31ms. Allocated memory was 100.7MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 71.3MB in the beginning and 3.8GB in the end (delta: -3.8GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2024-11-06 18:57:59,692 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:57:59,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.12ms. Allocated memory is still 100.7MB. Free memory was 71.1MB in the beginning and 48.1MB in the end (delta: 23.0MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2024-11-06 18:57:59,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.37ms. Allocated memory is still 100.7MB. Free memory was 48.1MB in the beginning and 33.6MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:57:59,693 INFO L158 Benchmark]: Boogie Preprocessor took 162.91ms. Allocated memory is still 100.7MB. Free memory was 33.6MB in the beginning and 57.3MB in the end (delta: -23.7MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-11-06 18:57:59,694 INFO L158 Benchmark]: RCFGBuilder took 1450.06ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 57.3MB in the beginning and 86.8MB in the end (delta: -29.6MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2024-11-06 18:57:59,694 INFO L158 Benchmark]: TraceAbstraction took 32752.87ms. Allocated memory was 142.6MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 86.8MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2024-11-06 18:57:59,694 INFO L158 Benchmark]: Witness Printer took 172.95ms. Allocated memory is still 7.0GB. Free memory was 3.9GB in the beginning and 3.8GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 18:57:59,697 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.54ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.12ms. Allocated memory is still 100.7MB. Free memory was 71.1MB in the beginning and 48.1MB in the end (delta: 23.0MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.37ms. Allocated memory is still 100.7MB. Free memory was 48.1MB in the beginning and 33.6MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 162.91ms. Allocated memory is still 100.7MB. Free memory was 33.6MB in the beginning and 57.3MB in the end (delta: -23.7MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1450.06ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 57.3MB in the beginning and 86.8MB in the end (delta: -29.6MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32752.87ms. Allocated memory was 142.6MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 86.8MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. * Witness Printer took 172.95ms. Allocated memory is still 7.0GB. Free memory was 3.9GB in the beginning and 3.8GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. 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: 1570]: 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, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.8s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5645 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5645 mSDsluCounter, 3983 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 691 mSDsCounter, 3161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14279 IncrementalHoareTripleChecker+Invalid, 17440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3161 mSolverCounterUnsat, 3292 mSDtfsCounter, 14279 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1789 GetRequests, 1748 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86019occurred in iteration=12, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 15573 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 5541 NumberOfCodeBlocks, 5541 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5745 ConstructedInterpolants, 0 QuantifiedInterpolants, 10606 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2852 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 3316/3372 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: 1668]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a16 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a6 <= 0)) || (((((a5 == 1) && (2 <= a3)) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0))) || (((((((a5 == 1) && (2 <= a3)) && (a27 != 1)) && (a16 == 1)) && (a7 != 1)) && (a11 == 1)) && (a12 == 0))) || (((((((a5 == 1) && (a27 != 1)) && (a16 == 1)) && (a7 != 1)) && (a11 == 1)) && (a12 == 0)) && (a3 == 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a7 != 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1))) || (((((a5 == 1) && (a7 != 1)) && (a11 == 1)) && (a3 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a27 != 1)) && (a16 == 1)) && (a7 != 1)) && (a11 == 1)) && (a3 == 1)) && (a12 == 0))) || (((((((a26 == 1) && (a5 == 1)) && (2 <= a3)) && (a7 != 1)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a7 != 1)) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a7 != 1)) && (a11 == 1)) && (a27 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a7 != 1)) && (a11 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a7 != 1)) && (a11 == 1)) && (a3 == 0)) && (a6 <= 0))) || (((((a5 == 1) && (a7 != 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a7 != 1)) && (a11 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a27 == 1)) && (a3 == 0))) || ((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (2 <= a3)) && (a7 != 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a7 != 1)) && (a3 == 1)) && (a11 <= 0)) && (a6 <= 0))) || (((((((a5 == 1) && (a27 != 1)) && (a16 == 1)) && (a7 != 1)) && (a3 == 1)) && (a11 <= 0)) && (a12 == 0))) || ((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a12 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || (((((a5 == 1) && (a7 != 1)) && (a11 == 1)) && (a6 == 1)) && (a3 == 0))) || (((((((a5 == 1) && (2 <= a3)) && (a7 != 1)) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (2 <= a3)) && (a7 != 1)) && (a26 <= 0)) && (a11 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a7 != 1)) && (a26 <= 0)) && (a11 <= 0)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0))) || (((((a5 == 1) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0))) || (((((a5 == 1) && (2 <= a3)) && (a7 != 1)) && (a11 == 1)) && (a6 == 1))) || ((((((((a26 == 1) && (a5 == 1)) && (a16 == 1)) && (a11 == 1)) && (a12 == 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 == 1))) || (((((a5 == 1) && (a7 != 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0))) || (((((((a5 == 1) && (2 <= a3)) && (a16 == 1)) && (a7 != 1)) && (a11 == 1)) && (a12 == 0)) && (a6 <= 0))) || ((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a7 != 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((((a26 == 1) && (a5 == 1)) && (a16 == 1)) && (a11 == 1)) && (a6 == 1)) && (a12 == 0)) && (a27 == 1)) && (a3 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-06 18:57:59,717 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