./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label09.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/Problem11_label09.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', 'd8f5e7588b052ea6944040fff8b4327aaa68f0ec95b59b9f16a8a13412f9772d'] 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/Problem11_label09.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 d8f5e7588b052ea6944040fff8b4327aaa68f0ec95b59b9f16a8a13412f9772d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:37:28,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:37:28,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:37:28,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:37:28,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:37:28,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:37:28,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:37:28,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:37:28,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:37:28,519 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:37:28,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:37:28,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:37:28,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:37:28,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:37:28,520 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:37:28,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:37:28,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:37:28,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:37:28,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:37:28,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:37:28,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:37:28,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:37:28,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:37:28,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:37:28,521 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:37:28,521 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:37:28,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:37:28,521 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:37:28,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:37:28,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:37:28,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:37:28,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:37:28,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:37:28,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:37:28,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:37:28,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:37:28,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:37:28,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:37:28,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:37:28,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:37:28,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:37:28,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:37:28,522 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 -> d8f5e7588b052ea6944040fff8b4327aaa68f0ec95b59b9f16a8a13412f9772d [2024-11-06 19:37:28,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:37:28,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:37:28,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:37:28,738 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:37:28,738 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:37:28,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label09.c [2024-11-06 19:37:29,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:37:30,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:37:30,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label09.c [2024-11-06 19:37:30,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5450483d2/9151ea078b4041f58b369f13c1aa9475/FLAGacde039a0 [2024-11-06 19:37:30,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5450483d2/9151ea078b4041f58b369f13c1aa9475 [2024-11-06 19:37:30,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:37:30,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:37:30,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:37:30,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:37:30,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:37:30,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:30,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57852b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30, skipping insertion in model container [2024-11-06 19:37:30,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:30,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:37:30,514 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/Problem11_label09.c[9501,9514] [2024-11-06 19:37:30,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:37:30,637 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:37:30,664 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/Problem11_label09.c[9501,9514] [2024-11-06 19:37:30,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:37:30,761 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:37:30,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30 WrapperNode [2024-11-06 19:37:30,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:37:30,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:37:30,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:37:30,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:37:30,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:30,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:30,886 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-06 19:37:30,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:37:30,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:37:30,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:37:30,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:37:30,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:30,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:30,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:30,947 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 19:37:30,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:30,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:30,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:30,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:30,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:31,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:31,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:37:31,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:37:31,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:37:31,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:37:31,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (1/1) ... [2024-11-06 19:37:31,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:37:31,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:37:31,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 19:37:31,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 19:37:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:37:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:37:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:37:31,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:37:31,157 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:37:31,158 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:37:32,297 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-06 19:37:32,297 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:37:32,313 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:37:32,313 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:37:32,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:37:32 BoogieIcfgContainer [2024-11-06 19:37:32,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:37:32,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:37:32,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:37:32,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:37:32,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:37:30" (1/3) ... [2024-11-06 19:37:32,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5dd3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:37:32, skipping insertion in model container [2024-11-06 19:37:32,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:30" (2/3) ... [2024-11-06 19:37:32,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5dd3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:37:32, skipping insertion in model container [2024-11-06 19:37:32,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:37:32" (3/3) ... [2024-11-06 19:37:32,322 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label09.c [2024-11-06 19:37:32,332 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:37:32,332 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:37:32,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:37:32,393 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;@553b5c7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:37:32,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:37:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-06 19:37:32,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:32,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:32,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:32,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash -215114758, now seen corresponding path program 1 times [2024-11-06 19:37:32,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:32,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027040314] [2024-11-06 19:37:32,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:37:32,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:32,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027040314] [2024-11-06 19:37:32,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027040314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:32,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:32,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:37:32,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642352377] [2024-11-06 19:37:32,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:32,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:32,787 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:33,645 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2024-11-06 19:37:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:33,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-06 19:37:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:33,661 INFO L225 Difference]: With dead ends: 776 [2024-11-06 19:37:33,661 INFO L226 Difference]: Without dead ends: 413 [2024-11-06 19:37:33,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:33,669 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 161 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:33,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:37:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-06 19:37:33,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-11-06 19:37:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2024-11-06 19:37:33,729 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 66 [2024-11-06 19:37:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:33,729 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2024-11-06 19:37:33,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2024-11-06 19:37:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-06 19:37:33,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:33,735 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:33,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:37:33,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:33,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash 75298066, now seen corresponding path program 1 times [2024-11-06 19:37:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:33,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267466035] [2024-11-06 19:37:33,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:33,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:37:33,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:33,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267466035] [2024-11-06 19:37:33,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267466035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:33,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:33,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:37:33,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009281940] [2024-11-06 19:37:33,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:33,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:33,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:33,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:33,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:33,984 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:34,644 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2024-11-06 19:37:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-11-06 19:37:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:34,650 INFO L225 Difference]: With dead ends: 1209 [2024-11-06 19:37:34,651 INFO L226 Difference]: Without dead ends: 800 [2024-11-06 19:37:34,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:34,653 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:34,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:37:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-06 19:37:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2024-11-06 19:37:34,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2024-11-06 19:37:34,692 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 134 [2024-11-06 19:37:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:34,692 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2024-11-06 19:37:34,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2024-11-06 19:37:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-06 19:37:34,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:34,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:34,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:37:34,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:34,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:34,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1430585172, now seen corresponding path program 1 times [2024-11-06 19:37:34,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:34,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699024169] [2024-11-06 19:37:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:34,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:37:35,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:35,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699024169] [2024-11-06 19:37:35,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699024169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:35,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:35,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:37:35,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907885856] [2024-11-06 19:37:35,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:35,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:35,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:35,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:35,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:35,061 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:35,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:35,633 INFO L93 Difference]: Finished difference Result 1942 states and 2631 transitions. [2024-11-06 19:37:35,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:35,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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 135 [2024-11-06 19:37:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:35,637 INFO L225 Difference]: With dead ends: 1942 [2024-11-06 19:37:35,637 INFO L226 Difference]: Without dead ends: 1157 [2024-11-06 19:37:35,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:35,639 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:35,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:37:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-06 19:37:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-11-06 19:37:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277922077922078) internal successors, (1476), 1155 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1476 transitions. [2024-11-06 19:37:35,656 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1476 transitions. Word has length 135 [2024-11-06 19:37:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:35,657 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1476 transitions. [2024-11-06 19:37:35,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1476 transitions. [2024-11-06 19:37:35,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-06 19:37:35,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:35,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:35,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:37:35,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:35,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:35,659 INFO L85 PathProgramCache]: Analyzing trace with hash 290239190, now seen corresponding path program 1 times [2024-11-06 19:37:35,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:35,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242075949] [2024-11-06 19:37:35,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:35,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-06 19:37:35,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:35,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242075949] [2024-11-06 19:37:35,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242075949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:35,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:35,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:37:35,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333870948] [2024-11-06 19:37:35,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:35,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:35,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:35,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:35,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:35,827 INFO L87 Difference]: Start difference. First operand 1156 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:36,472 INFO L93 Difference]: Finished difference Result 2502 states and 3339 transitions. [2024-11-06 19:37:36,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:36,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 178 [2024-11-06 19:37:36,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:36,477 INFO L225 Difference]: With dead ends: 2502 [2024-11-06 19:37:36,477 INFO L226 Difference]: Without dead ends: 1532 [2024-11-06 19:37:36,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 19:37:36,478 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:36,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:37:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-06 19:37:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2024-11-06 19:37:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.2619203135205748) internal successors, (1932), 1531 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1932 transitions. [2024-11-06 19:37:36,499 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1932 transitions. Word has length 178 [2024-11-06 19:37:36,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:36,500 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1932 transitions. [2024-11-06 19:37:36,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:36,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1932 transitions. [2024-11-06 19:37:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-06 19:37:36,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:36,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:36,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:37:36,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:36,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:36,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1612095663, now seen corresponding path program 1 times [2024-11-06 19:37:36,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:36,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432034825] [2024-11-06 19:37:36,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:36,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:37:36,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:36,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432034825] [2024-11-06 19:37:36,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432034825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:36,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:36,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:36,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127526924] [2024-11-06 19:37:36,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:36,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:36,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:36,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:36,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:36,704 INFO L87 Difference]: Start difference. First operand 1532 states and 1932 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:37,272 INFO L93 Difference]: Finished difference Result 3644 states and 4738 transitions. [2024-11-06 19:37:37,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:37,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 193 [2024-11-06 19:37:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:37,279 INFO L225 Difference]: With dead ends: 3644 [2024-11-06 19:37:37,279 INFO L226 Difference]: Without dead ends: 2298 [2024-11-06 19:37:37,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:37,281 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 169 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:37,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:37:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-11-06 19:37:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2295. [2024-11-06 19:37:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.2654751525719268) internal successors, (2903), 2294 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2903 transitions. [2024-11-06 19:37:37,310 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2903 transitions. Word has length 193 [2024-11-06 19:37:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:37,311 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 2903 transitions. [2024-11-06 19:37:37,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2903 transitions. [2024-11-06 19:37:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-06 19:37:37,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:37,314 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2024-11-06 19:37:37,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:37:37,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:37,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:37,314 INFO L85 PathProgramCache]: Analyzing trace with hash -410493458, now seen corresponding path program 1 times [2024-11-06 19:37:37,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:37,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555417698] [2024-11-06 19:37:37,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:37:37,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:37,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555417698] [2024-11-06 19:37:37,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555417698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:37,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:37,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:37,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724182186] [2024-11-06 19:37:37,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:37,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:37,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:37,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:37,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:37,527 INFO L87 Difference]: Start difference. First operand 2295 states and 2903 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:38,128 INFO L93 Difference]: Finished difference Result 5528 states and 7095 transitions. [2024-11-06 19:37:38,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:38,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 246 [2024-11-06 19:37:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:38,137 INFO L225 Difference]: With dead ends: 5528 [2024-11-06 19:37:38,137 INFO L226 Difference]: Without dead ends: 3419 [2024-11-06 19:37:38,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:38,140 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:38,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 340 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:37:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2024-11-06 19:37:38,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3218. [2024-11-06 19:37:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 3217 states have (on average 1.2377991917935964) internal successors, (3982), 3217 states have internal predecessors, (3982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 3982 transitions. [2024-11-06 19:37:38,223 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 3982 transitions. Word has length 246 [2024-11-06 19:37:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:38,223 INFO L471 AbstractCegarLoop]: Abstraction has 3218 states and 3982 transitions. [2024-11-06 19:37:38,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 3982 transitions. [2024-11-06 19:37:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-06 19:37:38,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:38,231 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2024-11-06 19:37:38,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:37:38,231 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:38,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:38,232 INFO L85 PathProgramCache]: Analyzing trace with hash -744050184, now seen corresponding path program 1 times [2024-11-06 19:37:38,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:38,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51302872] [2024-11-06 19:37:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:38,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 19:37:38,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:38,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51302872] [2024-11-06 19:37:38,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51302872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:38,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:38,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:38,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45423177] [2024-11-06 19:37:38,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:38,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:38,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:38,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:38,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:38,484 INFO L87 Difference]: Start difference. First operand 3218 states and 3982 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:39,118 INFO L93 Difference]: Finished difference Result 8460 states and 10566 transitions. [2024-11-06 19:37:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:39,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2024-11-06 19:37:39,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:39,133 INFO L225 Difference]: With dead ends: 8460 [2024-11-06 19:37:39,133 INFO L226 Difference]: Without dead ends: 5244 [2024-11-06 19:37:39,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:39,138 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 173 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:39,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 130 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:37:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2024-11-06 19:37:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5060. [2024-11-06 19:37:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5060 states, 5059 states have (on average 1.2105159122356197) internal successors, (6124), 5059 states have internal predecessors, (6124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 6124 transitions. [2024-11-06 19:37:39,210 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 6124 transitions. Word has length 247 [2024-11-06 19:37:39,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:39,210 INFO L471 AbstractCegarLoop]: Abstraction has 5060 states and 6124 transitions. [2024-11-06 19:37:39,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 6124 transitions. [2024-11-06 19:37:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-06 19:37:39,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:39,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2024-11-06 19:37:39,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:37:39,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:39,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:39,214 INFO L85 PathProgramCache]: Analyzing trace with hash 90582615, now seen corresponding path program 1 times [2024-11-06 19:37:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:39,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184079586] [2024-11-06 19:37:39,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:39,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-06 19:37:39,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:39,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184079586] [2024-11-06 19:37:39,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184079586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:39,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:39,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:39,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723811823] [2024-11-06 19:37:39,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:39,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:39,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:39,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:39,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:39,407 INFO L87 Difference]: Start difference. First operand 5060 states and 6124 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:39,985 INFO L93 Difference]: Finished difference Result 11980 states and 14488 transitions. [2024-11-06 19:37:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:39,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 268 [2024-11-06 19:37:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:40,000 INFO L225 Difference]: With dead ends: 11980 [2024-11-06 19:37:40,000 INFO L226 Difference]: Without dead ends: 6922 [2024-11-06 19:37:40,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:40,007 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:40,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 188 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:37:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2024-11-06 19:37:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 6716. [2024-11-06 19:37:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6716 states, 6715 states have (on average 1.1943410275502606) internal successors, (8020), 6715 states have internal predecessors, (8020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6716 states to 6716 states and 8020 transitions. [2024-11-06 19:37:40,085 INFO L78 Accepts]: Start accepts. Automaton has 6716 states and 8020 transitions. Word has length 268 [2024-11-06 19:37:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:40,085 INFO L471 AbstractCegarLoop]: Abstraction has 6716 states and 8020 transitions. [2024-11-06 19:37:40,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 6716 states and 8020 transitions. [2024-11-06 19:37:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-06 19:37:40,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:40,113 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2024-11-06 19:37:40,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:37:40,114 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:40,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash -808187339, now seen corresponding path program 1 times [2024-11-06 19:37:40,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:40,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227318613] [2024-11-06 19:37:40,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:40,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 19:37:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:40,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227318613] [2024-11-06 19:37:40,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227318613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:40,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:40,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:37:40,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211565433] [2024-11-06 19:37:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:40,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:40,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:40,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:40,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:40,235 INFO L87 Difference]: Start difference. First operand 6716 states and 8020 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 19:37:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:40,792 INFO L93 Difference]: Finished difference Result 13031 states and 15542 transitions. [2024-11-06 19:37:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:40,793 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 269 [2024-11-06 19:37:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:40,806 INFO L225 Difference]: With dead ends: 13031 [2024-11-06 19:37:40,806 INFO L226 Difference]: Without dead ends: 6317 [2024-11-06 19:37:40,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:40,812 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 114 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:40,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 152 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:37:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6317 states. [2024-11-06 19:37:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6317 to 5764. [2024-11-06 19:37:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5764 states, 5763 states have (on average 1.1457574180114525) internal successors, (6603), 5763 states have internal predecessors, (6603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 6603 transitions. [2024-11-06 19:37:40,871 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 6603 transitions. Word has length 269 [2024-11-06 19:37:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:40,871 INFO L471 AbstractCegarLoop]: Abstraction has 5764 states and 6603 transitions. [2024-11-06 19:37:40,871 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 19:37:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 6603 transitions. [2024-11-06 19:37:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-06 19:37:40,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:40,874 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2024-11-06 19:37:40,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:37:40,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:40,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash -394370667, now seen corresponding path program 1 times [2024-11-06 19:37:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220655488] [2024-11-06 19:37:40,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-06 19:37:40,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:40,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220655488] [2024-11-06 19:37:40,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220655488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:40,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:40,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:40,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673012049] [2024-11-06 19:37:40,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:40,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:40,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:40,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:40,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:40,998 INFO L87 Difference]: Start difference. First operand 5764 states and 6603 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:41,611 INFO L93 Difference]: Finished difference Result 14102 states and 16262 transitions. [2024-11-06 19:37:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:41,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 285 [2024-11-06 19:37:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:41,624 INFO L225 Difference]: With dead ends: 14102 [2024-11-06 19:37:41,624 INFO L226 Difference]: Without dead ends: 8340 [2024-11-06 19:37:41,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:41,630 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 150 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:41,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 136 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:37:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8340 states. [2024-11-06 19:37:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8340 to 7604. [2024-11-06 19:37:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7604 states, 7603 states have (on average 1.1459950019729055) internal successors, (8713), 7603 states have internal predecessors, (8713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7604 states to 7604 states and 8713 transitions. [2024-11-06 19:37:41,749 INFO L78 Accepts]: Start accepts. Automaton has 7604 states and 8713 transitions. Word has length 285 [2024-11-06 19:37:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:41,750 INFO L471 AbstractCegarLoop]: Abstraction has 7604 states and 8713 transitions. [2024-11-06 19:37:41,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 7604 states and 8713 transitions. [2024-11-06 19:37:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-11-06 19:37:41,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:41,757 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:37:41,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:37:41,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:41,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1999986080, now seen corresponding path program 1 times [2024-11-06 19:37:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:41,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864077287] [2024-11-06 19:37:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 27 proven. 100 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-06 19:37:42,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:42,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864077287] [2024-11-06 19:37:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864077287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:37:42,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716195874] [2024-11-06 19:37:42,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:42,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:37:42,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:37:42,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:37:42,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 19:37:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:42,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:37:42,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:37:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-06 19:37:42,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:37:42,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716195874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:42,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:37:42,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-06 19:37:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564864864] [2024-11-06 19:37:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:42,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:42,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:42,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:42,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:37:42,344 INFO L87 Difference]: Start difference. First operand 7604 states and 8713 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:43,109 INFO L93 Difference]: Finished difference Result 16680 states and 19213 transitions. [2024-11-06 19:37:43,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:43,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 349 [2024-11-06 19:37:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:43,123 INFO L225 Difference]: With dead ends: 16680 [2024-11-06 19:37:43,123 INFO L226 Difference]: Without dead ends: 9078 [2024-11-06 19:37:43,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:37:43,129 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 129 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:43,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 370 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:37:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9078 states. [2024-11-06 19:37:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9078 to 8523. [2024-11-06 19:37:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8523 states, 8522 states have (on average 1.1329500117343347) internal successors, (9655), 8522 states have internal predecessors, (9655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8523 states to 8523 states and 9655 transitions. [2024-11-06 19:37:43,233 INFO L78 Accepts]: Start accepts. Automaton has 8523 states and 9655 transitions. Word has length 349 [2024-11-06 19:37:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:43,234 INFO L471 AbstractCegarLoop]: Abstraction has 8523 states and 9655 transitions. [2024-11-06 19:37:43,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 8523 states and 9655 transitions. [2024-11-06 19:37:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-06 19:37:43,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:43,247 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:43,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:37:43,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-06 19:37:43,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:43,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1070352256, now seen corresponding path program 1 times [2024-11-06 19:37:43,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:43,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490077485] [2024-11-06 19:37:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:43,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-06 19:37:43,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:43,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490077485] [2024-11-06 19:37:43,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490077485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:43,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:43,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:43,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487005073] [2024-11-06 19:37:43,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:43,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:43,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:43,643 INFO L87 Difference]: Start difference. First operand 8523 states and 9655 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:44,306 INFO L93 Difference]: Finished difference Result 19067 states and 21661 transitions. [2024-11-06 19:37:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:44,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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 401 [2024-11-06 19:37:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:44,318 INFO L225 Difference]: With dead ends: 19067 [2024-11-06 19:37:44,318 INFO L226 Difference]: Without dead ends: 9810 [2024-11-06 19:37:44,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:44,326 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 90 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:44,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 362 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:37:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9810 states. [2024-11-06 19:37:44,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9810 to 9626. [2024-11-06 19:37:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9626 states, 9625 states have (on average 1.1277922077922078) internal successors, (10855), 9625 states have internal predecessors, (10855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9626 states to 9626 states and 10855 transitions. [2024-11-06 19:37:44,449 INFO L78 Accepts]: Start accepts. Automaton has 9626 states and 10855 transitions. Word has length 401 [2024-11-06 19:37:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:44,449 INFO L471 AbstractCegarLoop]: Abstraction has 9626 states and 10855 transitions. [2024-11-06 19:37:44,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 9626 states and 10855 transitions. [2024-11-06 19:37:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-11-06 19:37:44,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:44,457 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:44,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:37:44,457 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:44,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:44,458 INFO L85 PathProgramCache]: Analyzing trace with hash 679968500, now seen corresponding path program 1 times [2024-11-06 19:37:44,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:44,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524512864] [2024-11-06 19:37:44,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:44,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 19:37:44,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:44,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524512864] [2024-11-06 19:37:44,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524512864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:44,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:44,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:44,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459920746] [2024-11-06 19:37:44,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:44,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:37:44,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:44,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:37:44,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:37:44,640 INFO L87 Difference]: Start difference. First operand 9626 states and 10855 transitions. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:45,596 INFO L93 Difference]: Finished difference Result 26634 states and 30011 transitions. [2024-11-06 19:37:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:37:45,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 3 states have internal predecessors, (340), 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 403 [2024-11-06 19:37:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:45,615 INFO L225 Difference]: With dead ends: 26634 [2024-11-06 19:37:45,615 INFO L226 Difference]: Without dead ends: 17010 [2024-11-06 19:37:45,620 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 19:37:45,621 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 241 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:45,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 75 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:37:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17010 states. [2024-11-06 19:37:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17010 to 16268. [2024-11-06 19:37:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16268 states, 16267 states have (on average 1.1271285424479007) internal successors, (18335), 16267 states have internal predecessors, (18335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16268 states to 16268 states and 18335 transitions. [2024-11-06 19:37:45,768 INFO L78 Accepts]: Start accepts. Automaton has 16268 states and 18335 transitions. Word has length 403 [2024-11-06 19:37:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:45,768 INFO L471 AbstractCegarLoop]: Abstraction has 16268 states and 18335 transitions. [2024-11-06 19:37:45,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 16268 states and 18335 transitions. [2024-11-06 19:37:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-06 19:37:45,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:45,779 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:45,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:37:45,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:45,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:45,779 INFO L85 PathProgramCache]: Analyzing trace with hash 714143893, now seen corresponding path program 1 times [2024-11-06 19:37:45,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:45,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672505962] [2024-11-06 19:37:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:45,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-06 19:37:45,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672505962] [2024-11-06 19:37:45,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672505962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:45,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:45,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:45,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799606669] [2024-11-06 19:37:45,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:45,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:45,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:45,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:45,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:45,950 INFO L87 Difference]: Start difference. First operand 16268 states and 18335 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 19:37:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:46,637 INFO L93 Difference]: Finished difference Result 34566 states and 39141 transitions. [2024-11-06 19:37:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:46,638 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 406 [2024-11-06 19:37:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:46,659 INFO L225 Difference]: With dead ends: 34566 [2024-11-06 19:37:46,660 INFO L226 Difference]: Without dead ends: 18668 [2024-11-06 19:37:46,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:46,674 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 129 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:46,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 378 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:37:46,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18668 states. [2024-11-06 19:37:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18668 to 17372. [2024-11-06 19:37:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17372 states, 17371 states have (on average 1.113464970352887) internal successors, (19342), 17371 states have internal predecessors, (19342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17372 states to 17372 states and 19342 transitions. [2024-11-06 19:37:46,905 INFO L78 Accepts]: Start accepts. Automaton has 17372 states and 19342 transitions. Word has length 406 [2024-11-06 19:37:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:46,905 INFO L471 AbstractCegarLoop]: Abstraction has 17372 states and 19342 transitions. [2024-11-06 19:37:46,906 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 19:37:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 17372 states and 19342 transitions. [2024-11-06 19:37:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2024-11-06 19:37:46,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:46,926 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:37:46,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:37:46,926 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:46,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:46,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1003879343, now seen corresponding path program 1 times [2024-11-06 19:37:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:46,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922346144] [2024-11-06 19:37:46,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:46,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-06 19:37:47,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:47,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922346144] [2024-11-06 19:37:47,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922346144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:47,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:47,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:37:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479683855] [2024-11-06 19:37:47,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:47,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:47,175 INFO L87 Difference]: Start difference. First operand 17372 states and 19342 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:47,491 INFO L93 Difference]: Finished difference Result 30674 states and 34068 transitions. [2024-11-06 19:37:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:47,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 441 [2024-11-06 19:37:47,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:47,493 INFO L225 Difference]: With dead ends: 30674 [2024-11-06 19:37:47,494 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:37:47,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:47,505 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:47,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 34 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 19:37:47,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:37:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:37:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:37:47,506 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 441 [2024-11-06 19:37:47,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:47,506 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:37:47,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:37:47,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:37:47,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:37:47,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:37:47,518 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:47,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:37:48,782 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:37:48,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:37:48 BoogieIcfgContainer [2024-11-06 19:37:48,799 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:37:48,800 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:37:48,800 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:37:48,800 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:37:48,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:37:32" (3/4) ... [2024-11-06 19:37:48,802 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:37:48,818 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 19:37:48,820 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:37:48,820 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:37:48,821 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:37:48,938 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:37:48,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:37:48,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:37:48,940 INFO L158 Benchmark]: Toolchain (without parser) took 18616.97ms. Allocated memory was 109.1MB in the beginning and 830.5MB in the end (delta: 721.4MB). Free memory was 82.7MB in the beginning and 434.5MB in the end (delta: -351.9MB). Peak memory consumption was 367.3MB. Max. memory is 16.1GB. [2024-11-06 19:37:48,941 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:37:48,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.46ms. Allocated memory is still 109.1MB. Free memory was 82.5MB in the beginning and 39.7MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-06 19:37:48,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.39ms. Allocated memory is still 109.1MB. Free memory was 39.7MB in the beginning and 67.0MB in the end (delta: -27.3MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-06 19:37:48,941 INFO L158 Benchmark]: Boogie Preprocessor took 130.01ms. Allocated memory is still 109.1MB. Free memory was 67.0MB in the beginning and 42.4MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 19:37:48,942 INFO L158 Benchmark]: RCFGBuilder took 1295.81ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 42.4MB in the beginning and 69.4MB in the end (delta: -27.0MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2024-11-06 19:37:48,943 INFO L158 Benchmark]: TraceAbstraction took 16483.43ms. Allocated memory was 167.8MB in the beginning and 830.5MB in the end (delta: 662.7MB). Free memory was 68.8MB in the beginning and 451.3MB in the end (delta: -382.5MB). Peak memory consumption was 435.3MB. Max. memory is 16.1GB. [2024-11-06 19:37:48,943 INFO L158 Benchmark]: Witness Printer took 139.76ms. Allocated memory is still 830.5MB. Free memory was 451.3MB in the beginning and 434.5MB in the end (delta: 16.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 19:37:48,944 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.46ms. Allocated memory is still 109.1MB. Free memory was 82.5MB in the beginning and 39.7MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.39ms. Allocated memory is still 109.1MB. Free memory was 39.7MB in the beginning and 67.0MB in the end (delta: -27.3MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.01ms. Allocated memory is still 109.1MB. Free memory was 67.0MB in the beginning and 42.4MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1295.81ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 42.4MB in the beginning and 69.4MB in the end (delta: -27.0MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16483.43ms. Allocated memory was 167.8MB in the beginning and 830.5MB in the end (delta: 662.7MB). Free memory was 68.8MB in the beginning and 451.3MB in the end (delta: -382.5MB). Peak memory consumption was 435.3MB. Max. memory is 16.1GB. * Witness Printer took 139.76ms. Allocated memory is still 830.5MB. Free memory was 451.3MB in the beginning and 434.5MB in the end (delta: 16.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 214]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2150 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2150 mSDsluCounter, 3149 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 339 mSDsCounter, 1404 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8487 IncrementalHoareTripleChecker+Invalid, 9891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1404 mSolverCounterUnsat, 2810 mSDtfsCounter, 8487 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17372occurred in iteration=14, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 4676 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 4370 NumberOfCodeBlocks, 4370 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4354 ConstructedInterpolants, 0 QuantifiedInterpolants, 11435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 457 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 3625/3725 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: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((a25 == 12) && (a4 == 0)) && (a8 <= 15)) || ((((a4 == 0) && (a8 <= 15)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || ((((a4 == 0) && (a25 == 11)) && (a8 <= 15)) && (a23 <= 312))) || (((a25 == 11) && (a8 <= 15)) && (a4 == 1))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (278 <= a29)) && (a25 <= 10)) && (a8 <= 15))) || ((((a4 == 0) && (a8 <= 15)) && (a25 == 10)) && (a29 <= 130))) || (((a8 <= 15) && (a29 <= 245)) && (a4 == 1))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (a29 <= 130))) || (((a8 <= 15) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || (((a25 == 12) && (a8 <= 15)) && (a4 == 1))) || (((((long long) a23 + 43) <= 0) && (a4 == 1)) && (a25 == 10))) || ((((278 <= a29) && (a25 <= 10)) && (a8 <= 15)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:37:48,965 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