./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.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_fillercodesize_normal_file-13.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 4f1bba3d9f281d4d8bc08bca7bbe0ca52659ab0a02494d574b1e97e91dfbc45f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:02:32,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:02:32,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:02:32,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:02:32,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:02:32,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:02:32,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:02:32,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:02:32,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:02:32,368 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:02:32,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:02:32,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:02:32,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:02:32,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:02:32,369 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:02:32,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:02:32,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:02:32,369 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:02:32,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:02:32,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:02:32,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:02:32,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:02:32,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:02:32,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:02:32,370 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:02:32,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:02:32,370 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:02:32,370 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:02:32,370 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:02:32,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:02:32,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:02:32,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:02:32,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:02:32,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:02:32,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:02:32,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:02:32,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:02:32,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:02:32,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:02:32,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:02:32,372 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:02:32,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:02:32,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:02:32,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:02:32,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:02:32,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:02:32,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:02:32,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:02:32,372 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 -> 4f1bba3d9f281d4d8bc08bca7bbe0ca52659ab0a02494d574b1e97e91dfbc45f [2025-01-09 09:02:32,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:02:32,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:02:32,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:02:32,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:02:32,650 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:02:32,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i [2025-01-09 09:02:33,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e75e72295/d977aefa1c98429ab529ee83582eabde/FLAG8fb316351 [2025-01-09 09:02:34,042 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:02:34,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i [2025-01-09 09:02:34,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e75e72295/d977aefa1c98429ab529ee83582eabde/FLAG8fb316351 [2025-01-09 09:02:34,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e75e72295/d977aefa1c98429ab529ee83582eabde [2025-01-09 09:02:34,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:02:34,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:02:34,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:02:34,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:02:34,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:02:34,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb3e0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34, skipping insertion in model container [2025-01-09 09:02:34,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:02:34,516 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_fillercodesize_normal_file-13.i[913,926] [2025-01-09 09:02:34,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:02:34,585 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:02:34,595 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_fillercodesize_normal_file-13.i[913,926] [2025-01-09 09:02:34,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:02:34,639 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:02:34,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34 WrapperNode [2025-01-09 09:02:34,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:02:34,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:02:34,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:02:34,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:02:34,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,677 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2025-01-09 09:02:34,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:02:34,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:02:34,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:02:34,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:02:34,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,696 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 09:02:34,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:02:34,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:02:34,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:02:34,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:02:34,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (1/1) ... [2025-01-09 09:02:34,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:02:34,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:02:34,743 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 09:02:34,752 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 09:02:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:02:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:02:34,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:02:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:02:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:02:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:02:34,827 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:02:34,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:02:35,071 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 09:02:35,071 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:02:35,083 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:02:35,084 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:02:35,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:35 BoogieIcfgContainer [2025-01-09 09:02:35,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:02:35,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:02:35,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:02:35,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:02:35,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:02:34" (1/3) ... [2025-01-09 09:02:35,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e4d366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:35, skipping insertion in model container [2025-01-09 09:02:35,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:34" (2/3) ... [2025-01-09 09:02:35,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e4d366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:35, skipping insertion in model container [2025-01-09 09:02:35,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:35" (3/3) ... [2025-01-09 09:02:35,091 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-13.i [2025-01-09 09:02:35,102 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:02:35,103 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-13.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:02:35,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:02:35,158 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;@4f40ebdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:02:35,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:02:35,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 09:02:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 09:02:35,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:02:35,170 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:02:35,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:02:35,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:02:35,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1264182188, now seen corresponding path program 1 times [2025-01-09 09:02:35,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:02:35,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80791553] [2025-01-09 09:02:35,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:02:35,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:02:35,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 09:02:35,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 09:02:35,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:02:35,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:02:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 09:02:35,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:02:35,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80791553] [2025-01-09 09:02:35,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80791553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:02:35,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:02:35,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:02:35,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428881448] [2025-01-09 09:02:35,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:02:35,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:02:35,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:02:35,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:02:35,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:02:35,424 INFO L87 Difference]: Start difference. First operand has 68 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:02:35,463 INFO L93 Difference]: Finished difference Result 130 states and 217 transitions. [2025-01-09 09:02:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:02:35,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2025-01-09 09:02:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:02:35,473 INFO L225 Difference]: With dead ends: 130 [2025-01-09 09:02:35,473 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 09:02:35,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 09:02:35,479 INFO L435 NwaCegarLoop]: 95 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, 95 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 09:02:35,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:02:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 09:02:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-09 09:02:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 09:02:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2025-01-09 09:02:35,506 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 134 [2025-01-09 09:02:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:02:35,507 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2025-01-09 09:02:35,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2025-01-09 09:02:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 09:02:35,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:02:35,510 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:02:35,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 09:02:35,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:02:35,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:02:35,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1006016750, now seen corresponding path program 1 times [2025-01-09 09:02:35,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:02:35,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693717513] [2025-01-09 09:02:35,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:02:35,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:02:35,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 09:02:35,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 09:02:35,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:02:35,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:02:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 09:02:35,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:02:35,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693717513] [2025-01-09 09:02:35,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693717513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:02:35,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:02:35,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:02:35,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674225490] [2025-01-09 09:02:35,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:02:35,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:02:35,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:02:35,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:02:35,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:02:35,706 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:02:35,756 INFO L93 Difference]: Finished difference Result 161 states and 233 transitions. [2025-01-09 09:02:35,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:02:35,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2025-01-09 09:02:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:02:35,758 INFO L225 Difference]: With dead ends: 161 [2025-01-09 09:02:35,758 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 09:02:35,759 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 09:02:35,759 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 39 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:02:35,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 213 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:02:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 09:02:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-01-09 09:02:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 68 states have internal predecessors, (86), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 09:02:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-01-09 09:02:35,771 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 134 [2025-01-09 09:02:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:02:35,771 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-01-09 09:02:35,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-01-09 09:02:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 09:02:35,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:02:35,773 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:02:35,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:02:35,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:02:35,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:02:35,773 INFO L85 PathProgramCache]: Analyzing trace with hash -273846928, now seen corresponding path program 1 times [2025-01-09 09:02:35,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:02:35,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629441496] [2025-01-09 09:02:35,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:02:35,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:02:35,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 09:02:35,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 09:02:35,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:02:35,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:02:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 09:02:36,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:02:36,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629441496] [2025-01-09 09:02:36,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629441496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:02:36,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:02:36,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:02:36,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607069911] [2025-01-09 09:02:36,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:02:36,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:02:36,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:02:36,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:02:36,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:02:36,268 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:02:36,645 INFO L93 Difference]: Finished difference Result 271 states and 393 transitions. [2025-01-09 09:02:36,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:02:36,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2025-01-09 09:02:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:02:36,648 INFO L225 Difference]: With dead ends: 271 [2025-01-09 09:02:36,648 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 09:02:36,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:02:36,649 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 75 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:02:36,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 330 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:02:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 09:02:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2025-01-09 09:02:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 87 states have internal predecessors, (106), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 09:02:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 198 transitions. [2025-01-09 09:02:36,669 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 198 transitions. Word has length 134 [2025-01-09 09:02:36,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:02:36,669 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 198 transitions. [2025-01-09 09:02:36,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 198 transitions. [2025-01-09 09:02:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 09:02:36,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:02:36,673 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:02:36,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:02:36,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:02:36,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:02:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1431091539, now seen corresponding path program 1 times [2025-01-09 09:02:36,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:02:36,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078273832] [2025-01-09 09:02:36,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:02:36,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:02:36,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 09:02:36,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 09:02:36,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:02:36,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:02:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 09:02:36,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:02:36,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078273832] [2025-01-09 09:02:36,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078273832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:02:36,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:02:36,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:02:36,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873097124] [2025-01-09 09:02:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:02:36,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:02:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:02:36,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:02:36,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:02:36,770 INFO L87 Difference]: Start difference. First operand 136 states and 198 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:02:36,819 INFO L93 Difference]: Finished difference Result 268 states and 389 transitions. [2025-01-09 09:02:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:02:36,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2025-01-09 09:02:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:02:36,822 INFO L225 Difference]: With dead ends: 268 [2025-01-09 09:02:36,823 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 09:02:36,824 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 09:02:36,826 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 22 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:02:36,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 165 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:02:36,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 09:02:36,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 163. [2025-01-09 09:02:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 114 states have internal predecessors, (147), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 09:02:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2025-01-09 09:02:36,854 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 135 [2025-01-09 09:02:36,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:02:36,854 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2025-01-09 09:02:36,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2025-01-09 09:02:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 09:02:36,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:02:36,859 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:02:36,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:02:36,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:02:36,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:02:36,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1493755970, now seen corresponding path program 1 times [2025-01-09 09:02:36,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:02:36,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400334226] [2025-01-09 09:02:36,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:02:36,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:02:36,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 09:02:36,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 09:02:36,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:02:36,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:02:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 09:02:37,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:02:37,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400334226] [2025-01-09 09:02:37,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400334226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:02:37,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:02:37,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:02:37,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384916293] [2025-01-09 09:02:37,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:02:37,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:02:37,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:02:37,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:02:37,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:02:37,023 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:02:37,170 INFO L93 Difference]: Finished difference Result 349 states and 508 transitions. [2025-01-09 09:02:37,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:02:37,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2025-01-09 09:02:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:02:37,174 INFO L225 Difference]: With dead ends: 349 [2025-01-09 09:02:37,174 INFO L226 Difference]: Without dead ends: 229 [2025-01-09 09:02:37,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:02:37,176 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 95 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:02:37,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 177 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:02:37,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-01-09 09:02:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 173. [2025-01-09 09:02:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 123 states have (on average 1.2926829268292683) internal successors, (159), 124 states have internal predecessors, (159), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 09:02:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 251 transitions. [2025-01-09 09:02:37,205 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 251 transitions. Word has length 135 [2025-01-09 09:02:37,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:02:37,206 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 251 transitions. [2025-01-09 09:02:37,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 251 transitions. [2025-01-09 09:02:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 09:02:37,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:02:37,208 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:02:37,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:02:37,209 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:02:37,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:02:37,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2080561984, now seen corresponding path program 1 times [2025-01-09 09:02:37,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:02:37,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888146521] [2025-01-09 09:02:37,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:02:37,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:02:37,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 09:02:37,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 09:02:37,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:02:37,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:02:37,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899689152] [2025-01-09 09:02:37,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:02:37,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:02:37,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:02:37,310 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 09:02:37,334 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 09:02:37,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 09:02:37,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 09:02:37,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:02:37,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:02:37,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 09:02:37,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 09:02:37,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 09:02:37,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:02:37,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:02:37,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 09:02:37,636 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 09:02:37,636 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 09:02:37,647 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 09:02:37,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:02:37,844 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 09:02:37,922 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 09:02:37,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:02:37 BoogieIcfgContainer [2025-01-09 09:02:37,926 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 09:02:37,927 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 09:02:37,927 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 09:02:37,927 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 09:02:37,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:35" (3/4) ... [2025-01-09 09:02:37,929 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 09:02:37,930 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 09:02:37,930 INFO L158 Benchmark]: Toolchain (without parser) took 3554.80ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.7MB in the beginning and 115.6MB in the end (delta: -2.0MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2025-01-09 09:02:37,931 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:02:37,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.44ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 99.7MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:02:37,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.70ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 96.6MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:02:37,931 INFO L158 Benchmark]: Boogie Preprocessor took 29.57ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 92.0MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:02:37,931 INFO L158 Benchmark]: RCFGBuilder took 375.61ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 71.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 09:02:37,932 INFO L158 Benchmark]: TraceAbstraction took 2840.40ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 70.5MB in the beginning and 115.7MB in the end (delta: -45.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:02:37,932 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 176.2MB. Free memory was 115.7MB in the beginning and 115.6MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:02:37,933 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.15ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.44ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 99.7MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.70ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 96.6MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.57ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 92.0MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 375.61ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 71.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2840.40ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 70.5MB in the beginning and 115.7MB in the end (delta: -45.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 176.2MB. Free memory was 115.7MB in the beginning and 115.6MB in the end (delta: 27.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 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] signed short int last_1_var_1_21 = -64; [L43] unsigned char last_1_var_1_22 = 25; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L131] isInitial = 1 [L132] FCALL initially() [L134] CALL updateLastVariables() [L123] last_1_var_1_21 = var_1_21 [L124] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L134] RET updateLastVariables() [L135] CALL updateVariables() [L89] var_1_4 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L92] var_1_5 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L95] var_1_6 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L98] var_1_9 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L99] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L100] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L101] var_1_10 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L102] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L103] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L104] var_1_11 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L105] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L106] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L107] var_1_13 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L108] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L109] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L110] var_1_14 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L111] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L112] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L113] var_1_17 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L115] var_1_18 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L117] var_1_19 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L118] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L119] var_1_20 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L120] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L135] RET updateVariables() [L136] CALL step() [L47] signed long int stepLocal_1 = ~ last_1_var_1_21; [L48] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L49] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L49] COND TRUE stepLocal_1 != (last_1_var_1_22 >> var_1_4) [L50] COND TRUE stepLocal_0 || var_1_6 [L51] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L58] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L61] unsigned short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_3=0, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L62] COND FALSE !(var_1_4 > stepLocal_3) [L65] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L67] COND TRUE ((- var_1_11) < 8) || var_1_9 [L68] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L70] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L71] COND TRUE var_1_18 <= var_1_20 [L72] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L78] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L83] signed short int stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_2=-64, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L84] COND TRUE var_1_10 > stepLocal_2 [L85] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L127-L128] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 980 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 491 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 319 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 489 mSDtfsCounter, 319 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 113 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 942 NumberOfCodeBlocks, 942 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 667 ConstructedInterpolants, 0 QuantifiedInterpolants, 1848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3800/3800 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 09:02:37,947 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_fillercodesize_normal_file-13.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 4f1bba3d9f281d4d8bc08bca7bbe0ca52659ab0a02494d574b1e97e91dfbc45f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:02:40,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:02:40,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 09:02:40,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:02:40,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:02:40,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:02:40,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:02:40,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:02:40,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:02:40,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:02:40,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:02:40,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:02:40,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:02:40,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:02:40,176 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:02:40,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:02:40,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:02:40,176 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:02:40,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:02:40,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:02:40,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:02:40,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:02:40,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:02:40,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:02:40,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:02:40,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:02:40,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:02:40,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:02:40,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:02:40,178 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:02:40,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:02:40,178 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:02:40,178 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:02:40,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:02:40,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:02:40,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:02:40,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:02:40,178 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 -> 4f1bba3d9f281d4d8bc08bca7bbe0ca52659ab0a02494d574b1e97e91dfbc45f [2025-01-09 09:02:40,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:02:40,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:02:40,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:02:40,426 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:02:40,426 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:02:40,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i [2025-01-09 09:02:41,632 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec2272943/28325079809c4fb2ac147a0de611327e/FLAGe461e40b3 [2025-01-09 09:02:41,848 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:02:41,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i [2025-01-09 09:02:41,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec2272943/28325079809c4fb2ac147a0de611327e/FLAGe461e40b3 [2025-01-09 09:02:41,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec2272943/28325079809c4fb2ac147a0de611327e [2025-01-09 09:02:41,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:02:41,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:02:41,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:02:41,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:02:41,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:02:41,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:41" (1/1) ... [2025-01-09 09:02:41,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@86b7287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:41, skipping insertion in model container [2025-01-09 09:02:41,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:41" (1/1) ... [2025-01-09 09:02:41,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:02:42,010 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_fillercodesize_normal_file-13.i[913,926] [2025-01-09 09:02:42,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:02:42,085 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:02:42,093 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_fillercodesize_normal_file-13.i[913,926] [2025-01-09 09:02:42,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:02:42,142 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:02:42,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42 WrapperNode [2025-01-09 09:02:42,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:02:42,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:02:42,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:02:42,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:02:42,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,185 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-01-09 09:02:42,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:02:42,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:02:42,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:02:42,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:02:42,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,222 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 09:02:42,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:02:42,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:02:42,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:02:42,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:02:42,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (1/1) ... [2025-01-09 09:02:42,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:02:42,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:02:42,278 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 09:02:42,281 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 09:02:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:02:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:02:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:02:42,295 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:02:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:02:42,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:02:42,354 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:02:42,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:02:47,552 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 09:02:47,552 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:02:47,558 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:02:47,561 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:02:47,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:47 BoogieIcfgContainer [2025-01-09 09:02:47,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:02:47,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:02:47,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:02:47,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:02:47,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:02:41" (1/3) ... [2025-01-09 09:02:47,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de1e58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:47, skipping insertion in model container [2025-01-09 09:02:47,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:42" (2/3) ... [2025-01-09 09:02:47,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de1e58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:47, skipping insertion in model container [2025-01-09 09:02:47,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:47" (3/3) ... [2025-01-09 09:02:47,576 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-13.i [2025-01-09 09:02:47,589 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:02:47,591 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-13.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:02:47,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:02:47,641 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;@6ef08294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:02:47,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:02:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 09:02:47,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 09:02:47,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:02:47,651 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:02:47,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:02:47,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:02:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 780715921, now seen corresponding path program 1 times [2025-01-09 09:02:47,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:02:47,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384465471] [2025-01-09 09:02:47,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:02:47,663 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 09:02:47,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:02:47,667 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 09:02:47,668 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 09:02:47,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 09:02:47,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 09:02:47,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:02:47,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:02:47,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:02:47,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:02:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-01-09 09:02:48,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:02:48,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:02:48,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384465471] [2025-01-09 09:02:48,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384465471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:02:48,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:02:48,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:02:48,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812725455] [2025-01-09 09:02:48,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:02:48,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:02:48,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:02:48,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:02:48,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:02:48,041 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 09:02:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:02:48,057 INFO L93 Difference]: Finished difference Result 120 states and 203 transitions. [2025-01-09 09:02:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:02:48,058 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 131 [2025-01-09 09:02:48,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:02:48,062 INFO L225 Difference]: With dead ends: 120 [2025-01-09 09:02:48,063 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 09:02:48,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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 09:02:48,066 INFO L435 NwaCegarLoop]: 88 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, 88 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 09:02:48,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:02:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 09:02:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 09:02:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 09:02:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2025-01-09 09:02:48,094 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 131 [2025-01-09 09:02:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:02:48,094 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2025-01-09 09:02:48,094 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 09:02:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2025-01-09 09:02:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 09:02:48,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:02:48,097 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:02:48,107 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 09:02:48,300 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 09:02:48,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:02:48,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:02:48,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1352887927, now seen corresponding path program 1 times [2025-01-09 09:02:48,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:02:48,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404552239] [2025-01-09 09:02:48,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:02:48,304 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 09:02:48,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:02:48,309 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 09:02:48,310 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 09:02:48,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 09:02:48,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 09:02:48,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:02:48,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:02:48,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:02:48,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:02:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 09:02:49,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:02:49,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:02:49,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404552239] [2025-01-09 09:02:49,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404552239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:02:49,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:02:49,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:02:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775638910] [2025-01-09 09:02:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:02:49,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:02:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:02:49,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:02:49,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:02:49,623 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:52,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:02:54,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:02:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:02:54,873 INFO L93 Difference]: Finished difference Result 175 states and 259 transitions. [2025-01-09 09:02:54,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:02:54,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-01-09 09:02:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:02:54,895 INFO L225 Difference]: With dead ends: 175 [2025-01-09 09:02:54,895 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 09:02:54,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:02:54,896 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 55 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:02:54,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 282 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 09:02:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 09:02:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2025-01-09 09:02:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 09:02:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 146 transitions. [2025-01-09 09:02:54,916 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 146 transitions. Word has length 131 [2025-01-09 09:02:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:02:54,917 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 146 transitions. [2025-01-09 09:02:54,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 146 transitions. [2025-01-09 09:02:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 09:02:54,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:02:54,919 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:02:54,938 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 09:02:55,119 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 [2025-01-09 09:02:55,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:02:55,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:02:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2068005908, now seen corresponding path program 1 times [2025-01-09 09:02:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:02:55,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195193621] [2025-01-09 09:02:55,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:02:55,121 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 09:02:55,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:02:55,123 INFO L229 MonitoredProcess]: Starting monitored process 4 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 09:02:55,125 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 (4)] Waiting until timeout for monitored process [2025-01-09 09:02:55,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 09:02:55,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 09:02:55,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:02:55,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:02:55,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:02:55,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:02:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 09:02:55,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:02:55,467 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:02:55,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195193621] [2025-01-09 09:02:55,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195193621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:02:55,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:02:55,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:02:55,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898195836] [2025-01-09 09:02:55,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:02:55,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:02:55,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:02:55,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:02:55,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:02:55,471 INFO L87 Difference]: Start difference. First operand 99 states and 146 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:57,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:02:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:02:57,979 INFO L93 Difference]: Finished difference Result 187 states and 273 transitions. [2025-01-09 09:02:57,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:02:57,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2025-01-09 09:02:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:02:57,986 INFO L225 Difference]: With dead ends: 187 [2025-01-09 09:02:57,986 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 09:02:57,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 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 09:02:57,987 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 35 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:02:57,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 192 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 09:02:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 09:02:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2025-01-09 09:02:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 09:02:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2025-01-09 09:02:58,026 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 132 [2025-01-09 09:02:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:02:58,026 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2025-01-09 09:02:58,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:02:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2025-01-09 09:02:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 09:02:58,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:02:58,034 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:02:58,058 INFO L540 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 (4)] Forceful destruction successful, exit code 0 [2025-01-09 09:02:58,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 09:02:58,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:02:58,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:02:58,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1481199894, now seen corresponding path program 1 times [2025-01-09 09:02:58,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:02:58,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129808526] [2025-01-09 09:02:58,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:02:58,237 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 09:02:58,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:02:58,239 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 09:02:58,241 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 09:02:58,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 09:02:58,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 09:02:58,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:02:58,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:02:58,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 09:02:58,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:02:59,386 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 09:02:59,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:02:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 09:02:59,580 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:02:59,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129808526] [2025-01-09 09:02:59,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129808526] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 09:02:59,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:02:59,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-01-09 09:02:59,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745174306] [2025-01-09 09:02:59,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:02:59,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:02:59,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:02:59,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:02:59,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:02:59,581 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:03:02,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:03:04,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:03:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:03:04,115 INFO L93 Difference]: Finished difference Result 247 states and 357 transitions. [2025-01-09 09:03:04,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:03:04,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2025-01-09 09:03:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:03:04,119 INFO L225 Difference]: With dead ends: 247 [2025-01-09 09:03:04,119 INFO L226 Difference]: Without dead ends: 162 [2025-01-09 09:03:04,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:03:04,123 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:03:04,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 220 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 09:03:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-09 09:03:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 132. [2025-01-09 09:03:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 83 states have internal predecessors, (99), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 09:03:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 191 transitions. [2025-01-09 09:03:04,153 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 191 transitions. Word has length 132 [2025-01-09 09:03:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:03:04,154 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 191 transitions. [2025-01-09 09:03:04,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 09:03:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 191 transitions. [2025-01-09 09:03:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 09:03:04,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:03:04,158 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:03:04,169 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 09:03:04,359 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 09:03:04,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:03:04,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:03:04,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2112702824, now seen corresponding path program 1 times [2025-01-09 09:03:04,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:03:04,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000926392] [2025-01-09 09:03:04,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:03:04,361 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 09:03:04,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:03:04,363 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 09:03:04,368 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 09:03:04,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 09:03:04,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 09:03:04,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:03:04,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:03:04,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 09:03:04,638 INFO L279 TraceCheckSpWp]: Computing forward predicates...