./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-59.i -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 6d60c41fdcdaad38dc038867a7c9992a8ab8f45b7eb867ab47c18062a0edd8d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:29:05,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:29:05,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:29:05,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:29:05,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:29:05,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:29:05,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:29:05,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:29:05,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:29:05,113 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:29:05,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:29:05,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:29:05,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:29:05,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:29:05,115 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:29:05,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:29:05,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:29:05,115 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:29:05,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:29:05,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:29:05,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:29:05,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:29:05,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:29:05,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:29:05,116 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:29:05,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:29:05,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:29:05,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:29:05,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:29:05,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:29:05,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:29:05,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:29:05,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:29:05,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:29:05,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:29:05,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:29:05,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:29:05,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:29:05,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:29:05,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:29:05,117 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:29:05,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:29:05,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:29:05,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:29:05,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:29:05,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:29:05,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:29:05,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:29:05,118 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 -> 6d60c41fdcdaad38dc038867a7c9992a8ab8f45b7eb867ab47c18062a0edd8d7 [2025-01-09 10:29:05,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:29:05,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:29:05,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:29:05,487 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:29:05,487 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:29:05,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-59.i [2025-01-09 10:29:06,635 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2dc501b6/a3c161afc97840d997fcd43b7a68a637/FLAGdd68d1939 [2025-01-09 10:29:06,928 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:29:06,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-59.i [2025-01-09 10:29:06,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2dc501b6/a3c161afc97840d997fcd43b7a68a637/FLAGdd68d1939 [2025-01-09 10:29:07,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2dc501b6/a3c161afc97840d997fcd43b7a68a637 [2025-01-09 10:29:07,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:29:07,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:29:07,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:29:07,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:29:07,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:29:07,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c12a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07, skipping insertion in model container [2025-01-09 10:29:07,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:29:07,356 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-59.i[919,932] [2025-01-09 10:29:07,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:29:07,419 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:29:07,425 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-59.i[919,932] [2025-01-09 10:29:07,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:29:07,466 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:29:07,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07 WrapperNode [2025-01-09 10:29:07,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:29:07,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:29:07,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:29:07,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:29:07,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,529 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2025-01-09 10:29:07,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:29:07,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:29:07,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:29:07,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:29:07,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,568 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]. [2025-01-09 10:29:07,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:29:07,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:29:07,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:29:07,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:29:07,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (1/1) ... [2025-01-09 10:29:07,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:29:07,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:29:07,637 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) [2025-01-09 10:29:07,641 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 [2025-01-09 10:29:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:29:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:29:07,656 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:29:07,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:29:07,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:29:07,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:29:07,720 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:29:07,721 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:29:08,084 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 10:29:08,084 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:29:08,092 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:29:08,092 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:29:08,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:29:08 BoogieIcfgContainer [2025-01-09 10:29:08,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:29:08,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:29:08,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:29:08,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:29:08,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:29:07" (1/3) ... [2025-01-09 10:29:08,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac8b3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:29:08, skipping insertion in model container [2025-01-09 10:29:08,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:29:07" (2/3) ... [2025-01-09 10:29:08,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac8b3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:29:08, skipping insertion in model container [2025-01-09 10:29:08,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:29:08" (3/3) ... [2025-01-09 10:29:08,102 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-59.i [2025-01-09 10:29:08,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:29:08,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-59.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:29:08,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:29:08,160 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;@121cfac2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:29:08,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:29:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 58 states have internal predecessors, (87), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 10:29:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 10:29:08,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:29:08,177 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:29:08,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:29:08,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:29:08,181 INFO L85 PathProgramCache]: Analyzing trace with hash -436080214, now seen corresponding path program 1 times [2025-01-09 10:29:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:29:08,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858172126] [2025-01-09 10:29:08,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:08,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:29:08,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 10:29:08,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 10:29:08,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:08,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 10:29:08,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:29:08,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858172126] [2025-01-09 10:29:08,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858172126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:29:08,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715435591] [2025-01-09 10:29:08,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:08,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:29:08,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:29:08,442 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) [2025-01-09 10:29:08,443 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 [2025-01-09 10:29:08,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 10:29:08,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 10:29:08,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:08,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:08,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:29:08,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:29:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 10:29:08,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:29:08,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715435591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:29:08,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:29:08,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:29:08,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647190767] [2025-01-09 10:29:08,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:29:08,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:29:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:29:08,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:29:08,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:29:08,645 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 58 states have internal predecessors, (87), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 10:29:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:29:08,666 INFO L93 Difference]: Finished difference Result 151 states and 263 transitions. [2025-01-09 10:29:08,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:29:08,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2025-01-09 10:29:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:29:08,671 INFO L225 Difference]: With dead ends: 151 [2025-01-09 10:29:08,671 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 10:29:08,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:29:08,676 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:29:08,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:29:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 10:29:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 10:29:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 10:29:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2025-01-09 10:29:08,704 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 136 [2025-01-09 10:29:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:29:08,704 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2025-01-09 10:29:08,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 10:29:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2025-01-09 10:29:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 10:29:08,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:29:08,707 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:29:08,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:29:08,909 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,SelfDestructingSolverStorable0 [2025-01-09 10:29:08,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:29:08,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:29:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2135633230, now seen corresponding path program 1 times [2025-01-09 10:29:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:29:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257041486] [2025-01-09 10:29:08,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:08,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:29:08,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 10:29:08,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 10:29:08,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:08,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:29:09,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:29:09,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257041486] [2025-01-09 10:29:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257041486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:29:09,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:29:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:29:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085812618] [2025-01-09 10:29:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:29:09,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:29:09,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:29:09,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:29:09,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:29:09,300 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:29:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:29:09,455 INFO L93 Difference]: Finished difference Result 217 states and 334 transitions. [2025-01-09 10:29:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:29:09,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2025-01-09 10:29:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:29:09,458 INFO L225 Difference]: With dead ends: 217 [2025-01-09 10:29:09,459 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 10:29:09,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:29:09,460 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 79 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:29:09,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 323 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:29:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 10:29:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2025-01-09 10:29:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 10:29:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2025-01-09 10:29:09,488 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 136 [2025-01-09 10:29:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:29:09,489 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2025-01-09 10:29:09,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:29:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2025-01-09 10:29:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 10:29:09,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:29:09,491 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:29:09,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:29:09,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:29:09,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:29:09,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1159690228, now seen corresponding path program 1 times [2025-01-09 10:29:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:29:09,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084674287] [2025-01-09 10:29:09,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:09,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:29:09,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 10:29:09,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 10:29:09,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:09,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:29:09,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:29:09,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084674287] [2025-01-09 10:29:09,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084674287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:29:09,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:29:09,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:29:09,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174999006] [2025-01-09 10:29:09,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:29:09,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:29:09,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:29:09,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:29:09,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:29:09,982 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 10:29:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:29:10,236 INFO L93 Difference]: Finished difference Result 279 states and 427 transitions. [2025-01-09 10:29:10,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:29:10,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2025-01-09 10:29:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:29:10,239 INFO L225 Difference]: With dead ends: 279 [2025-01-09 10:29:10,239 INFO L226 Difference]: Without dead ends: 208 [2025-01-09 10:29:10,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:29:10,240 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 204 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:29:10,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 609 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:29:10,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-09 10:29:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 181. [2025-01-09 10:29:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:29:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 277 transitions. [2025-01-09 10:29:10,284 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 277 transitions. Word has length 137 [2025-01-09 10:29:10,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:29:10,284 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 277 transitions. [2025-01-09 10:29:10,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 10:29:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 277 transitions. [2025-01-09 10:29:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 10:29:10,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:29:10,286 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:29:10,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:29:10,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:29:10,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:29:10,287 INFO L85 PathProgramCache]: Analyzing trace with hash -507544089, now seen corresponding path program 1 times [2025-01-09 10:29:10,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:29:10,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891152860] [2025-01-09 10:29:10,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:10,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:29:10,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 10:29:10,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 10:29:10,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:10,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:29:10,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:29:10,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891152860] [2025-01-09 10:29:10,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891152860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:29:10,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:29:10,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:29:10,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586627168] [2025-01-09 10:29:10,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:29:10,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:29:10,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:29:10,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:29:10,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:29:10,704 INFO L87 Difference]: Start difference. First operand 181 states and 277 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:29:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:29:10,978 INFO L93 Difference]: Finished difference Result 428 states and 657 transitions. [2025-01-09 10:29:10,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:29:10,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2025-01-09 10:29:10,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:29:10,981 INFO L225 Difference]: With dead ends: 428 [2025-01-09 10:29:10,981 INFO L226 Difference]: Without dead ends: 288 [2025-01-09 10:29:10,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:29:10,982 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 138 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:29:10,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 406 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:29:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-01-09 10:29:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 238. [2025-01-09 10:29:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 173 states have (on average 1.4335260115606936) internal successors, (248), 173 states have internal predecessors, (248), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:29:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 368 transitions. [2025-01-09 10:29:11,026 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 368 transitions. Word has length 138 [2025-01-09 10:29:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:29:11,027 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 368 transitions. [2025-01-09 10:29:11,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:29:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2025-01-09 10:29:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 10:29:11,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:29:11,030 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:29:11,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:29:11,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:29:11,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:29:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash -84842263, now seen corresponding path program 1 times [2025-01-09 10:29:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:29:11,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424935899] [2025-01-09 10:29:11,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:29:11,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 10:29:11,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 10:29:11,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:11,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 10:29:11,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:29:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424935899] [2025-01-09 10:29:11,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424935899] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:29:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527158965] [2025-01-09 10:29:11,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:11,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:29:11,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:29:11,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:29:11,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 10:29:11,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 10:29:11,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 10:29:11,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:11,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:11,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:29:11,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:29:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-01-09 10:29:11,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:29:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 10:29:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527158965] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:29:11,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:29:11,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 10:29:11,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534159520] [2025-01-09 10:29:11,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:29:11,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:29:11,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:29:11,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:29:11,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:29:11,796 INFO L87 Difference]: Start difference. First operand 238 states and 368 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-01-09 10:29:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:29:11,951 INFO L93 Difference]: Finished difference Result 398 states and 602 transitions. [2025-01-09 10:29:11,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:29:11,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 138 [2025-01-09 10:29:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:29:11,955 INFO L225 Difference]: With dead ends: 398 [2025-01-09 10:29:11,956 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 10:29:11,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:29:11,956 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 46 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:29:11,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 177 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:29:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 10:29:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 197. [2025-01-09 10:29:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 129 states have (on average 1.2790697674418605) internal successors, (165), 129 states have internal predecessors, (165), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:29:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 285 transitions. [2025-01-09 10:29:11,978 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 285 transitions. Word has length 138 [2025-01-09 10:29:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:29:11,978 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 285 transitions. [2025-01-09 10:29:11,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-01-09 10:29:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 285 transitions. [2025-01-09 10:29:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 10:29:11,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:29:11,979 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:29:11,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 10:29:12,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:29:12,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:29:12,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:29:12,184 INFO L85 PathProgramCache]: Analyzing trace with hash -913056803, now seen corresponding path program 1 times [2025-01-09 10:29:12,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:29:12,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762835898] [2025-01-09 10:29:12,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:12,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:29:12,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 10:29:12,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 10:29:12,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:12,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 10:29:12,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:29:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762835898] [2025-01-09 10:29:12,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762835898] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:29:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524766214] [2025-01-09 10:29:12,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:12,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:29:12,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:29:12,533 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:29:12,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 10:29:12,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 10:29:12,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 10:29:12,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:12,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:12,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 10:29:12,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:29:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 178 proven. 96 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-01-09 10:29:13,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:29:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 10:29:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524766214] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:29:13,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:29:13,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 15 [2025-01-09 10:29:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922413346] [2025-01-09 10:29:13,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:29:13,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:29:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:29:13,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:29:13,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:29:13,570 INFO L87 Difference]: Start difference. First operand 197 states and 285 transitions. Second operand has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 5 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2025-01-09 10:29:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:29:14,086 INFO L93 Difference]: Finished difference Result 365 states and 522 transitions. [2025-01-09 10:29:14,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:29:14,087 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 5 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 141 [2025-01-09 10:29:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:29:14,089 INFO L225 Difference]: With dead ends: 365 [2025-01-09 10:29:14,089 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 10:29:14,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2025-01-09 10:29:14,090 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 215 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:29:14,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 242 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:29:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 10:29:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 205. [2025-01-09 10:29:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 135 states have (on average 1.2518518518518518) internal successors, (169), 135 states have internal predecessors, (169), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:29:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 289 transitions. [2025-01-09 10:29:14,114 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 289 transitions. Word has length 141 [2025-01-09 10:29:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:29:14,115 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 289 transitions. [2025-01-09 10:29:14,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 5 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2025-01-09 10:29:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 289 transitions. [2025-01-09 10:29:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 10:29:14,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:29:14,117 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:29:14,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 10:29:14,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:29:14,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:29:14,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:29:14,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1848577565, now seen corresponding path program 1 times [2025-01-09 10:29:14,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:29:14,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284611818] [2025-01-09 10:29:14,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:14,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:29:14,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 10:29:14,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 10:29:14,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:14,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 10:29:14,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148008643] [2025-01-09 10:29:14,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:14,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:29:14,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:29:14,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:29:14,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 10:29:14,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 10:29:14,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 10:29:14,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:14,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:14,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 10:29:14,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:29:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 178 proven. 96 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-01-09 10:29:15,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:29:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 10:29:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:29:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284611818] [2025-01-09 10:29:15,576 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 10:29:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148008643] [2025-01-09 10:29:15,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148008643] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:29:15,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:29:15,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2025-01-09 10:29:15,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543202927] [2025-01-09 10:29:15,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:29:15,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 10:29:15,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:29:15,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 10:29:15,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:29:15,578 INFO L87 Difference]: Start difference. First operand 205 states and 289 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 4 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-01-09 10:29:16,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:29:16,245 INFO L93 Difference]: Finished difference Result 373 states and 524 transitions. [2025-01-09 10:29:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:29:16,246 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 4 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 142 [2025-01-09 10:29:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:29:16,248 INFO L225 Difference]: With dead ends: 373 [2025-01-09 10:29:16,248 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 10:29:16,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-01-09 10:29:16,249 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 128 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:29:16,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 295 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:29:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 10:29:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 205. [2025-01-09 10:29:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 135 states have (on average 1.237037037037037) internal successors, (167), 135 states have internal predecessors, (167), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:29:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2025-01-09 10:29:16,264 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 142 [2025-01-09 10:29:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:29:16,265 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2025-01-09 10:29:16,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 4 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-01-09 10:29:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2025-01-09 10:29:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 10:29:16,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:29:16,266 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:29:16,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 10:29:16,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 10:29:16,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:29:16,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:29:16,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1858976030, now seen corresponding path program 1 times [2025-01-09 10:29:16,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:29:16,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677128952] [2025-01-09 10:29:16,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:16,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:29:16,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 10:29:16,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 10:29:16,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:16,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 10:29:16,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665317422] [2025-01-09 10:29:16,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:16,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:29:16,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:29:16,551 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:29:16,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 10:29:16,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 10:29:16,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 10:29:16,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:16,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:16,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 10:29:16,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:29:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 247 proven. 195 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-01-09 10:29:17,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:29:44,936 WARN L286 SmtUtils]: Spent 7.96s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 10:29:54,425 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse6 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse6 1)) (.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse4 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse3 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (forall ((v_z_13 Int)) (or (< v_z_13 .cse1) (< v_z_13 .cse3) (not (= (mod (* v_z_13 .cse2) 4294967296) v_z_13)) (< .cse4 v_z_13))) (or (not (= .cse5 .cse0)) (< .cse6 .cse0)) (or (< .cse4 .cse5) (< .cse5 .cse3) (< .cse6 .cse5)))))) is different from false [2025-01-09 10:30:04,968 WARN L286 SmtUtils]: Spent 10.37s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 10:30:23,225 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 10:30:27,255 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse3 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse6 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse6 1)) (.cse4 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse0 (mod c_~var_1_17~0 65536)) (.cse2 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse3) 4294967296))) (and (forall ((v_z_13 Int)) (or (< .cse0 v_z_13) (< v_z_13 .cse1) (< v_z_13 .cse2) (not (= (mod (* v_z_13 .cse3) 4294967296) v_z_13)))) (or (< .cse4 .cse1) (not (= (mod (* .cse3 .cse4) 4294967296) .cse4))) (or (not (= .cse5 .cse4)) (< .cse6 .cse4)) (or (< .cse0 .cse5) (< .cse5 .cse2) (< .cse6 .cse5)))))) is different from false [2025-01-09 10:30:34,726 WARN L286 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)