./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_fillercodesize_normal_file-19.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 f622c0af01874eaee97ead89039fdcab82e6ffe35ddd9b1f07631012a1a2d1da --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:28:44,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:28:44,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:28:44,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:28:44,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:28:44,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:28:44,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:28:44,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:28:44,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:28:44,623 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:28:44,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:28:44,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:28:44,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:28:44,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:28:44,624 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:28:44,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:28:44,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:28:44,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:28:44,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:28:44,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:28:44,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:28:44,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:28:44,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:28:44,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:28:44,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:28:44,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:28:44,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:28:44,625 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 -> f622c0af01874eaee97ead89039fdcab82e6ffe35ddd9b1f07631012a1a2d1da [2025-03-16 23:28:44,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:28:44,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:28:44,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:28:44,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:28:44,894 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:28:44,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-19.i [2025-03-16 23:28:46,046 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9542bc50/e6f65195fcc04e99ad8d1c51ff019195/FLAGb8d4dcf2d [2025-03-16 23:28:46,288 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:28:46,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-19.i [2025-03-16 23:28:46,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9542bc50/e6f65195fcc04e99ad8d1c51ff019195/FLAGb8d4dcf2d [2025-03-16 23:28:46,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9542bc50/e6f65195fcc04e99ad8d1c51ff019195 [2025-03-16 23:28:46,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:28:46,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:28:46,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:28:46,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:28:46,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:28:46,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46, skipping insertion in model container [2025-03-16 23:28:46,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:28:46,737 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_fillercodesize_normal_file-19.i[913,926] [2025-03-16 23:28:46,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:28:46,814 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:28:46,822 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_fillercodesize_normal_file-19.i[913,926] [2025-03-16 23:28:46,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:28:46,863 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:28:46,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46 WrapperNode [2025-03-16 23:28:46,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:28:46,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:28:46,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:28:46,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:28:46,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,922 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2025-03-16 23:28:46,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:28:46,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:28:46,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:28:46,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:28:46,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,955 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-16 23:28:46,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:28:46,974 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:28:46,974 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:28:46,976 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:28:46,977 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (1/1) ... [2025-03-16 23:28:46,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:28:46,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:28:47,000 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-16 23:28:47,005 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-16 23:28:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:28:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:28:47,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:28:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:28:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:28:47,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:28:47,079 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:28:47,081 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:28:47,347 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 23:28:47,348 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:28:47,356 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:28:47,357 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:28:47,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:28:47 BoogieIcfgContainer [2025-03-16 23:28:47,357 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:28:47,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:28:47,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:28:47,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:28:47,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:28:46" (1/3) ... [2025-03-16 23:28:47,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731c489f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:28:47, skipping insertion in model container [2025-03-16 23:28:47,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:46" (2/3) ... [2025-03-16 23:28:47,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731c489f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:28:47, skipping insertion in model container [2025-03-16 23:28:47,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:28:47" (3/3) ... [2025-03-16 23:28:47,364 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-19.i [2025-03-16 23:28:47,376 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:28:47,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-19.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:28:47,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:28:47,431 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;@b6690af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:28:47,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:28:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:28:47,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 23:28:47,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:47,443 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:47,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:47,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:47,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1395449232, now seen corresponding path program 1 times [2025-03-16 23:28:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:47,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535023271] [2025-03-16 23:28:47,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:47,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:28:47,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:28:47,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:47,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-16 23:28:47,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:47,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535023271] [2025-03-16 23:28:47,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535023271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:28:47,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121884442] [2025-03-16 23:28:47,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:47,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:28:47,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:28:47,722 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-16 23:28:47,726 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-16 23:28:47,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:28:47,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:28:47,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:47,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:47,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:28:47,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:28:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-16 23:28:47,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:28:47,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121884442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:28:47,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:28:47,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:28:47,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613137856] [2025-03-16 23:28:47,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:28:47,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:28:47,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:48,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:28:48,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:28:48,003 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:28:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:48,030 INFO L93 Difference]: Finished difference Result 115 states and 202 transitions. [2025-03-16 23:28:48,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:28:48,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 138 [2025-03-16 23:28:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:48,036 INFO L225 Difference]: With dead ends: 115 [2025-03-16 23:28:48,036 INFO L226 Difference]: Without dead ends: 57 [2025-03-16 23:28:48,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-16 23:28:48,040 INFO L435 NwaCegarLoop]: 87 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, 87 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-16 23:28:48,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:28:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-16 23:28:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-16 23:28:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:28:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2025-03-16 23:28:48,073 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 138 [2025-03-16 23:28:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:48,074 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2025-03-16 23:28:48,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:28:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2025-03-16 23:28:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 23:28:48,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:48,076 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:48,083 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-16 23:28:48,276 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-16 23:28:48,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:48,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:48,277 INFO L85 PathProgramCache]: Analyzing trace with hash -683720268, now seen corresponding path program 1 times [2025-03-16 23:28:48,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:48,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400213650] [2025-03-16 23:28:48,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:48,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:48,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:28:48,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:28:48,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:48,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:28:48,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:48,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400213650] [2025-03-16 23:28:48,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400213650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:28:48,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:28:48,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:28:48,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525386528] [2025-03-16 23:28:48,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:28:48,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:28:48,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:48,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:28:48,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:28:48,785 INFO L87 Difference]: Start difference. First operand 57 states and 87 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:48,927 INFO L93 Difference]: Finished difference Result 185 states and 283 transitions. [2025-03-16 23:28:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:28:48,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 138 [2025-03-16 23:28:48,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:48,930 INFO L225 Difference]: With dead ends: 185 [2025-03-16 23:28:48,931 INFO L226 Difference]: Without dead ends: 129 [2025-03-16 23:28:48,932 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-16 23:28:48,932 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 70 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:28:48,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 266 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:28:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-16 23:28:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2025-03-16 23:28:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 23:28:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 170 transitions. [2025-03-16 23:28:48,954 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 170 transitions. Word has length 138 [2025-03-16 23:28:48,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:48,954 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 170 transitions. [2025-03-16 23:28:48,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 170 transitions. [2025-03-16 23:28:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 23:28:48,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:48,958 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:48,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:28:48,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:48,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash -977123275, now seen corresponding path program 1 times [2025-03-16 23:28:48,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:48,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602560274] [2025-03-16 23:28:48,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:48,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:48,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:28:48,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:28:48,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:48,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:28:49,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:49,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602560274] [2025-03-16 23:28:49,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602560274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:28:49,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:28:49,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:28:49,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101814246] [2025-03-16 23:28:49,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:28:49,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:28:49,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:49,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:28:49,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:28:49,198 INFO L87 Difference]: Start difference. First operand 111 states and 170 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:49,248 INFO L93 Difference]: Finished difference Result 277 states and 425 transitions. [2025-03-16 23:28:49,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:28:49,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 138 [2025-03-16 23:28:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:49,251 INFO L225 Difference]: With dead ends: 277 [2025-03-16 23:28:49,252 INFO L226 Difference]: Without dead ends: 167 [2025-03-16 23:28:49,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:28:49,253 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 46 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:28:49,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 164 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:28:49,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-16 23:28:49,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2025-03-16 23:28:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 23:28:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2025-03-16 23:28:49,281 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 138 [2025-03-16 23:28:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:49,281 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2025-03-16 23:28:49,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:28:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2025-03-16 23:28:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 23:28:49,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:49,283 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:49,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:28:49,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:49,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash -848040556, now seen corresponding path program 1 times [2025-03-16 23:28:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:49,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043213548] [2025-03-16 23:28:49,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:49,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:28:49,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:28:49,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:49,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 23:28:49,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:28:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043213548] [2025-03-16 23:28:49,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043213548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:28:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949987731] [2025-03-16 23:28:49,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:49,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:28:49,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:28:49,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:28:49,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 23:28:49,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:28:49,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:28:49,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:49,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:28:49,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 23:28:49,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:28:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 483 proven. 30 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-16 23:28:49,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:28:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 23:28:50,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949987731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:28:50,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:28:50,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-16 23:28:50,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594261413] [2025-03-16 23:28:50,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:28:50,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:28:50,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:28:50,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:28:50,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:28:50,113 INFO L87 Difference]: Start difference. First operand 165 states and 251 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 23:28:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:28:50,310 INFO L93 Difference]: Finished difference Result 299 states and 441 transitions. [2025-03-16 23:28:50,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:28:50,311 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 138 [2025-03-16 23:28:50,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:28:50,313 INFO L225 Difference]: With dead ends: 299 [2025-03-16 23:28:50,313 INFO L226 Difference]: Without dead ends: 189 [2025-03-16 23:28:50,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:28:50,314 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 109 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:28:50,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 128 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:28:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-16 23:28:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2025-03-16 23:28:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 104 states have internal predecessors, (126), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 23:28:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 258 transitions. [2025-03-16 23:28:50,345 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 258 transitions. Word has length 138 [2025-03-16 23:28:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:28:50,345 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 258 transitions. [2025-03-16 23:28:50,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 23:28:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 258 transitions. [2025-03-16 23:28:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 23:28:50,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:28:50,347 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:28:50,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 23:28:50,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-16 23:28:50,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:28:50,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:28:50,548 INFO L85 PathProgramCache]: Analyzing trace with hash -819411405, now seen corresponding path program 1 times [2025-03-16 23:28:50,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:28:50,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407080024] [2025-03-16 23:28:50,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:28:50,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:28:50,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:28:50,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:28:50,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:50,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:28:50,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:28:50,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:28:50,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:28:50,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:28:50,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:28:50,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:28:50,696 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:28:50,696 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:28:50,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:28:50,701 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-16 23:28:50,804 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:28:50,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:28:50 BoogieIcfgContainer [2025-03-16 23:28:50,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:28:50,807 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:28:50,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:28:50,807 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:28:50,808 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:28:47" (3/4) ... [2025-03-16 23:28:50,809 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:28:50,810 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:28:50,810 INFO L158 Benchmark]: Toolchain (without parser) took 4198.63ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 134.1MB in the beginning and 155.8MB in the end (delta: -21.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2025-03-16 23:28:50,810 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:28:50,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.56ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 118.7MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:28:50,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.90ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 113.3MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:28:50,811 INFO L158 Benchmark]: Boogie Preprocessor took 51.04ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 102.5MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:28:50,811 INFO L158 Benchmark]: IcfgBuilder took 382.94ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 76.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 23:28:50,811 INFO L158 Benchmark]: TraceAbstraction took 3447.81ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 76.0MB in the beginning and 155.9MB in the end (delta: -79.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2025-03-16 23:28:50,811 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 201.3MB. Free memory was 155.9MB in the beginning and 155.8MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:28:50,814 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.56ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 118.7MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.90ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 113.3MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.04ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 102.5MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 382.94ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 76.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3447.81ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 76.0MB in the beginning and 155.9MB in the end (delta: -79.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 201.3MB. Free memory was 155.9MB in the beginning and 155.8MB in the end (delta: 50.8kB). 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 67, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someUnaryFLOAToperation at line 53, overapproximation of someBinaryArithmeticFLOAToperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] signed short int var_1_6 = -16; [L26] unsigned short int var_1_7 = 56838; [L27] unsigned short int var_1_8 = 24612; [L28] signed short int var_1_9 = 20013; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 0; [L32] signed short int var_1_14 = 50; [L33] unsigned char var_1_15 = 0; [L34] signed short int var_1_19 = 100; [L35] double var_1_21 = 3.5; [L36] signed short int var_1_23 = -128; [L37] float var_1_24 = 10.2; [L38] float var_1_25 = 8.6; [L39] float var_1_26 = 32.7; [L40] float var_1_27 = 16.25; [L41] float var_1_28 = 8.875; [L42] unsigned short int var_1_29 = 256; [L43] unsigned char last_1_var_1_15 = 0; [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] CALL updateLastVariables() [L122] last_1_var_1_15 = var_1_15 [L132] RET updateLastVariables() [L133] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L86] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L87] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L87] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L90] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L90] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L91] var_1_7 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L92] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L93] CALL assume_abort_if_not(var_1_7 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L93] RET assume_abort_if_not(var_1_7 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L94] var_1_8 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L95] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L96] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L96] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L97] var_1_9 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_9 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L98] RET assume_abort_if_not(var_1_9 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L99] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L99] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L100] var_1_12 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L101] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L102] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L102] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L103] var_1_13 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L104] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L105] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L105] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L107] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L108] CALL assume_abort_if_not(var_1_21 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L108] RET assume_abort_if_not(var_1_21 != 0.0F) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L109] var_1_23 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_23 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L110] RET assume_abort_if_not(var_1_23 >= -16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L111] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L111] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L112] var_1_25 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L113] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L114] var_1_26 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L115] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L116] var_1_27 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L117] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L118] var_1_28 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L119] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L133] RET updateVariables() [L134] CALL step() [L47] COND FALSE !(\read(last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L50] COND FALSE !(\read(var_1_10)) [L53] var_1_24 = ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L55] COND TRUE (- var_1_24) == (var_1_24 + var_1_24) [L56] var_1_15 = var_1_12 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L58] COND FALSE !(var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) [L65] var_1_19 = var_1_2 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-16383, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L67] COND FALSE !(var_1_24 != var_1_24) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-16383, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L70] signed long int stepLocal_1 = var_1_7 - (var_1_8 - var_1_2); VAL [isInitial=1, last_1_var_1_15=0, stepLocal_1=256, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-16383, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L71] COND TRUE stepLocal_1 >= var_1_29 [L72] var_1_6 = (var_1_3 - (var_1_9 - var_1_2)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-16383, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16129, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L74] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-16383, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16129, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L77] signed long int stepLocal_0 = var_1_2 - var_1_3; VAL [isInitial=1, last_1_var_1_15=0, stepLocal_0=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-16383, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16129, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L78] COND TRUE stepLocal_0 <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6))) [L79] var_1_1 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16129, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L134] RET step() [L135] CALL, EXPR property() [L125-L126] return (((((((((var_1_2 - var_1_3) <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6)))) ? (var_1_1 == ((signed long int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : (var_1_1 == ((signed long int) var_1_2))) && (((var_1_7 - (var_1_8 - var_1_2)) >= var_1_29) ? (var_1_6 == ((signed short int) (var_1_3 - (var_1_9 - var_1_2)))) : 1)) && (last_1_var_1_15 ? (var_1_10 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && (var_1_15 ? (var_1_14 == ((signed short int) (((((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) < (var_1_9)) ? ((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) : (var_1_9))))) : 1)) && (((- var_1_24) == (var_1_24 + var_1_24)) ? (var_1_15 == ((unsigned char) var_1_12)) : 1)) && ((var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) ? (var_1_10 ? (var_1_19 == ((signed short int) (var_1_3 + ((((var_1_2) < (var_1_23)) ? (var_1_2) : (var_1_23)))))) : (var_1_19 == ((signed short int) (var_1_3 - 8)))) : (var_1_19 == ((signed short int) var_1_2)))) && (var_1_10 ? (var_1_24 == ((float) ((((var_1_25) > (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))) ? (var_1_25) : (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26)))))))) : (var_1_24 == ((float) ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))))))) && ((var_1_24 != var_1_24) ? (var_1_29 == ((unsigned short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16129, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16129, var_1_7=32896, var_1_8=32767, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 113 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 645 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 329 mSDtfsCounter, 152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 32 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 966 NumberOfCodeBlocks, 966 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 959 ConstructedInterpolants, 0 QuantifiedInterpolants, 2033 SizeOfPredicates, 2 NumberOfNonLiveVariables, 642 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 6336/6468 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-16 23:28:50,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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_fillercodesize_normal_file-19.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 f622c0af01874eaee97ead89039fdcab82e6ffe35ddd9b1f07631012a1a2d1da --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:28:52,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:28:52,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:28:52,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:28:52,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:28:52,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:28:52,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:28:52,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:28:52,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:28:52,931 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:28:52,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:28:52,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:28:52,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:28:52,933 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:28:52,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:28:52,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:28:52,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:28:52,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:28:52,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:28:52,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:28:52,936 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 -> f622c0af01874eaee97ead89039fdcab82e6ffe35ddd9b1f07631012a1a2d1da [2025-03-16 23:28:53,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:28:53,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:28:53,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:28:53,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:28:53,167 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:28:53,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-19.i [2025-03-16 23:28:54,326 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29abb4b8f/f87f6c22ea21494eb23f8ee7ab714260/FLAG9cfbeb64b [2025-03-16 23:28:54,584 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:28:54,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-19.i [2025-03-16 23:28:54,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29abb4b8f/f87f6c22ea21494eb23f8ee7ab714260/FLAG9cfbeb64b [2025-03-16 23:28:54,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29abb4b8f/f87f6c22ea21494eb23f8ee7ab714260 [2025-03-16 23:28:54,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:28:54,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:28:54,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:28:54,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:28:54,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:28:54,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf49a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54, skipping insertion in model container [2025-03-16 23:28:54,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:28:54,737 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_fillercodesize_normal_file-19.i[913,926] [2025-03-16 23:28:54,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:28:54,816 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:28:54,826 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_fillercodesize_normal_file-19.i[913,926] [2025-03-16 23:28:54,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:28:54,879 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:28:54,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54 WrapperNode [2025-03-16 23:28:54,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:28:54,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:28:54,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:28:54,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:28:54,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,913 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-16 23:28:54,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:28:54,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:28:54,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:28:54,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:28:54,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,933 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-16 23:28:54,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:28:54,945 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:28:54,945 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:28:54,945 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:28:54,946 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (1/1) ... [2025-03-16 23:28:54,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:28:54,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:28:54,973 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-16 23:28:54,976 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-16 23:28:54,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:28:54,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:28:54,993 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:28:54,993 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:28:54,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:28:54,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:28:55,052 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:28:55,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:29:08,897 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 23:29:08,897 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:29:08,904 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:29:08,905 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:29:08,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:29:08 BoogieIcfgContainer [2025-03-16 23:29:08,906 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:29:08,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:29:08,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:29:08,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:29:08,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:28:54" (1/3) ... [2025-03-16 23:29:08,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684b665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:29:08, skipping insertion in model container [2025-03-16 23:29:08,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:28:54" (2/3) ... [2025-03-16 23:29:08,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684b665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:29:08, skipping insertion in model container [2025-03-16 23:29:08,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:29:08" (3/3) ... [2025-03-16 23:29:08,912 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-19.i [2025-03-16 23:29:08,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:29:08,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-19.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:29:08,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:29:08,974 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;@59cc964e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:29:08,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:29:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:29:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 23:29:08,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:29:08,985 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:29:08,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:29:08,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:29:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1395449232, now seen corresponding path program 1 times [2025-03-16 23:29:08,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:29:08,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150983510] [2025-03-16 23:29:08,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:29:08,997 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-16 23:29:08,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:29:08,999 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-16 23:29:09,001 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-16 23:29:09,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:29:09,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:29:09,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:29:09,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:29:09,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:29:09,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:29:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-16 23:29:09,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:29:09,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:29:09,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150983510] [2025-03-16 23:29:09,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150983510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:29:09,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:29:09,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:29:09,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423669474] [2025-03-16 23:29:09,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:29:09,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:29:09,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:29:09,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:29:09,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:29:09,914 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:29:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:29:09,931 INFO L93 Difference]: Finished difference Result 115 states and 202 transitions. [2025-03-16 23:29:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:29:09,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 138 [2025-03-16 23:29:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:29:09,938 INFO L225 Difference]: With dead ends: 115 [2025-03-16 23:29:09,939 INFO L226 Difference]: Without dead ends: 57 [2025-03-16 23:29:09,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:29:09,946 INFO L435 NwaCegarLoop]: 87 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, 87 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-16 23:29:09,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:29:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-16 23:29:09,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-16 23:29:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:29:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2025-03-16 23:29:09,986 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 138 [2025-03-16 23:29:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:29:09,986 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2025-03-16 23:29:09,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:29:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2025-03-16 23:29:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 23:29:09,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:29:09,991 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:29:10,014 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-16 23:29:10,191 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-16 23:29:10,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:29:10,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:29:10,193 INFO L85 PathProgramCache]: Analyzing trace with hash -683720268, now seen corresponding path program 1 times [2025-03-16 23:29:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:29:10,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310920762] [2025-03-16 23:29:10,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:29:10,193 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-16 23:29:10,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:29:10,198 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-16 23:29:10,199 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-16 23:29:10,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:29:11,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:29:11,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:29:11,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:29:11,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 23:29:11,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:29:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:29:15,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:29:15,706 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:29:15,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310920762] [2025-03-16 23:29:15,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310920762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:29:15,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:29:15,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:29:15,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135139576] [2025-03-16 23:29:15,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:29:15,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:29:15,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:29:15,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:29:15,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:29:15,708 INFO L87 Difference]: Start difference. First operand 57 states and 87 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:29:20,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:29:24,381 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-16 23:29:28,403 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-16 23:29:33,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:29:37,015 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-16 23:29:41,039 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-16 23:29:45,054 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-16 23:29:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:29:45,055 INFO L93 Difference]: Finished difference Result 193 states and 292 transitions. [2025-03-16 23:29:45,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:29:45,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 138 [2025-03-16 23:29:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:29:45,196 INFO L225 Difference]: With dead ends: 193 [2025-03-16 23:29:45,196 INFO L226 Difference]: Without dead ends: 137 [2025-03-16 23:29:45,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:29:45,197 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 75 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 49 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:29:45,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 274 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 8 Invalid, 7 Unknown, 0 Unchecked, 29.2s Time] [2025-03-16 23:29:45,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-16 23:29:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 111. [2025-03-16 23:29:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 23:29:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 170 transitions. [2025-03-16 23:29:45,217 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 170 transitions. Word has length 138 [2025-03-16 23:29:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:29:45,218 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 170 transitions. [2025-03-16 23:29:45,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:29:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 170 transitions. [2025-03-16 23:29:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 23:29:45,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:29:45,220 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:29:45,239 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-16 23:29:45,421 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-16 23:29:45,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:29:45,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:29:45,422 INFO L85 PathProgramCache]: Analyzing trace with hash -977123275, now seen corresponding path program 1 times [2025-03-16 23:29:45,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:29:45,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984405515] [2025-03-16 23:29:45,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:29:45,422 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-16 23:29:45,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:29:45,424 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-16 23:29:45,426 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-16 23:29:45,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:29:46,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:29:46,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:29:46,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:29:46,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 23:29:46,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:29:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:29:50,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:29:50,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:29:50,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984405515] [2025-03-16 23:29:50,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984405515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:29:50,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:29:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:29:50,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584874418] [2025-03-16 23:29:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:29:50,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:29:50,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:29:50,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:29:50,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:29:50,291 INFO L87 Difference]: Start difference. First operand 111 states and 170 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:29:54,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:29:59,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:29:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:29:59,311 INFO L93 Difference]: Finished difference Result 331 states and 508 transitions. [2025-03-16 23:29:59,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:29:59,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 138 [2025-03-16 23:29:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:29:59,456 INFO L225 Difference]: With dead ends: 331 [2025-03-16 23:29:59,456 INFO L226 Difference]: Without dead ends: 221 [2025-03-16 23:29:59,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:29:59,457 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 21 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:29:59,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 165 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2025-03-16 23:29:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-16 23:29:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2025-03-16 23:29:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 126 states have (on average 1.253968253968254) internal successors, (158), 126 states have internal predecessors, (158), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 23:29:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 334 transitions. [2025-03-16 23:29:59,480 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 334 transitions. Word has length 138 [2025-03-16 23:29:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:29:59,482 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 334 transitions. [2025-03-16 23:29:59,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:29:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 334 transitions. [2025-03-16 23:29:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 23:29:59,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:29:59,483 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:29:59,504 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-16 23:29:59,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-16 23:29:59,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:29:59,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:29:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash -848040556, now seen corresponding path program 1 times [2025-03-16 23:29:59,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:29:59,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594281244] [2025-03-16 23:29:59,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:29:59,685 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-16 23:29:59,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:29:59,687 INFO L229 MonitoredProcess]: Starting monitored process 5 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-16 23:29:59,688 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 (5)] Waiting until timeout for monitored process [2025-03-16 23:29:59,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:30:00,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:30:00,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:30:00,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:30:00,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 23:30:00,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:30:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 483 proven. 30 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-16 23:30:03,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:30:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 23:30:06,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:30:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594281244] [2025-03-16 23:30:06,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594281244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:30:06,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:30:06,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-16 23:30:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469735098] [2025-03-16 23:30:06,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:30:06,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 23:30:06,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:30:06,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 23:30:06,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 23:30:06,258 INFO L87 Difference]: Start difference. First operand 219 states and 334 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 23:30:13,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:30:17,812 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-16 23:30:21,822 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-16 23:30:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:30:21,825 INFO L93 Difference]: Finished difference Result 289 states and 433 transitions. [2025-03-16 23:30:21,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:30:21,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 138 [2025-03-16 23:30:21,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:30:21,949 INFO L225 Difference]: With dead ends: 289 [2025-03-16 23:30:21,949 INFO L226 Difference]: Without dead ends: 71 [2025-03-16 23:30:21,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:30:21,951 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 91 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 89 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:30:21,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 120 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 14.5s Time] [2025-03-16 23:30:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-16 23:30:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2025-03-16 23:30:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:30:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2025-03-16 23:30:21,958 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 138 [2025-03-16 23:30:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:30:21,958 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2025-03-16 23:30:21,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 23:30:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2025-03-16 23:30:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 23:30:21,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:30:21,959 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:30:21,978 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 (5)] Ended with exit code 0 [2025-03-16 23:30:22,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-16 23:30:22,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:30:22,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:30:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash -819411405, now seen corresponding path program 1 times [2025-03-16 23:30:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:30:22,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807640596] [2025-03-16 23:30:22,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:30:22,160 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-16 23:30:22,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:30:22,162 INFO L229 MonitoredProcess]: Starting monitored process 6 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-16 23:30:22,163 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 (6)] Waiting until timeout for monitored process [2025-03-16 23:30:22,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 23:30:22,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 23:30:22,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:30:22,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:30:22,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 23:30:22,975 INFO L279 TraceCheckSpWp]: Computing forward predicates...