./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.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-70.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 c629da573e004159921914643ea74746a2df9f21fcd6971058637a927e2b9e2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:30:51,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:30:51,334 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:30:51,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:30:51,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:30:51,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:30:51,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:30:51,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:30:51,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:30:51,362 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:30:51,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:30:51,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:30:51,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:30:51,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:30:51,364 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:30:51,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:30:51,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:30:51,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:30:51,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:30:51,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:30:51,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:30:51,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:30:51,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:30:51,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:30:51,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:30:51,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:30:51,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:30:51,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:30:51,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:30:51,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:30:51,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:30:51,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:30:51,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:30:51,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:30:51,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:30:51,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:30:51,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:30:51,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:30:51,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:30:51,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:30:51,367 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:30:51,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:30:51,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:30:51,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:30:51,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:30:51,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:30:51,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:30:51,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:30:51,368 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 -> c629da573e004159921914643ea74746a2df9f21fcd6971058637a927e2b9e2c [2025-01-09 10:30:51,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:30:51,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:30:51,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:30:51,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:30:51,612 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:30:51,613 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-70.i [2025-01-09 10:30:52,742 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d548e8251/791e9a39476145bc9d17998542de8c27/FLAG334c2911f [2025-01-09 10:30:52,945 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:30:52,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2025-01-09 10:30:52,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d548e8251/791e9a39476145bc9d17998542de8c27/FLAG334c2911f [2025-01-09 10:30:53,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d548e8251/791e9a39476145bc9d17998542de8c27 [2025-01-09 10:30:53,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:30:53,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:30:53,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:30:53,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:30:53,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:30:53,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53, skipping insertion in model container [2025-01-09 10:30:53,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:30:53,418 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-70.i[919,932] [2025-01-09 10:30:53,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:30:53,468 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:30:53,475 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-70.i[919,932] [2025-01-09 10:30:53,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:30:53,506 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:30:53,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53 WrapperNode [2025-01-09 10:30:53,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:30:53,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:30:53,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:30:53,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:30:53,514 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:30:53" (1/1) ... [2025-01-09 10:30:53,523 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:30:53" (1/1) ... [2025-01-09 10:30:53,560 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-01-09 10:30:53,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:30:53,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:30:53,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:30:53,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:30:53,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,597 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:30:53,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:30:53,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:30:53,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:30:53,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:30:53,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53" (1/1) ... [2025-01-09 10:30:53,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:30:53,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:30:53,652 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:30:53,655 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:30:53,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:30:53,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:30:53,673 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:30:53,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:30:53,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:30:53,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:30:53,737 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:30:53,739 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:30:54,102 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 10:30:54,102 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:30:54,110 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:30:54,111 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:30:54,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:30:54 BoogieIcfgContainer [2025-01-09 10:30:54,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:30:54,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:30:54,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:30:54,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:30:54,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:30:53" (1/3) ... [2025-01-09 10:30:54,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b99426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:30:54, skipping insertion in model container [2025-01-09 10:30:54,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:30:53" (2/3) ... [2025-01-09 10:30:54,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b99426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:30:54, skipping insertion in model container [2025-01-09 10:30:54,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:30:54" (3/3) ... [2025-01-09 10:30:54,119 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2025-01-09 10:30:54,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:30:54,132 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:30:54,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:30:54,176 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;@7a5497f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:30:54,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:30:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 10:30:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 10:30:54,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:30:54,186 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:54,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:30:54,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:30:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1867039532, now seen corresponding path program 1 times [2025-01-09 10:30:54,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:30:54,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477711095] [2025-01-09 10:30:54,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:30:54,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:30:54,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 10:30:54,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 10:30:54,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:30:54,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:30:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 10:30:54,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:30:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477711095] [2025-01-09 10:30:54,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477711095] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:30:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514145597] [2025-01-09 10:30:54,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:30:54,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:30:54,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:30:54,406 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:30:54,406 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:30:54,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 10:30:54,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 10:30:54,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:30:54,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:30:54,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:30:54,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:30:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 10:30:54,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:30:54,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514145597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:30:54,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:30:54,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:30:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056723043] [2025-01-09 10:30:54,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:30:54,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:30:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:30:54,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:30:54,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:30:54,593 INFO L87 Difference]: Start difference. First operand has 69 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 10:30:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:30:54,612 INFO L93 Difference]: Finished difference Result 132 states and 224 transitions. [2025-01-09 10:30:54,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:30:54,613 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2025-01-09 10:30:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:30:54,617 INFO L225 Difference]: With dead ends: 132 [2025-01-09 10:30:54,617 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 10:30:54,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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:30:54,621 INFO L435 NwaCegarLoop]: 101 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, 101 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:30:54,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:30:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 10:30:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-09 10:30:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 49 states have internal predecessors, (71), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 10:30:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 101 transitions. [2025-01-09 10:30:54,645 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 101 transitions. Word has length 108 [2025-01-09 10:30:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:30:54,645 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 101 transitions. [2025-01-09 10:30:54,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 10:30:54,645 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 101 transitions. [2025-01-09 10:30:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 10:30:54,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:30:54,648 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:54,654 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:30:54,849 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:30:54,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:30:54,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:30:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash -236072784, now seen corresponding path program 1 times [2025-01-09 10:30:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:30:54,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927980885] [2025-01-09 10:30:54,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:30:54,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:30:54,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 10:30:54,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 10:30:54,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:30:54,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:30:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 10:30:55,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:30:55,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927980885] [2025-01-09 10:30:55,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927980885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:30:55,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:30:55,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:30:55,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386534775] [2025-01-09 10:30:55,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:30:55,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:30:55,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:30:55,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:30:55,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:30:55,051 INFO L87 Difference]: Start difference. First operand 66 states and 101 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:30:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:30:55,105 INFO L93 Difference]: Finished difference Result 171 states and 261 transitions. [2025-01-09 10:30:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:30:55,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2025-01-09 10:30:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:30:55,115 INFO L225 Difference]: With dead ends: 171 [2025-01-09 10:30:55,115 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 10:30:55,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:30:55,116 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 53 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:30:55,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 179 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:30:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 10:30:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2025-01-09 10:30:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 85 states have internal predecessors, (124), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 10:30:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 160 transitions. [2025-01-09 10:30:55,127 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 160 transitions. Word has length 108 [2025-01-09 10:30:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:30:55,128 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 160 transitions. [2025-01-09 10:30:55,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:30:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 160 transitions. [2025-01-09 10:30:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 10:30:55,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:30:55,133 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:55,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:30:55,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:30:55,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:30:55,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1925016526, now seen corresponding path program 1 times [2025-01-09 10:30:55,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:30:55,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50577909] [2025-01-09 10:30:55,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:30:55,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:30:55,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 10:30:55,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 10:30:55,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:30:55,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:30:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 10:30:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:30:57,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50577909] [2025-01-09 10:30:57,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50577909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:30:57,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:30:57,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 10:30:57,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136690769] [2025-01-09 10:30:57,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:30:57,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:30:57,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:30:57,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:30:57,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:30:57,187 INFO L87 Difference]: Start difference. First operand 105 states and 160 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:30:57,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:30:57,893 INFO L93 Difference]: Finished difference Result 432 states and 636 transitions. [2025-01-09 10:30:57,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:30:57,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2025-01-09 10:30:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:30:57,899 INFO L225 Difference]: With dead ends: 432 [2025-01-09 10:30:57,900 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 10:30:57,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:30:57,902 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 379 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:30:57,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 325 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:30:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 10:30:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 242. [2025-01-09 10:30:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 197 states have internal predecessors, (284), 41 states have call successors, (41), 6 states have call predecessors, (41), 6 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 10:30:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 366 transitions. [2025-01-09 10:30:57,954 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 366 transitions. Word has length 108 [2025-01-09 10:30:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:30:57,954 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 366 transitions. [2025-01-09 10:30:57,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:30:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 366 transitions. [2025-01-09 10:30:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 10:30:57,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:30:57,958 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:57,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:30:57,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:30:57,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:30:57,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1223951948, now seen corresponding path program 1 times [2025-01-09 10:30:57,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:30:57,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876854302] [2025-01-09 10:30:57,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:30:57,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:30:57,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 10:30:58,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 10:30:58,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:30:58,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:30:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 10:30:58,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:30:58,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876854302] [2025-01-09 10:30:58,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876854302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:30:58,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:30:58,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:30:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982814439] [2025-01-09 10:30:58,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:30:58,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:30:58,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:30:58,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:30:58,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:30:58,185 INFO L87 Difference]: Start difference. First operand 242 states and 366 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:30:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:30:58,294 INFO L93 Difference]: Finished difference Result 661 states and 985 transitions. [2025-01-09 10:30:58,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:30:58,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2025-01-09 10:30:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:30:58,297 INFO L225 Difference]: With dead ends: 661 [2025-01-09 10:30:58,297 INFO L226 Difference]: Without dead ends: 422 [2025-01-09 10:30:58,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:30:58,302 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 178 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:30:58,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 400 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:30:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-01-09 10:30:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 384. [2025-01-09 10:30:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 301 states have (on average 1.4252491694352158) internal successors, (429), 303 states have internal predecessors, (429), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 10:30:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 569 transitions. [2025-01-09 10:30:58,351 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 569 transitions. Word has length 108 [2025-01-09 10:30:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:30:58,353 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 569 transitions. [2025-01-09 10:30:58,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:30:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 569 transitions. [2025-01-09 10:30:58,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 10:30:58,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:30:58,354 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:58,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:30:58,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:30:58,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:30:58,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1783144756, now seen corresponding path program 1 times [2025-01-09 10:30:58,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:30:58,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534437312] [2025-01-09 10:30:58,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:30:58,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:30:58,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 10:30:58,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 10:30:58,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:30:58,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:30:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 10:30:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:30:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534437312] [2025-01-09 10:30:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534437312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:30:58,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:30:58,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:30:58,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466467] [2025-01-09 10:30:58,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:30:58,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:30:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:30:58,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:30:58,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:30:58,923 INFO L87 Difference]: Start difference. First operand 384 states and 569 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:30:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:30:59,182 INFO L93 Difference]: Finished difference Result 928 states and 1376 transitions. [2025-01-09 10:30:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:30:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2025-01-09 10:30:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:30:59,187 INFO L225 Difference]: With dead ends: 928 [2025-01-09 10:30:59,189 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 10:30:59,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:30:59,191 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 153 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:30:59,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 347 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:30:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 10:30:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 442. [2025-01-09 10:30:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 342 states have (on average 1.409356725146199) internal successors, (482), 344 states have internal predecessors, (482), 85 states have call successors, (85), 14 states have call predecessors, (85), 14 states have return successors, (85), 83 states have call predecessors, (85), 85 states have call successors, (85) [2025-01-09 10:30:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 652 transitions. [2025-01-09 10:30:59,238 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 652 transitions. Word has length 108 [2025-01-09 10:30:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:30:59,240 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 652 transitions. [2025-01-09 10:30:59,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:30:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 652 transitions. [2025-01-09 10:30:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 10:30:59,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:30:59,241 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:59,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:30:59,241 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:30:59,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:30:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1810757962, now seen corresponding path program 1 times [2025-01-09 10:30:59,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:30:59,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129968247] [2025-01-09 10:30:59,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:30:59,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:30:59,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 10:30:59,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 10:30:59,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:30:59,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:30:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 10:30:59,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:30:59,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129968247] [2025-01-09 10:30:59,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129968247] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:30:59,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694410502] [2025-01-09 10:30:59,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:30:59,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:30:59,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:30:59,414 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:30:59,416 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:30:59,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 10:30:59,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 10:30:59,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:30:59,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:30:59,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:30:59,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:30:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 10:30:59,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:30:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 10:30:59,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694410502] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:30:59,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:30:59,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 10:30:59,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53252516] [2025-01-09 10:30:59,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:30:59,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:30:59,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:30:59,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:30:59,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:30:59,754 INFO L87 Difference]: Start difference. First operand 442 states and 652 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:30:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:30:59,882 INFO L93 Difference]: Finished difference Result 718 states and 1042 transitions. [2025-01-09 10:30:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:30:59,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 108 [2025-01-09 10:30:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:30:59,885 INFO L225 Difference]: With dead ends: 718 [2025-01-09 10:30:59,885 INFO L226 Difference]: Without dead ends: 327 [2025-01-09 10:30:59,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:30:59,886 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 120 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:30:59,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 189 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:30:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-01-09 10:30:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 187. [2025-01-09 10:30:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 132 states have (on average 1.2878787878787878) internal successors, (170), 132 states have internal predecessors, (170), 45 states have call successors, (45), 9 states have call predecessors, (45), 9 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 10:30:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 260 transitions. [2025-01-09 10:30:59,907 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 260 transitions. Word has length 108 [2025-01-09 10:30:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:30:59,908 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 260 transitions. [2025-01-09 10:30:59,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:30:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 260 transitions. [2025-01-09 10:30:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 10:30:59,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:30:59,909 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:59,916 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:31:00,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:31:00,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:31:00,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:31:00,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1124355657, now seen corresponding path program 1 times [2025-01-09 10:31:00,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:31:00,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538968748] [2025-01-09 10:31:00,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:31:00,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:31:00,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 10:31:00,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 10:31:00,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:00,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:31:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 10:31:00,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:31:00,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538968748] [2025-01-09 10:31:00,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538968748] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:31:00,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548853519] [2025-01-09 10:31:00,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:31:00,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:31:00,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:31:00,738 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:31:00,740 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:31:00,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 10:31:00,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 10:31:00,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:00,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:31:00,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 10:31:00,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:31:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 173 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 10:31:01,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:31:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 66 proven. 15 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-09 10:31:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548853519] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:31:02,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:31:02,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 28 [2025-01-09 10:31:02,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29026899] [2025-01-09 10:31:02,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:31:02,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 10:31:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:31:02,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 10:31:02,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2025-01-09 10:31:02,873 INFO L87 Difference]: Start difference. First operand 187 states and 260 transitions. Second operand has 28 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 26 states have internal predecessors, (93), 8 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) [2025-01-09 10:31:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:31:07,315 INFO L93 Difference]: Finished difference Result 920 states and 1248 transitions. [2025-01-09 10:31:07,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-01-09 10:31:07,316 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 26 states have internal predecessors, (93), 8 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) Word has length 109 [2025-01-09 10:31:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:31:07,322 INFO L225 Difference]: With dead ends: 920 [2025-01-09 10:31:07,322 INFO L226 Difference]: Without dead ends: 781 [2025-01-09 10:31:07,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1393, Invalid=5413, Unknown=0, NotChecked=0, Total=6806 [2025-01-09 10:31:07,325 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1290 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:31:07,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 964 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 10:31:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-01-09 10:31:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 448. [2025-01-09 10:31:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 318 states have (on average 1.2452830188679245) internal successors, (396), 320 states have internal predecessors, (396), 99 states have call successors, (99), 30 states have call predecessors, (99), 30 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 10:31:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 594 transitions. [2025-01-09 10:31:07,406 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 594 transitions. Word has length 109 [2025-01-09 10:31:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:31:07,406 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 594 transitions. [2025-01-09 10:31:07,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 26 states have internal predecessors, (93), 8 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) [2025-01-09 10:31:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 594 transitions. [2025-01-09 10:31:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 10:31:07,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:31:07,407 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:07,416 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:31:07,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:31:07,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:31:07,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:31:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash 103287303, now seen corresponding path program 1 times [2025-01-09 10:31:07,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:31:07,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185119131] [2025-01-09 10:31:07,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:31:07,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:31:07,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 10:31:07,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 10:31:07,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:07,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 10:31:07,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184078559] [2025-01-09 10:31:07,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:31:07,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:31:07,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:31:07,706 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:31:07,708 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:31:07,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 10:31:07,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 10:31:07,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:07,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:31:07,868 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 10:31:07,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 10:31:07,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 10:31:07,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:07,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:31:07,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 10:31:07,976 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 10:31:07,977 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 10:31:07,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 10:31:08,179 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,SelfDestructingSolverStorable7 [2025-01-09 10:31:08,181 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:31:08,251 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 10:31:08,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:31:08 BoogieIcfgContainer [2025-01-09 10:31:08,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 10:31:08,257 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 10:31:08,257 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 10:31:08,257 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 10:31:08,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:30:54" (3/4) ... [2025-01-09 10:31:08,260 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 10:31:08,260 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 10:31:08,261 INFO L158 Benchmark]: Toolchain (without parser) took 14948.40ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 128.8MB in the beginning and 122.1MB in the end (delta: 6.7MB). Peak memory consumption was 170.7MB. Max. memory is 16.1GB. [2025-01-09 10:31:08,262 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 192.9MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:31:08,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.37ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 113.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 10:31:08,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.66ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 109.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:31:08,262 INFO L158 Benchmark]: Boogie Preprocessor took 62.55ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 104.2MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 10:31:08,263 INFO L158 Benchmark]: RCFGBuilder took 485.45ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 78.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 10:31:08,263 INFO L158 Benchmark]: TraceAbstraction took 14143.70ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 78.2MB in the beginning and 122.2MB in the end (delta: -44.0MB). Peak memory consumption was 120.4MB. Max. memory is 16.1GB. [2025-01-09 10:31:08,263 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 335.5MB. Free memory was 122.2MB in the beginning and 122.1MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:31:08,264 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 192.9MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.37ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 113.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.66ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 109.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.55ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 104.2MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 485.45ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 78.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14143.70ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 78.2MB in the beginning and 122.2MB in the end (delta: -44.0MB). Peak memory consumption was 120.4MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 335.5MB. Free memory was 122.2MB in the beginning and 122.1MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] unsigned short int var_1_21 = 25; [L38] unsigned char var_1_27 = 1; [L39] unsigned char var_1_31 = 1; [L40] unsigned long int var_1_33 = 2; [L41] unsigned short int var_1_34 = 0; [L42] signed short int var_1_35 = -10; [L43] unsigned char var_1_40 = 2; [L44] unsigned short int var_1_42 = 8; [L45] unsigned long int var_1_44 = 1249494912; [L46] double last_1_var_1_1 = 5.05; [L47] unsigned short int last_1_var_1_9 = 1; [L48] unsigned long int last_1_var_1_11 = 8; [L49] unsigned char last_1_var_1_14 = 32; [L50] unsigned char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L161] isInitial = 1 [L162] FCALL initially() [L164] CALL updateLastVariables() [L150] last_1_var_1_1 = var_1_1 [L151] last_1_var_1_9 = var_1_9 [L152] last_1_var_1_11 = var_1_11 [L153] last_1_var_1_14 = var_1_14 [L154] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L164] RET updateLastVariables() [L165] CALL updateVariables() [L124] var_1_6 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L125] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L126] var_1_7 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L127] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L128] var_1_8 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L129] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L130] var_1_13 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L131] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L132] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L133] var_1_15 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L134] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L135] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L136] var_1_16 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L137] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L138] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L139] var_1_17 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L140] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L141] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L142] var_1_19 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L143] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L144] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L145] var_1_44 = __VERIFIER_nondet_ulong() [L146] CALL assume_abort_if_not(var_1_44 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L146] RET assume_abort_if_not(var_1_44 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L147] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=2, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L165] RET updateVariables() [L166] CALL step() [L54] COND TRUE \read(var_1_13) [L55] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L59] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L68] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L69] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L73] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L74] COND FALSE !(var_1_18 >= stepLocal_0) [L77] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L79] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L80] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L82] COND TRUE \read(var_1_20) [L83] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L85] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L86] COND FALSE !(((((var_1_9) < (var_1_14)) ? (var_1_9) : (var_1_14))) > var_1_18) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L89] COND FALSE !((var_1_15 <= var_1_9) && var_1_20) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L100] COND TRUE var_1_17 > (- var_1_17) [L101] var_1_31 = (var_1_13 && var_1_13) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L103] var_1_33 = var_1_15 [L104] var_1_34 = (var_1_14 + 4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=126, var_1_34=257, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L105] COND FALSE !(((var_1_7 - var_1_6) + var_1_6) == var_1_8) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=126, var_1_34=257, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L108] COND TRUE var_1_18 >= (~ var_1_19) [L109] var_1_40 = var_1_16 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=126, var_1_34=257, var_1_35=-10, var_1_40=127, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L111] COND TRUE \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=126, var_1_34=257, var_1_35=-10, var_1_40=127, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L112] COND FALSE !(var_1_19 < 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=126, var_1_34=257, var_1_35=-10, var_1_40=127, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=126, var_1_34=257, var_1_35=-10, var_1_40=127, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=126, var_1_34=257, var_1_35=-10, var_1_40=127, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=253, var_1_15=126, var_1_16=127, var_1_17=254, var_1_18=7516192757, var_1_19=7516192766, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=126, var_1_34=257, var_1_35=-10, var_1_40=127, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 8, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2189 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2173 mSDsluCounter, 2505 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1752 mSDsCounter, 693 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2131 IncrementalHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 693 mSolverCounterUnsat, 753 mSDtfsCounter, 2131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 664 GetRequests, 555 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2092 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=448occurred in iteration=7, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 707 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1300 NumberOfCodeBlocks, 1300 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1287 ConstructedInterpolants, 0 QuantifiedInterpolants, 7151 SizeOfPredicates, 7 NumberOfNonLiveVariables, 857 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 4877/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 10:31:08,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-70.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c629da573e004159921914643ea74746a2df9f21fcd6971058637a927e2b9e2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:31:10,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:31:10,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 10:31:10,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:31:10,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:31:10,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:31:10,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:31:10,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:31:10,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:31:10,245 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:31:10,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:31:10,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:31:10,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:31:10,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:31:10,245 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:31:10,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:31:10,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:31:10,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:31:10,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:31:10,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:31:10,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:31:10,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:31:10,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:31:10,247 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 10:31:10,247 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 10:31:10,247 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 10:31:10,248 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:31:10,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:31:10,248 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:31:10,248 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:31:10,248 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:31:10,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:31:10,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:31:10,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:31:10,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:31:10,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:31:10,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:31:10,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:31:10,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:31:10,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:31:10,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:31:10,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:31:10,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:31:10,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:31:10,250 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 10:31:10,250 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 10:31:10,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:31:10,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:31:10,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:31:10,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:31:10,251 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 -> c629da573e004159921914643ea74746a2df9f21fcd6971058637a927e2b9e2c [2025-01-09 10:31:10,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:31:10,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:31:10,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:31:10,588 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:31:10,588 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:31:10,589 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-70.i [2025-01-09 10:31:11,755 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/681a9be56/d402471461f24b8bb2b31c4d8b27dbce/FLAGdbacbf21b [2025-01-09 10:31:11,973 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:31:11,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2025-01-09 10:31:11,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/681a9be56/d402471461f24b8bb2b31c4d8b27dbce/FLAGdbacbf21b [2025-01-09 10:31:11,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/681a9be56/d402471461f24b8bb2b31c4d8b27dbce [2025-01-09 10:31:11,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:31:12,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:31:12,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:31:12,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:31:12,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:31:12,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:31:11" (1/1) ... [2025-01-09 10:31:12,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad6b9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12, skipping insertion in model container [2025-01-09 10:31:12,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:31:11" (1/1) ... [2025-01-09 10:31:12,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:31:12,133 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-70.i[919,932] [2025-01-09 10:31:12,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:31:12,195 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:31:12,204 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-70.i[919,932] [2025-01-09 10:31:12,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:31:12,258 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:31:12,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12 WrapperNode [2025-01-09 10:31:12,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:31:12,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:31:12,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:31:12,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:31:12,267 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:31:12" (1/1) ... [2025-01-09 10:31:12,279 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:31:12" (1/1) ... [2025-01-09 10:31:12,305 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2025-01-09 10:31:12,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:31:12,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:31:12,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:31:12,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:31:12,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12" (1/1) ... [2025-01-09 10:31:12,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12" (1/1) ... [2025-01-09 10:31:12,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12" (1/1) ... [2025-01-09 10:31:12,335 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:31:12,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12" (1/1) ... [2025-01-09 10:31:12,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12" (1/1) ... [2025-01-09 10:31:12,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12" (1/1) ... [2025-01-09 10:31:12,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12" (1/1) ... [2025-01-09 10:31:12,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12" (1/1) ... [2025-01-09 10:31:12,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12" (1/1) ... [2025-01-09 10:31:12,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12" (1/1) ... [2025-01-09 10:31:12,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:31:12,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:31:12,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:31:12,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:31:12,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12" (1/1) ... [2025-01-09 10:31:12,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:31:12,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:31:12,397 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:31:12,400 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:31:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:31:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 10:31:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:31:12,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:31:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:31:12,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:31:12,475 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:31:12,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:31:20,093 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 10:31:20,093 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:31:20,099 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:31:20,099 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:31:20,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:31:20 BoogieIcfgContainer [2025-01-09 10:31:20,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:31:20,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:31:20,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:31:20,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:31:20,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:31:11" (1/3) ... [2025-01-09 10:31:20,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5783e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:31:20, skipping insertion in model container [2025-01-09 10:31:20,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:12" (2/3) ... [2025-01-09 10:31:20,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5783e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:31:20, skipping insertion in model container [2025-01-09 10:31:20,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:31:20" (3/3) ... [2025-01-09 10:31:20,108 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2025-01-09 10:31:20,118 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:31:20,119 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:31:20,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:31:20,170 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;@13b0222c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:31:20,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:31:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 45 states have (on average 1.488888888888889) internal successors, (67), 46 states have internal predecessors, (67), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 10:31:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 10:31:20,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:31:20,182 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:20,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:31:20,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:31:20,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1430505828, now seen corresponding path program 1 times [2025-01-09 10:31:20,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:31:20,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439912116] [2025-01-09 10:31:20,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:31:20,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:31:20,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:31:20,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:31:20,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 10:31:20,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 10:31:20,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 10:31:20,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:20,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:31:20,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:31:20,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:31:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 10:31:20,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:31:20,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:31:20,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439912116] [2025-01-09 10:31:20,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439912116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:31:20,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:31:20,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:31:20,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923578885] [2025-01-09 10:31:20,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:31:20,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:31:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:31:20,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:31:20,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:31:20,695 INFO L87 Difference]: Start difference. First operand has 63 states, 45 states have (on average 1.488888888888889) internal successors, (67), 46 states have internal predecessors, (67), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:31:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:31:20,715 INFO L93 Difference]: Finished difference Result 120 states and 204 transitions. [2025-01-09 10:31:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:31:20,716 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2025-01-09 10:31:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:31:20,721 INFO L225 Difference]: With dead ends: 120 [2025-01-09 10:31:20,722 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 10:31:20,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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:31:20,727 INFO L435 NwaCegarLoop]: 90 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, 90 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:31:20,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:31:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 10:31:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 10:31:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 10:31:20,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2025-01-09 10:31:20,755 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 108 [2025-01-09 10:31:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:31:20,756 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2025-01-09 10:31:20,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:31:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2025-01-09 10:31:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 10:31:20,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:31:20,759 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:20,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 10:31:20,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:31:20,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:31:20,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:31:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash -672606488, now seen corresponding path program 1 times [2025-01-09 10:31:20,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:31:20,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658822939] [2025-01-09 10:31:20,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:31:20,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:31:20,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:31:20,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:31:20,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 10:31:21,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 10:31:21,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 10:31:21,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:21,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:31:21,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 10:31:21,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:31:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 10:31:23,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:31:24,161 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:31:24,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658822939] [2025-01-09 10:31:24,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658822939] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:31:24,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [724134866] [2025-01-09 10:31:24,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:31:24,162 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 10:31:24,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 10:31:24,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 10:31:24,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 10:31:24,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 10:31:24,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 10:31:24,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:24,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:31:24,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 10:31:24,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:31:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 10:31:24,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:31:24,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [724134866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:31:24,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:31:24,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-01-09 10:31:24,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869326071] [2025-01-09 10:31:24,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:31:24,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:31:24,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:31:24,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:31:24,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:31:24,629 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:31:28,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:31:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:31:28,312 INFO L93 Difference]: Finished difference Result 153 states and 228 transitions. [2025-01-09 10:31:28,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:31:28,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2025-01-09 10:31:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:31:28,339 INFO L225 Difference]: With dead ends: 153 [2025-01-09 10:31:28,339 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 10:31:28,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:31:28,340 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:31:28,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 159 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-09 10:31:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 10:31:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2025-01-09 10:31:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 10:31:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 138 transitions. [2025-01-09 10:31:28,351 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 138 transitions. Word has length 108 [2025-01-09 10:31:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:31:28,353 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 138 transitions. [2025-01-09 10:31:28,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:31:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 138 transitions. [2025-01-09 10:31:28,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 10:31:28,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:31:28,355 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:28,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 10:31:28,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-01-09 10:31:28,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 10:31:28,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:31:28,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:31:28,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1933417066, now seen corresponding path program 1 times [2025-01-09 10:31:28,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:31:28,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744766892] [2025-01-09 10:31:28,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:31:28,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:31:28,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:31:28,759 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:31:28,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 10:31:28,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 10:31:29,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 10:31:29,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:29,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:31:29,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 10:31:29,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:31:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 10:31:29,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:31:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 10:31:29,863 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:31:29,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744766892] [2025-01-09 10:31:29,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744766892] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:31:29,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:31:29,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 10:31:29,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964494968] [2025-01-09 10:31:29,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:31:29,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:31:29,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:31:29,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:31:29,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:31:29,864 INFO L87 Difference]: Start difference. First operand 93 states and 138 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:31:32,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:31:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:31:32,653 INFO L93 Difference]: Finished difference Result 160 states and 232 transitions. [2025-01-09 10:31:32,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:31:32,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 108 [2025-01-09 10:31:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:31:32,679 INFO L225 Difference]: With dead ends: 160 [2025-01-09 10:31:32,679 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 10:31:32,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:31:32,680 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 51 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:31:32,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 159 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 10:31:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 10:31:32,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-01-09 10:31:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 10:31:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2025-01-09 10:31:32,686 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 108 [2025-01-09 10:31:32,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:31:32,686 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2025-01-09 10:31:32,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:31:32,686 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2025-01-09 10:31:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 10:31:32,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:31:32,688 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:32,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 10:31:32,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:31:32,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:31:32,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:31:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash 218547259, now seen corresponding path program 1 times [2025-01-09 10:31:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:31:32,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52248908] [2025-01-09 10:31:32,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:31:32,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:31:32,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:31:32,891 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:31:32,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 10:31:32,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 10:31:33,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 10:31:33,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:33,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:31:33,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 10:31:33,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:31:34,935 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 10:31:34,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:31:35,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:31:35,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52248908] [2025-01-09 10:31:35,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52248908] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:31:35,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1564081596] [2025-01-09 10:31:35,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:31:35,257 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 10:31:35,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 10:31:35,259 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 10:31:35,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-01-09 10:31:35,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 10:31:35,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 10:31:35,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:35,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:31:35,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 10:31:35,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:31:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 10:31:36,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:31:36,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1564081596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:31:36,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:31:36,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-01-09 10:31:36,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323821059] [2025-01-09 10:31:36,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:31:36,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:31:36,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:31:36,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:31:36,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:31:36,413 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:31:39,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:31:44,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:31:46,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:31:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:31:47,230 INFO L93 Difference]: Finished difference Result 257 states and 357 transitions. [2025-01-09 10:31:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:31:47,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-01-09 10:31:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:31:47,234 INFO L225 Difference]: With dead ends: 257 [2025-01-09 10:31:47,235 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 10:31:47,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:31:47,236 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 103 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:31:47,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 284 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2025-01-09 10:31:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 10:31:47,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 142. [2025-01-09 10:31:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 10:31:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 201 transitions. [2025-01-09 10:31:47,253 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 201 transitions. Word has length 109 [2025-01-09 10:31:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:31:47,253 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 201 transitions. [2025-01-09 10:31:47,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 10:31:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 201 transitions. [2025-01-09 10:31:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 10:31:47,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:31:47,257 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:47,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-01-09 10:31:47,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 10:31:47,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:31:47,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:31:47,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:31:47,659 INFO L85 PathProgramCache]: Analyzing trace with hash 476712697, now seen corresponding path program 1 times [2025-01-09 10:31:47,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:31:47,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020709398] [2025-01-09 10:31:47,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:31:47,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:31:47,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:31:47,661 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:31:47,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 10:31:47,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 10:31:47,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 10:31:47,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:47,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:31:48,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 10:31:48,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:31:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 10:31:49,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:31:49,709 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:31:49,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020709398] [2025-01-09 10:31:49,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020709398] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:31:49,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1999251099] [2025-01-09 10:31:49,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:31:49,709 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 10:31:49,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 10:31:49,711 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 10:31:49,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-01-09 10:31:49,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 10:31:50,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 10:31:50,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:31:50,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:31:50,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 10:31:50,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:31:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 10:31:51,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:31:51,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1999251099] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:31:51,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:31:51,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-01-09 10:31:51,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355403302] [2025-01-09 10:31:51,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:31:51,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:31:51,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:31:51,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:31:51,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:31:51,702 INFO L87 Difference]: Start difference. First operand 142 states and 201 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 10:31:55,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:31:59,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:32:01,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:32:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:02,561 INFO L93 Difference]: Finished difference Result 389 states and 543 transitions. [2025-01-09 10:32:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 10:32:02,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2025-01-09 10:32:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:02,564 INFO L225 Difference]: With dead ends: 389 [2025-01-09 10:32:02,564 INFO L226 Difference]: Without dead ends: 250 [2025-01-09 10:32:02,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2025-01-09 10:32:02,566 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 139 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:02,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 399 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2025-01-09 10:32:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-09 10:32:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 203. [2025-01-09 10:32:02,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 147 states have internal predecessors, (190), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 10:32:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 280 transitions. [2025-01-09 10:32:02,582 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 280 transitions. Word has length 109 [2025-01-09 10:32:02,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:02,583 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 280 transitions. [2025-01-09 10:32:02,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 10:32:02,583 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 280 transitions. [2025-01-09 10:32:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 10:32:02,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:02,584 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:02,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 10:32:02,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-01-09 10:32:02,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 10:32:02,985 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:02,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash -544355657, now seen corresponding path program 1 times [2025-01-09 10:32:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:32:02,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059124364] [2025-01-09 10:32:02,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:02,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:32:02,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:32:02,987 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:32:02,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 10:32:03,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 10:32:03,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 10:32:03,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:03,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:03,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 10:32:03,455 INFO L279 TraceCheckSpWp]: Computing forward predicates...