./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1a9aee9822d06be8cdedb365ceb93a26d94f68fca9c6c31f47131d8d21dcd286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:08:58,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:08:58,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:08:58,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:08:58,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:08:58,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:08:58,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:08:58,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:08:58,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:08:58,082 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:08:58,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:08:58,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:08:58,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:08:58,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:08:58,083 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:08:58,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:08:58,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:08:58,084 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:08:58,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:08:58,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:08:58,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:08:58,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:08:58,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:08:58,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:08:58,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:08:58,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:08:58,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:08:58,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:08:58,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:08:58,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:08:58,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:08:58,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:08:58,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:08:58,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:08:58,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:08:58,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:08:58,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:08:58,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:08:58,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:08:58,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:08:58,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:08:58,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:08:58,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:08:58,087 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/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 -> 1a9aee9822d06be8cdedb365ceb93a26d94f68fca9c6c31f47131d8d21dcd286 [2025-03-03 22:08:58,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:08:58,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:08:58,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:08:58,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:08:58,345 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:08:58,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-0.i [2025-03-03 22:08:59,506 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c372214/75fb734bd7ea4284811bad5127a1e984/FLAGa923edd1b [2025-03-03 22:08:59,790 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:08:59,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-0.i [2025-03-03 22:08:59,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c372214/75fb734bd7ea4284811bad5127a1e984/FLAGa923edd1b [2025-03-03 22:09:00,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c372214/75fb734bd7ea4284811bad5127a1e984 [2025-03-03 22:09:00,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:09:00,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:09:00,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:09:00,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:09:00,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:09:00,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67682a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00, skipping insertion in model container [2025-03-03 22:09:00,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:09:00,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-0.i[912,925] [2025-03-03 22:09:00,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:09:00,250 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:09:00,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-0.i[912,925] [2025-03-03 22:09:00,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:09:00,296 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:09:00,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00 WrapperNode [2025-03-03 22:09:00,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:09:00,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:09:00,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:09:00,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:09:00,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,333 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-03-03 22:09:00,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:09:00,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:09:00,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:09:00,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:09:00,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,360 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-03-03 22:09:00,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:09:00,376 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:09:00,376 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:09:00,376 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:09:00,377 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (1/1) ... [2025-03-03 22:09:00,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:09:00,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:09:00,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:09:00,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:09:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:09:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:09:00,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:09:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:09:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:09:00,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:09:00,476 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:09:00,478 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:09:00,659 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 22:09:00,660 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:09:00,666 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:09:00,666 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:09:00,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:09:00 BoogieIcfgContainer [2025-03-03 22:09:00,666 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:09:00,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:09:00,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:09:00,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:09:00,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:09:00" (1/3) ... [2025-03-03 22:09:00,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66915d57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:09:00, skipping insertion in model container [2025-03-03 22:09:00,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:00" (2/3) ... [2025-03-03 22:09:00,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66915d57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:09:00, skipping insertion in model container [2025-03-03 22:09:00,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:09:00" (3/3) ... [2025-03-03 22:09:00,673 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-0.i [2025-03-03 22:09:00,685 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:09:00,686 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-0.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:09:00,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:09:00,732 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;@49673410, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:09:00,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:09:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 22:09:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 22:09:00,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:09:00,742 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:09:00,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:09:00,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:09:00,747 INFO L85 PathProgramCache]: Analyzing trace with hash 155124576, now seen corresponding path program 1 times [2025-03-03 22:09:00,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:09:00,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591927618] [2025-03-03 22:09:00,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:09:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:09:00,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 22:09:00,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 22:09:00,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:09:00,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:09:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-03 22:09:00,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:09:00,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591927618] [2025-03-03 22:09:00,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591927618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:09:00,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978863086] [2025-03-03 22:09:00,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:09:00,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:09:00,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:09:00,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:09:00,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:09:01,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 22:09:01,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 22:09:01,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:09:01,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:09:01,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:09:01,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:09:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-03 22:09:01,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:09:01,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978863086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:09:01,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:09:01,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:09:01,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568479254] [2025-03-03 22:09:01,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:09:01,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:09:01,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:09:01,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:09:01,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:09:01,138 INFO L87 Difference]: Start difference. First operand has 47 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 22:09:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:09:01,150 INFO L93 Difference]: Finished difference Result 88 states and 136 transitions. [2025-03-03 22:09:01,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:09:01,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2025-03-03 22:09:01,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:09:01,156 INFO L225 Difference]: With dead ends: 88 [2025-03-03 22:09:01,156 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 22:09:01,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 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-03-03 22:09:01,160 INFO L435 NwaCegarLoop]: 61 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, 61 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-03-03 22:09:01,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:09:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 22:09:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-03 22:09:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 22:09:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2025-03-03 22:09:01,189 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 72 [2025-03-03 22:09:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:09:01,190 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2025-03-03 22:09:01,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 22:09:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2025-03-03 22:09:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 22:09:01,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:09:01,191 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:09:01,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:09:01,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:09:01,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:09:01,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:09:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash 786879517, now seen corresponding path program 1 times [2025-03-03 22:09:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:09:01,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693771710] [2025-03-03 22:09:01,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:09:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:09:01,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 22:09:01,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 22:09:01,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:09:01,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:09:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-03 22:09:01,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:09:01,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693771710] [2025-03-03 22:09:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693771710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:09:01,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:09:01,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:09:01,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701305635] [2025-03-03 22:09:01,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:09:01,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:09:01,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:09:01,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:09:01,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:09:01,761 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 22:09:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:09:01,888 INFO L93 Difference]: Finished difference Result 127 states and 178 transitions. [2025-03-03 22:09:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:09:01,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2025-03-03 22:09:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:09:01,891 INFO L225 Difference]: With dead ends: 127 [2025-03-03 22:09:01,892 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 22:09:01,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:09:01,893 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 42 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:09:01,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 187 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:09:01,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 22:09:01,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2025-03-03 22:09:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:09:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2025-03-03 22:09:01,908 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 96 transitions. Word has length 72 [2025-03-03 22:09:01,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:09:01,909 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 96 transitions. [2025-03-03 22:09:01,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 22:09:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2025-03-03 22:09:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 22:09:01,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:09:01,909 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:09:01,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:09:01,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:09:01,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:09:01,910 INFO L85 PathProgramCache]: Analyzing trace with hash 493476510, now seen corresponding path program 1 times [2025-03-03 22:09:01,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:09:01,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454598286] [2025-03-03 22:09:01,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:09:01,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:09:01,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 22:09:01,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 22:09:01,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:09:01,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:09:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-03 22:09:02,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:09:02,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454598286] [2025-03-03 22:09:02,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454598286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:09:02,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:09:02,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:09:02,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247731393] [2025-03-03 22:09:02,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:09:02,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:09:02,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:09:02,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:09:02,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:09:02,246 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 22:09:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:09:02,340 INFO L93 Difference]: Finished difference Result 168 states and 234 transitions. [2025-03-03 22:09:02,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:09:02,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2025-03-03 22:09:02,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:09:02,343 INFO L225 Difference]: With dead ends: 168 [2025-03-03 22:09:02,343 INFO L226 Difference]: Without dead ends: 124 [2025-03-03 22:09:02,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:09:02,345 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 87 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:09:02,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 162 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:09:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-03 22:09:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2025-03-03 22:09:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 22:09:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 151 transitions. [2025-03-03 22:09:02,367 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 151 transitions. Word has length 72 [2025-03-03 22:09:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:09:02,367 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 151 transitions. [2025-03-03 22:09:02,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 22:09:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 151 transitions. [2025-03-03 22:09:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 22:09:02,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:09:02,370 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:09:02,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:09:02,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:09:02,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:09:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash -17057667, now seen corresponding path program 1 times [2025-03-03 22:09:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:09:02,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524256168] [2025-03-03 22:09:02,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:09:02,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:09:02,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 22:09:02,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 22:09:02,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:09:02,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:09:02,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:09:02,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 22:09:02,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 22:09:02,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:09:02,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:09:02,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:09:02,537 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:09:02,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:09:02,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:09:02,542 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 22:09:02,607 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:09:02,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:09:02 BoogieIcfgContainer [2025-03-03 22:09:02,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:09:02,611 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:09:02,611 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:09:02,611 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:09:02,612 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:09:00" (3/4) ... [2025-03-03 22:09:02,614 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:09:02,614 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:09:02,615 INFO L158 Benchmark]: Toolchain (without parser) took 2535.97ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 51.6MB in the end (delta: 71.3MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. [2025-03-03 22:09:02,615 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:09:02,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.13ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 109.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:09:02,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.97ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:09:02,616 INFO L158 Benchmark]: Boogie Preprocessor took 41.46ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 105.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:09:02,616 INFO L158 Benchmark]: IcfgBuilder took 290.43ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 88.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:09:02,616 INFO L158 Benchmark]: TraceAbstraction took 1942.35ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 51.6MB in the end (delta: 35.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2025-03-03 22:09:02,616 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 167.8MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:09:02,617 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.20ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.13ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 109.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.97ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.46ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 105.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 290.43ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 88.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1942.35ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 51.6MB in the end (delta: 35.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 167.8MB. Free memory was 51.6MB in the beginning and 51.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 someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] signed long int var_1_5 = 2; [L24] signed short int var_1_6 = -10; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned long int var_1_9 = 3470417420; [L28] unsigned char var_1_10 = 0; [L29] double var_1_12 = 25.6; [L30] double var_1_13 = 1.75; [L31] float var_1_14 = 5.4; [L32] float var_1_15 = 127.5; [L33] float var_1_16 = 3.5; [L34] signed long int var_1_17 = 64; [L35] signed long int last_1_var_1_1 = 0; [L36] signed long int last_1_var_1_5 = 2; [L37] signed short int last_1_var_1_6 = -10; [L38] unsigned long int last_1_var_1_7 = 1; [L39] float last_1_var_1_14 = 5.4; [L40] signed long int last_1_var_1_17 = 64; VAL [isInitial=0, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L104] last_1_var_1_1 = var_1_1 [L105] last_1_var_1_5 = var_1_5 [L106] last_1_var_1_6 = var_1_6 [L107] last_1_var_1_7 = var_1_7 [L108] last_1_var_1_14 = var_1_14 [L109] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L119] RET updateLastVariables() [L120] CALL updateVariables() [L87] var_1_9 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L88] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L89] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L89] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L90] var_1_10 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L91] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L92] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L92] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L93] var_1_12 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L94] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L95] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L95] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L96] var_1_13 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L97] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L98] var_1_15 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L99] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L100] var_1_16 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L101] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L120] RET updateVariables() [L121] CALL step() [L44] COND FALSE !(last_1_var_1_7 > (- last_1_var_1_5)) [L47] var_1_1 = (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L49] COND FALSE !(((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) [L52] var_1_17 = last_1_var_1_6 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L54] signed long int stepLocal_1 = - last_1_var_1_1; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_1=0, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L55] COND FALSE !(last_1_var_1_17 < stepLocal_1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L58] signed long int stepLocal_3 = var_1_1; [L59] signed long int stepLocal_2 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_2=-10, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L60] COND FALSE !(var_1_17 > stepLocal_2) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L65] unsigned long int stepLocal_5 = var_1_9; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L66] COND FALSE !((var_1_12 * last_1_var_1_14) > var_1_13) [L73] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L75] signed long int stepLocal_0 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_0=-10, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L76] COND FALSE !(var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L79] unsigned long int stepLocal_4 = var_1_9 - var_1_6; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_4=-2147483639, stepLocal_5=-2147483649, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L80] COND TRUE (- 8u) >= stepLocal_4 [L81] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L121] RET step() [L122] CALL, EXPR property() [L112-L113] return (((((((last_1_var_1_7 > (- last_1_var_1_5)) ? (var_1_1 == ((signed long int) ((((last_1_var_1_5) > ((last_1_var_1_7 + last_1_var_1_6))) ? (last_1_var_1_5) : ((last_1_var_1_7 + last_1_var_1_6)))))) : (var_1_1 == ((signed long int) (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16)))))) && ((var_1_6 < var_1_17) ? (var_1_5 == ((signed long int) ((var_1_17 - var_1_6) + var_1_6))) : 1)) && ((last_1_var_1_17 < (- last_1_var_1_1)) ? (var_1_6 == ((signed short int) (32 - last_1_var_1_6))) : 1)) && ((var_1_17 > var_1_17) ? ((var_1_6 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_6)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_14 / var_1_12) >= var_1_14) || var_1_10))))) && (((var_1_12 * last_1_var_1_14) > var_1_13) ? ((var_1_9 < var_1_7) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))))) : (var_1_17 == ((signed long int) last_1_var_1_6))) ; VAL [\result=0, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=-10, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 410 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 173 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=3, InterpolantAutomatonStates: 11, 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, 3 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 206 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 560/576 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-03-03 22:09:02,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1a9aee9822d06be8cdedb365ceb93a26d94f68fca9c6c31f47131d8d21dcd286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:09:04,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:09:04,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:09:04,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:09:04,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:09:04,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:09:04,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:09:04,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:09:04,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:09:04,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:09:04,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:09:04,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:09:04,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:09:04,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:09:04,581 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:09:04,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:09:04,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:09:04,581 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:09:04,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:09:04,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:09:04,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:09:04,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:09:04,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:09:04,582 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:09:04,582 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:09:04,582 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:09:04,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:09:04,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:09:04,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:09:04,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:09:04,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:09:04,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:09:04,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:09:04,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:09:04,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:09:04,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:09:04,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:09:04,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:09:04,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:09:04,584 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:09:04,584 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:09:04,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:09:04,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:09:04,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:09:04,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:09:04,584 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/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 -> 1a9aee9822d06be8cdedb365ceb93a26d94f68fca9c6c31f47131d8d21dcd286 [2025-03-03 22:09:04,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:09:04,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:09:04,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:09:04,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:09:04,839 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:09:04,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-0.i [2025-03-03 22:09:05,995 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d3df6415/4398c7bfa9684eaeb689a28d5f2de1ac/FLAG300b8a94b [2025-03-03 22:09:06,224 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:09:06,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-0.i [2025-03-03 22:09:06,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d3df6415/4398c7bfa9684eaeb689a28d5f2de1ac/FLAG300b8a94b [2025-03-03 22:09:06,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d3df6415/4398c7bfa9684eaeb689a28d5f2de1ac [2025-03-03 22:09:06,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:09:06,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:09:06,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:09:06,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:09:06,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:09:06,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef52950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06, skipping insertion in model container [2025-03-03 22:09:06,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:09:06,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-0.i[912,925] [2025-03-03 22:09:06,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:09:06,450 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:09:06,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-0.i[912,925] [2025-03-03 22:09:06,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:09:06,499 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:09:06,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06 WrapperNode [2025-03-03 22:09:06,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:09:06,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:09:06,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:09:06,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:09:06,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,529 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-03-03 22:09:06,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:09:06,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:09:06,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:09:06,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:09:06,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,550 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-03-03 22:09:06,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:09:06,568 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:09:06,568 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:09:06,568 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:09:06,572 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (1/1) ... [2025-03-03 22:09:06,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:09:06,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:09:06,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:09:06,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:09:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:09:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:09:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:09:06,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:09:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:09:06,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:09:06,691 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:09:06,692 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:09:31,614 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 22:09:31,615 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:09:31,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:09:31,625 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:09:31,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:09:31 BoogieIcfgContainer [2025-03-03 22:09:31,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:09:31,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:09:31,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:09:31,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:09:31,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:09:06" (1/3) ... [2025-03-03 22:09:31,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c339c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:09:31, skipping insertion in model container [2025-03-03 22:09:31,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:09:06" (2/3) ... [2025-03-03 22:09:31,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c339c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:09:31, skipping insertion in model container [2025-03-03 22:09:31,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:09:31" (3/3) ... [2025-03-03 22:09:31,633 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-0.i [2025-03-03 22:09:31,643 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:09:31,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-0.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:09:31,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:09:31,703 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;@46d8af08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:09:31,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:09:31,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 22:09:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 22:09:31,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:09:31,712 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:09:31,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:09:31,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:09:31,716 INFO L85 PathProgramCache]: Analyzing trace with hash 155124576, now seen corresponding path program 1 times [2025-03-03 22:09:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:09:31,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164181491] [2025-03-03 22:09:31,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:09:31,724 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-03-03 22:09:31,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:09:31,727 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-03 22:09:31,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 22:09:31,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 22:09:33,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 22:09:33,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:09:33,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:09:33,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:09:33,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:09:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 22:09:33,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:09:33,236 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:09:33,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164181491] [2025-03-03 22:09:33,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164181491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:09:33,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:09:33,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:09:33,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553504104] [2025-03-03 22:09:33,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:09:33,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:09:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:09:33,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:09:33,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:09:33,255 INFO L87 Difference]: Start difference. First operand has 47 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 22:09:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:09:33,267 INFO L93 Difference]: Finished difference Result 88 states and 136 transitions. [2025-03-03 22:09:33,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:09:33,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2025-03-03 22:09:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:09:33,289 INFO L225 Difference]: With dead ends: 88 [2025-03-03 22:09:33,289 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 22:09:33,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-03-03 22:09:33,293 INFO L435 NwaCegarLoop]: 61 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, 61 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-03-03 22:09:33,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:09:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 22:09:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-03 22:09:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 22:09:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2025-03-03 22:09:33,315 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 72 [2025-03-03 22:09:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:09:33,315 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2025-03-03 22:09:33,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 22:09:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2025-03-03 22:09:33,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 22:09:33,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:09:33,317 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:09:33,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 22:09:33,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-03 22:09:33,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:09:33,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:09:33,519 INFO L85 PathProgramCache]: Analyzing trace with hash 786879517, now seen corresponding path program 1 times [2025-03-03 22:09:33,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:09:33,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997730521] [2025-03-03 22:09:33,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:09:33,520 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-03-03 22:09:33,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:09:33,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-03 22:09:33,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 22:09:33,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 22:09:34,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 22:09:34,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:09:34,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:09:34,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 22:09:34,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:09:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-03 22:09:41,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:09:41,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:09:41,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997730521] [2025-03-03 22:09:41,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997730521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:09:41,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:09:41,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:09:41,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128962671] [2025-03-03 22:09:41,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:09:41,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:09:41,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:09:41,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:09:41,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:09:41,745 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 22:09:47,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:09:51,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:09:55,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:10:00,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:10:04,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:10:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:10:04,126 INFO L93 Difference]: Finished difference Result 140 states and 195 transitions. [2025-03-03 22:10:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:10:04,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2025-03-03 22:10:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:10:04,386 INFO L225 Difference]: With dead ends: 140 [2025-03-03 22:10:04,386 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 22:10:04,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:10:04,387 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 84 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 19 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:10:04,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 163 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 22.1s Time] [2025-03-03 22:10:04,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 22:10:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2025-03-03 22:10:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:10:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2025-03-03 22:10:04,404 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 72 [2025-03-03 22:10:04,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:10:04,405 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2025-03-03 22:10:04,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 22:10:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2025-03-03 22:10:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 22:10:04,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:10:04,407 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:10:04,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 22:10:04,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-03 22:10:04,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:10:04,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:10:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash 276345340, now seen corresponding path program 1 times [2025-03-03 22:10:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:10:04,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335241320] [2025-03-03 22:10:04,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:10:04,610 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-03-03 22:10:04,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:10:04,612 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-03 22:10:04,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 22:10:04,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 22:10:05,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 22:10:05,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:10:05,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:10:05,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:10:05,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:10:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-03 22:10:13,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:10:13,416 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:10:13,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335241320] [2025-03-03 22:10:13,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335241320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:10:13,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:10:13,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:10:13,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114445331] [2025-03-03 22:10:13,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:10:13,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:10:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:10:13,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:10:13,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:10:13,417 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 22:10:18,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:10:22,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:10:26,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:10:30,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:10:36,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:10:40,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:10:44,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []