./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_operatoramount_amount50_file-8.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 62bf3dfe88b7b7f16a2317bf4b03356735885070ddf7d29f329649cb5fd7ab4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:58:40,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:58:40,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:58:40,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:58:40,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:58:40,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:58:40,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:58:40,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:58:40,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:58:40,491 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:58:40,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:58:40,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:58:40,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:58:40,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:58:40,493 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:58:40,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:58:40,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:58:40,493 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:58:40,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:58:40,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:58:40,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:58:40,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:58:40,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:58:40,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:58:40,494 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:58:40,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:58:40,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:58:40,494 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:58:40,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:58:40,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:58:40,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:58:40,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:58:40,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:58:40,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:58:40,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:58:40,495 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:58:40,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:58:40,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:58:40,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:58:40,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:58:40,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:58:40,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:58:40,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:58:40,496 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 -> 62bf3dfe88b7b7f16a2317bf4b03356735885070ddf7d29f329649cb5fd7ab4b [2025-03-08 15:58:40,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:58:40,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:58:40,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:58:40,713 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:58:40,714 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:58:40,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-8.i [2025-03-08 15:58:41,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46d699dd2/a867100931bc4629b103eace4673cf46/FLAG54b3fb046 [2025-03-08 15:58:42,043 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:58:42,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-8.i [2025-03-08 15:58:42,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46d699dd2/a867100931bc4629b103eace4673cf46/FLAG54b3fb046 [2025-03-08 15:58:42,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46d699dd2/a867100931bc4629b103eace4673cf46 [2025-03-08 15:58:42,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:58:42,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:58:42,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:58:42,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:58:42,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:58:42,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5803ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42, skipping insertion in model container [2025-03-08 15:58:42,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:58:42,171 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_operatoramount_amount50_file-8.i[914,927] [2025-03-08 15:58:42,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:58:42,242 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:58:42,250 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_operatoramount_amount50_file-8.i[914,927] [2025-03-08 15:58:42,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:58:42,299 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:58:42,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42 WrapperNode [2025-03-08 15:58:42,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:58:42,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:58:42,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:58:42,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:58:42,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,334 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-03-08 15:58:42,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:58:42,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:58:42,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:58:42,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:58:42,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,361 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-08 15:58:42,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,368 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:58:42,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:58:42,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:58:42,380 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:58:42,380 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (1/1) ... [2025-03-08 15:58:42,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:58:42,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:58:42,405 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-08 15:58:42,410 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-08 15:58:42,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:58:42,424 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:58:42,424 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:58:42,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:58:42,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:58:42,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:58:42,476 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:58:42,477 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:58:42,730 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:58:42,730 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:58:42,741 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:58:42,741 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:58:42,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:58:42 BoogieIcfgContainer [2025-03-08 15:58:42,741 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:58:42,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:58:42,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:58:42,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:58:42,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:58:42" (1/3) ... [2025-03-08 15:58:42,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60667614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:58:42, skipping insertion in model container [2025-03-08 15:58:42,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:42" (2/3) ... [2025-03-08 15:58:42,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60667614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:58:42, skipping insertion in model container [2025-03-08 15:58:42,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:58:42" (3/3) ... [2025-03-08 15:58:42,750 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-8.i [2025-03-08 15:58:42,761 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:58:42,763 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-8.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:58:42,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:58:42,820 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;@367fccca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:58:42,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:58:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 15:58:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 15:58:42,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:58:42,838 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:58:42,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:58:42,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:58:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2052454261, now seen corresponding path program 1 times [2025-03-08 15:58:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:58:42,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554452412] [2025-03-08 15:58:42,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:42,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:58:42,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 15:58:42,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 15:58:42,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:42,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:58:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 15:58:43,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:58:43,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554452412] [2025-03-08 15:58:43,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554452412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:58:43,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888335984] [2025-03-08 15:58:43,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:43,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:58:43,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:58:43,092 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-08 15:58:43,094 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-08 15:58:43,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 15:58:43,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 15:58:43,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:43,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:58:43,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:58:43,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:58:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 15:58:43,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:58:43,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888335984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:58:43,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:58:43,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:58:43,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937810208] [2025-03-08 15:58:43,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:58:43,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:58:43,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:58:43,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:58:43,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:58:43,287 INFO L87 Difference]: Start difference. First operand has 65 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 15:58:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:58:43,314 INFO L93 Difference]: Finished difference Result 124 states and 220 transitions. [2025-03-08 15:58:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:58:43,316 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-08 15:58:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:58:43,320 INFO L225 Difference]: With dead ends: 124 [2025-03-08 15:58:43,320 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 15:58:43,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-08 15:58:43,324 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:58:43,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:58:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 15:58:43,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 15:58:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 15:58:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2025-03-08 15:58:43,356 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 143 [2025-03-08 15:58:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:58:43,356 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2025-03-08 15:58:43,356 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 15:58:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2025-03-08 15:58:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 15:58:43,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:58:43,358 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:58:43,367 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-08 15:58:43,559 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-08 15:58:43,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:58:43,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:58:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1738540718, now seen corresponding path program 1 times [2025-03-08 15:58:43,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:58:43,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255926484] [2025-03-08 15:58:43,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:43,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:58:43,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 15:58:43,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 15:58:43,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:43,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:58:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 15:58:44,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:58:44,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255926484] [2025-03-08 15:58:44,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255926484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:58:44,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582289774] [2025-03-08 15:58:44,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:44,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:58:44,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:58:44,258 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-08 15:58:44,263 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-08 15:58:44,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 15:58:44,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 15:58:44,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:44,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:58:44,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 15:58:44,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:58:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-08 15:58:44,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:58:44,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582289774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:58:44,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:58:44,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 15 [2025-03-08 15:58:44,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016426029] [2025-03-08 15:58:44,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:58:44,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:58:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:58:44,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:58:44,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:58:44,944 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 15:58:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:58:46,081 INFO L93 Difference]: Finished difference Result 397 states and 587 transitions. [2025-03-08 15:58:46,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-08 15:58:46,082 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-08 15:58:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:58:46,087 INFO L225 Difference]: With dead ends: 397 [2025-03-08 15:58:46,088 INFO L226 Difference]: Without dead ends: 338 [2025-03-08 15:58:46,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=443, Invalid=1627, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 15:58:46,090 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 272 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:58:46,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 588 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:58:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-08 15:58:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 196. [2025-03-08 15:58:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 119 states have internal predecessors, (156), 69 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-08 15:58:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 294 transitions. [2025-03-08 15:58:46,148 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 294 transitions. Word has length 143 [2025-03-08 15:58:46,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:58:46,148 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 294 transitions. [2025-03-08 15:58:46,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 15:58:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 294 transitions. [2025-03-08 15:58:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 15:58:46,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:58:46,149 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:58:46,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:58:46,356 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,SelfDestructingSolverStorable1 [2025-03-08 15:58:46,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:58:46,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:58:46,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1709911567, now seen corresponding path program 1 times [2025-03-08 15:58:46,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:58:46,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479944002] [2025-03-08 15:58:46,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:46,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:58:46,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 15:58:46,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 15:58:46,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:46,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:58:46,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160564998] [2025-03-08 15:58:46,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:46,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:58:46,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:58:46,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:58:46,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:58:46,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 15:58:47,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 15:58:47,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:47,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:58:47,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:58:47,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 15:58:47,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 15:58:47,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:47,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:58:47,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:58:47,164 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:58:47,165 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:58:47,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 15:58:47,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:58:47,369 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 15:58:47,441 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:58:47,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:58:47 BoogieIcfgContainer [2025-03-08 15:58:47,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:58:47,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:58:47,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:58:47,444 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:58:47,447 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:58:42" (3/4) ... [2025-03-08 15:58:47,448 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:58:47,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:58:47,449 INFO L158 Benchmark]: Toolchain (without parser) took 5387.65ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 126.7MB in the end (delta: -4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:58:47,450 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:58:47,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.07ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 108.3MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:58:47,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.55ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 104.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:58:47,451 INFO L158 Benchmark]: Boogie Preprocessor took 43.19ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 97.3MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:58:47,452 INFO L158 Benchmark]: IcfgBuilder took 362.26ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 74.8MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 15:58:47,452 INFO L158 Benchmark]: TraceAbstraction took 4701.02ms. Allocated memory is still 167.8MB. Free memory was 74.0MB in the beginning and 128.2MB in the end (delta: -54.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2025-03-08 15:58:47,452 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 167.8MB. Free memory was 126.7MB in the beginning and 126.7MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:58:47,453 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.18ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.07ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 108.3MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.55ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 104.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.19ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 97.3MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 362.26ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 74.8MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4701.02ms. Allocated memory is still 167.8MB. Free memory was 74.0MB in the beginning and 128.2MB in the end (delta: -54.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 167.8MB. Free memory was 126.7MB in the beginning and 126.7MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryArithmeticFLOAToperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 999999999.675; [L23] signed long int var_1_4 = -5; [L24] float var_1_5 = 7.875; [L25] float var_1_6 = 99.04; [L26] signed long int var_1_7 = -2; [L27] unsigned long int var_1_9 = 1; [L28] double var_1_10 = 63.25; [L29] unsigned char var_1_11 = 0; [L30] unsigned short int var_1_13 = 0; [L31] unsigned short int var_1_15 = 17766; [L32] unsigned short int var_1_16 = 28149; [L33] unsigned char var_1_19 = 4; [L34] unsigned char var_1_20 = 50; [L35] unsigned char var_1_21 = 64; [L36] unsigned char var_1_22 = 50; [L37] unsigned char var_1_23 = 5; [L38] unsigned char var_1_24 = 128; [L39] signed long int var_1_25 = -16; [L40] unsigned char var_1_26 = 0; [L41] unsigned short int last_1_var_1_13 = 0; VAL [isInitial=0, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L127] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L137] RET updateLastVariables() [L138] CALL updateVariables() [L90] var_1_4 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L91] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L92] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L93] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L94] var_1_5 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L95] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L96] var_1_6 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L97] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L98] var_1_10 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L99] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L100] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L101] var_1_11 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L103] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L103] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L104] var_1_15 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_15 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L105] RET assume_abort_if_not(var_1_15 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L106] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L107] var_1_16 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L108] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L109] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L110] var_1_20 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_20 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L111] RET assume_abort_if_not(var_1_20 >= 32) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L112] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L113] var_1_21 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_21 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L114] RET assume_abort_if_not(var_1_21 >= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L115] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L116] var_1_22 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L117] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_22 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L118] RET assume_abort_if_not(var_1_22 <= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L119] var_1_23 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L120] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L121] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L122] var_1_24 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_24 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L123] RET assume_abort_if_not(var_1_24 >= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L124] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L138] RET updateVariables() [L139] CALL step() [L45] COND TRUE last_1_var_1_13 == (last_1_var_1_13 % var_1_4) [L46] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L48] COND FALSE !(var_1_10 == var_1_1) [L55] var_1_19 = var_1_24 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L57] COND FALSE !(var_1_19 < (var_1_21 / var_1_20)) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L64] COND TRUE var_1_1 >= var_1_6 [L65] var_1_7 = var_1_19 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L67] COND FALSE !(((var_1_6 * var_1_5) / var_1_10) > var_1_1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L74] COND FALSE !(var_1_7 < var_1_9) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L77] COND FALSE !((25.3 * var_1_5) != var_1_1) [L86] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=63, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L139] RET step() [L140] CALL, EXPR property() [L130-L131] return (((((((last_1_var_1_13 == (last_1_var_1_13 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((var_1_1 >= var_1_6) ? (var_1_7 == ((signed long int) var_1_19)) : 1)) && ((((var_1_6 * var_1_5) / var_1_10) > var_1_1) ? (var_1_11 ? (var_1_9 == ((unsigned long int) var_1_26)) : (var_1_9 == ((unsigned long int) var_1_26))) : 1)) && ((var_1_7 < var_1_9) ? (var_1_13 == ((unsigned short int) (var_1_26 + (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - (var_1_19 + var_1_19))))) : 1)) && ((var_1_10 == var_1_1) ? (var_1_11 ? (var_1_19 == ((unsigned char) (((32 + var_1_20) + var_1_21) - (var_1_22 + var_1_23)))) : (var_1_19 == ((unsigned char) (var_1_24 - var_1_23)))) : (var_1_19 == ((unsigned char) var_1_24)))) && (((25.3 * var_1_5) != var_1_1) ? (var_1_11 ? ((var_1_15 <= var_1_13) ? (var_1_25 == ((signed long int) var_1_26)) : 1) : (var_1_25 == ((signed long int) var_1_22))) : (var_1_25 == ((signed long int) var_1_20)))) && ((var_1_19 < (var_1_21 / var_1_20)) ? ((var_1_19 > var_1_19) ? (var_1_26 == ((unsigned char) ((((((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) > (var_1_23)) ? (((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) : (var_1_23))))) : (var_1_26 == ((unsigned char) var_1_22))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=63, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=63, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, var_1_11=256, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=-255, var_1_23=-256, var_1_24=127, var_1_25=63, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 124 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 683 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 480 mSDsCounter, 184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 640 IncrementalHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 184 mSolverCounterUnsat, 203 mSDtfsCounter, 640 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=2, InterpolantAutomatonStates: 44, 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, 2 MinimizatonAttempts, 142 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 858 NumberOfCodeBlocks, 858 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 1180 SizeOfPredicates, 4 NumberOfNonLiveVariables, 636 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 4001/4048 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-08 15:58:47,471 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_operatoramount_amount50_file-8.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 62bf3dfe88b7b7f16a2317bf4b03356735885070ddf7d29f329649cb5fd7ab4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:58:49,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:58:49,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:58:49,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:58:49,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:58:49,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:58:49,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:58:49,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:58:49,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:58:49,414 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:58:49,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:58:49,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:58:49,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:58:49,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:58:49,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:58:49,416 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:58:49,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:58:49,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:58:49,416 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 -> 62bf3dfe88b7b7f16a2317bf4b03356735885070ddf7d29f329649cb5fd7ab4b [2025-03-08 15:58:49,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:58:49,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:58:49,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:58:49,673 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:58:49,673 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:58:49,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-8.i [2025-03-08 15:58:50,854 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889fec2cb/4a9ad830eef5411fa82cf41c91a8eaef/FLAG0379904b1 [2025-03-08 15:58:51,029 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:58:51,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-8.i [2025-03-08 15:58:51,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889fec2cb/4a9ad830eef5411fa82cf41c91a8eaef/FLAG0379904b1 [2025-03-08 15:58:51,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889fec2cb/4a9ad830eef5411fa82cf41c91a8eaef [2025-03-08 15:58:51,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:58:51,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:58:51,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:58:51,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:58:51,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:58:51,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1deb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51, skipping insertion in model container [2025-03-08 15:58:51,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:58:51,539 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_operatoramount_amount50_file-8.i[914,927] [2025-03-08 15:58:51,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:58:51,592 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:58:51,600 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_operatoramount_amount50_file-8.i[914,927] [2025-03-08 15:58:51,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:58:51,631 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:58:51,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51 WrapperNode [2025-03-08 15:58:51,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:58:51,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:58:51,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:58:51,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:58:51,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,678 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-08 15:58:51,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:58:51,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:58:51,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:58:51,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:58:51,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,706 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-08 15:58:51,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:58:51,734 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:58:51,734 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:58:51,737 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:58:51,739 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (1/1) ... [2025-03-08 15:58:51,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:58:51,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:58:51,769 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-08 15:58:51,773 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-08 15:58:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:58:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:58:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:58:51,792 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:58:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:58:51,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:58:51,852 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:58:51,854 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:59:14,125 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:59:14,126 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:59:14,133 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:59:14,133 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:59:14,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:59:14 BoogieIcfgContainer [2025-03-08 15:59:14,133 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:59:14,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:59:14,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:59:14,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:59:14,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:58:51" (1/3) ... [2025-03-08 15:59:14,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce81089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:59:14, skipping insertion in model container [2025-03-08 15:59:14,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:51" (2/3) ... [2025-03-08 15:59:14,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce81089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:59:14, skipping insertion in model container [2025-03-08 15:59:14,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:59:14" (3/3) ... [2025-03-08 15:59:14,140 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-8.i [2025-03-08 15:59:14,167 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:59:14,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-8.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:59:14,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:59:14,215 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;@17b5da61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:59:14,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:59:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 15:59:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 15:59:14,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:59:14,225 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:59:14,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:59:14,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:59:14,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2052454261, now seen corresponding path program 1 times [2025-03-08 15:59:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:59:14,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286669114] [2025-03-08 15:59:14,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:59:14,236 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-08 15:59:14,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:59:14,239 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-08 15:59:14,240 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-08 15:59:14,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 15:59:15,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 15:59:15,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:59:15,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:59:15,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:59:15,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:59:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2025-03-08 15:59:15,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:59:15,197 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:59:15,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286669114] [2025-03-08 15:59:15,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286669114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:59:15,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:59:15,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:59:15,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964276269] [2025-03-08 15:59:15,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:59:15,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:59:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:59:15,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:59:15,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:59:15,219 INFO L87 Difference]: Start difference. First operand has 65 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 15:59:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:59:15,237 INFO L93 Difference]: Finished difference Result 124 states and 220 transitions. [2025-03-08 15:59:15,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:59:15,238 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-08 15:59:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:59:15,246 INFO L225 Difference]: With dead ends: 124 [2025-03-08 15:59:15,246 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 15:59:15,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-08 15:59:15,252 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:59:15,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:59:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 15:59:15,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 15:59:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 15:59:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2025-03-08 15:59:15,285 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 143 [2025-03-08 15:59:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:59:15,285 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2025-03-08 15:59:15,285 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 15:59:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2025-03-08 15:59:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 15:59:15,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:59:15,287 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:59:15,314 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-08 15:59:15,488 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-08 15:59:15,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:59:15,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:59:15,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1738540718, now seen corresponding path program 1 times [2025-03-08 15:59:15,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:59:15,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221033681] [2025-03-08 15:59:15,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:59:15,489 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-08 15:59:15,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:59:15,492 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-08 15:59:15,493 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-08 15:59:15,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 15:59:16,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 15:59:16,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:59:16,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:59:16,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 15:59:16,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:59:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 148 proven. 3 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-08 15:59:23,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:59:25,198 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:59:25,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221033681] [2025-03-08 15:59:25,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221033681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:59:25,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [37316530] [2025-03-08 15:59:25,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:59:25,199 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 15:59:25,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 15:59:25,201 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 15:59:25,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-08 15:59:25,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 15:59:26,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 15:59:26,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:59:26,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:59:26,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:59:26,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:59:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 148 proven. 3 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-08 15:59:32,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:59:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [37316530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:59:33,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:59:33,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-03-08 15:59:33,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966917158] [2025-03-08 15:59:33,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:59:33,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:59:33,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:59:33,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:59:33,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:59:33,604 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 15:59:45,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 15:59:49,193 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 [0] [2025-03-08 15:59:53,199 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 [0] [2025-03-08 15:59:57,204 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-08 16:00:01,207 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-08 16:00:05,210 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-08 16:00:09,212 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 [0] [2025-03-08 16:00:13,230 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-08 16:00:17,237 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-08 16:00:21,259 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 [0] [2025-03-08 16:00:25,264 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 []