./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.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_amount100_file-27.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 00bef7012df83cfea6557911ccded0b7d229289545c394298f9cdde0162b421c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:04:27,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:04:27,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:04:27,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:04:27,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:04:27,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:04:27,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:04:27,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:04:27,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:04:27,097 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:04:27,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:04:27,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:04:27,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:04:27,098 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:04:27,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:04:27,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:04:27,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:04:27,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:04:27,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:04:27,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:04:27,099 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:04:27,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:04:27,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:04:27,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:04:27,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:04:27,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:04:27,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:04:27,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:04:27,099 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 -> 00bef7012df83cfea6557911ccded0b7d229289545c394298f9cdde0162b421c [2025-03-08 15:04:27,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:04:27,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:04:27,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:04:27,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:04:27,332 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:04:27,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i [2025-03-08 15:04:28,457 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0c637ac/64d8adcbcab04e018136832d19c2cc33/FLAG7d5f46fa6 [2025-03-08 15:04:28,716 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:04:28,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i [2025-03-08 15:04:28,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0c637ac/64d8adcbcab04e018136832d19c2cc33/FLAG7d5f46fa6 [2025-03-08 15:04:29,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0c637ac/64d8adcbcab04e018136832d19c2cc33 [2025-03-08 15:04:29,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:04:29,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:04:29,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:04:29,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:04:29,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:04:29,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:04:29" (1/1) ... [2025-03-08 15:04:29,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bef629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29, skipping insertion in model container [2025-03-08 15:04:29,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:04:29" (1/1) ... [2025-03-08 15:04:29,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:04:29,152 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_amount100_file-27.i[916,929] [2025-03-08 15:04:29,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:04:29,231 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:04:29,241 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_amount100_file-27.i[916,929] [2025-03-08 15:04:29,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:04:29,283 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:04:29,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29 WrapperNode [2025-03-08 15:04:29,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:04:29,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:04:29,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:04:29,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:04:29,291 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:04:29" (1/1) ... [2025-03-08 15:04:29,299 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:04:29" (1/1) ... [2025-03-08 15:04:29,323 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2025-03-08 15:04:29,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:04:29,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:04:29,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:04:29,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:04:29,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29" (1/1) ... [2025-03-08 15:04:29,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29" (1/1) ... [2025-03-08 15:04:29,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29" (1/1) ... [2025-03-08 15:04:29,347 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:04:29,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29" (1/1) ... [2025-03-08 15:04:29,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29" (1/1) ... [2025-03-08 15:04:29,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29" (1/1) ... [2025-03-08 15:04:29,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29" (1/1) ... [2025-03-08 15:04:29,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29" (1/1) ... [2025-03-08 15:04:29,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29" (1/1) ... [2025-03-08 15:04:29,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:04:29,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:04:29,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:04:29,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:04:29,382 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29" (1/1) ... [2025-03-08 15:04:29,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:04:29,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:04:29,407 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:04:29,409 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:04:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:04:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:04:29,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:04:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:04:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:04:29,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:04:29,494 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:04:29,496 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:04:29,810 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L182: havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2025-03-08 15:04:29,836 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 15:04:29,836 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:04:29,852 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:04:29,853 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:04:29,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:04:29 BoogieIcfgContainer [2025-03-08 15:04:29,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:04:29,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:04:29,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:04:29,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:04:29,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:04:29" (1/3) ... [2025-03-08 15:04:29,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13984020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:04:29, skipping insertion in model container [2025-03-08 15:04:29,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:29" (2/3) ... [2025-03-08 15:04:29,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13984020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:04:29, skipping insertion in model container [2025-03-08 15:04:29,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:04:29" (3/3) ... [2025-03-08 15:04:29,862 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-27.i [2025-03-08 15:04:29,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:04:29,874 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-27.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:04:29,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:04:29,926 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;@7d7c81f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:04:29,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:04:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 64 states have (on average 1.421875) internal successors, (91), 65 states have internal predecessors, (91), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 15:04:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 15:04:29,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:29,942 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:29,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:29,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:29,946 INFO L85 PathProgramCache]: Analyzing trace with hash 672213506, now seen corresponding path program 1 times [2025-03-08 15:04:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:29,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538563460] [2025-03-08 15:04:29,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:30,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 15:04:30,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 15:04:30,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:30,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 15:04:30,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:30,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538563460] [2025-03-08 15:04:30,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538563460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:04:30,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437330134] [2025-03-08 15:04:30,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:30,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:04:30,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:04:30,259 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:04:30,261 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:04:30,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 15:04:30,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 15:04:30,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:30,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:30,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:04:30,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:04:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 15:04:30,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:04:30,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437330134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:30,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:04:30,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:04:30,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204042057] [2025-03-08 15:04:30,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:30,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:04:30,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:30,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:04:30,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:04:30,464 INFO L87 Difference]: Start difference. First operand has 94 states, 64 states have (on average 1.421875) internal successors, (91), 65 states have internal predecessors, (91), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 15:04:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:30,495 INFO L93 Difference]: Finished difference Result 182 states and 312 transitions. [2025-03-08 15:04:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:04:30,497 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 180 [2025-03-08 15:04:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:30,502 INFO L225 Difference]: With dead ends: 182 [2025-03-08 15:04:30,503 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 15:04:30,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 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:04:30,509 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:30,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:04:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 15:04:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 15:04:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 15:04:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2025-03-08 15:04:30,548 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 180 [2025-03-08 15:04:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:30,548 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2025-03-08 15:04:30,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 15:04:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2025-03-08 15:04:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 15:04:30,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:30,553 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:30,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:04:30,757 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:04:30,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:30,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:30,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2085569020, now seen corresponding path program 1 times [2025-03-08 15:04:30,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:30,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600240153] [2025-03-08 15:04:30,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:30,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:30,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 15:04:30,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 15:04:30,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:30,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 15:04:30,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:30,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600240153] [2025-03-08 15:04:30,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600240153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:30,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:30,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:04:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974960250] [2025-03-08 15:04:30,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:30,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:04:30,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:30,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:04:30,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:04:30,990 INFO L87 Difference]: Start difference. First operand 91 states and 139 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 15:04:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:31,074 INFO L93 Difference]: Finished difference Result 263 states and 403 transitions. [2025-03-08 15:04:31,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:04:31,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-03-08 15:04:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:31,078 INFO L225 Difference]: With dead ends: 263 [2025-03-08 15:04:31,079 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 15:04:31,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:04:31,081 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 129 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:31,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 275 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:04:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 15:04:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 102. [2025-03-08 15:04:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 15:04:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 153 transitions. [2025-03-08 15:04:31,100 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 153 transitions. Word has length 181 [2025-03-08 15:04:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:31,102 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 153 transitions. [2025-03-08 15:04:31,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 15:04:31,102 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 153 transitions. [2025-03-08 15:04:31,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 15:04:31,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:31,104 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:31,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:04:31,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:31,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:31,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1850234036, now seen corresponding path program 1 times [2025-03-08 15:04:31,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:31,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865622738] [2025-03-08 15:04:31,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:31,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:31,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:04:31,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:04:31,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:31,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-08 15:04:32,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:32,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865622738] [2025-03-08 15:04:32,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865622738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:04:32,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246352873] [2025-03-08 15:04:32,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:32,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:04:32,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:04:32,070 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:04:32,071 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:04:32,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:04:32,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:04:32,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:32,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:32,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 15:04:32,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:04:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 861 proven. 261 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-08 15:04:34,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:04:35,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246352873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:04:35,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:04:35,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 24] total 27 [2025-03-08 15:04:35,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647708863] [2025-03-08 15:04:35,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:04:35,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 15:04:35,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:35,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 15:04:35,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 15:04:35,780 INFO L87 Difference]: Start difference. First operand 102 states and 153 transitions. Second operand has 27 states, 27 states have (on average 4.333333333333333) internal successors, (117), 25 states have internal predecessors, (117), 9 states have call successors, (53), 8 states have call predecessors, (53), 13 states have return successors, (54), 9 states have call predecessors, (54), 9 states have call successors, (54) [2025-03-08 15:04:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:37,833 INFO L93 Difference]: Finished difference Result 330 states and 455 transitions. [2025-03-08 15:04:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-08 15:04:37,834 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.333333333333333) internal successors, (117), 25 states have internal predecessors, (117), 9 states have call successors, (53), 8 states have call predecessors, (53), 13 states have return successors, (54), 9 states have call predecessors, (54), 9 states have call successors, (54) Word has length 182 [2025-03-08 15:04:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:37,836 INFO L225 Difference]: With dead ends: 330 [2025-03-08 15:04:37,836 INFO L226 Difference]: Without dead ends: 231 [2025-03-08 15:04:37,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1351, Invalid=5621, Unknown=0, NotChecked=0, Total=6972 [2025-03-08 15:04:37,839 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 555 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1883 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:37,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 910 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:04:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-08 15:04:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 200. [2025-03-08 15:04:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 146 states have internal predecessors, (182), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 15:04:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 262 transitions. [2025-03-08 15:04:37,861 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 262 transitions. Word has length 182 [2025-03-08 15:04:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:37,862 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 262 transitions. [2025-03-08 15:04:37,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.333333333333333) internal successors, (117), 25 states have internal predecessors, (117), 9 states have call successors, (53), 8 states have call predecessors, (53), 13 states have return successors, (54), 9 states have call predecessors, (54), 9 states have call successors, (54) [2025-03-08 15:04:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2025-03-08 15:04:37,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 15:04:37,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:37,864 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:37,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:04:38,068 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,SelfDestructingSolverStorable2 [2025-03-08 15:04:38,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:38,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1939174635, now seen corresponding path program 1 times [2025-03-08 15:04:38,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:38,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556244601] [2025-03-08 15:04:38,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:38,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:38,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:04:38,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:04:38,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:38,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 48 proven. 102 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2025-03-08 15:04:38,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:38,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556244601] [2025-03-08 15:04:38,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556244601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:04:38,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630350921] [2025-03-08 15:04:38,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:38,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:04:38,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:04:38,668 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:04:38,670 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:04:38,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:04:38,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:04:38,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:38,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:38,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 15:04:38,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:04:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 842 proven. 159 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-03-08 15:04:39,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:04:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 57 proven. 168 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-03-08 15:04:40,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630350921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:04:40,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:04:40,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 34 [2025-03-08 15:04:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035587573] [2025-03-08 15:04:40,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:04:40,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 15:04:40,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:40,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 15:04:40,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 15:04:40,229 INFO L87 Difference]: Start difference. First operand 200 states and 262 transitions. Second operand has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 12 states have call successors, (81), 5 states have call predecessors, (81), 11 states have return successors, (81), 9 states have call predecessors, (81), 12 states have call successors, (81) [2025-03-08 15:04:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:41,535 INFO L93 Difference]: Finished difference Result 772 states and 1029 transitions. [2025-03-08 15:04:41,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 15:04:41,536 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 12 states have call successors, (81), 5 states have call predecessors, (81), 11 states have return successors, (81), 9 states have call predecessors, (81), 12 states have call successors, (81) Word has length 182 [2025-03-08 15:04:41,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:41,544 INFO L225 Difference]: With dead ends: 772 [2025-03-08 15:04:41,544 INFO L226 Difference]: Without dead ends: 575 [2025-03-08 15:04:41,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=642, Invalid=2114, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 15:04:41,546 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 1341 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:41,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 913 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:04:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-08 15:04:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 425. [2025-03-08 15:04:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 316 states have (on average 1.2879746835443038) internal successors, (407), 318 states have internal predecessors, (407), 80 states have call successors, (80), 28 states have call predecessors, (80), 28 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 15:04:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 567 transitions. [2025-03-08 15:04:41,598 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 567 transitions. Word has length 182 [2025-03-08 15:04:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:41,599 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 567 transitions. [2025-03-08 15:04:41,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 12 states have call successors, (81), 5 states have call predecessors, (81), 11 states have return successors, (81), 9 states have call predecessors, (81), 12 states have call successors, (81) [2025-03-08 15:04:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 567 transitions. [2025-03-08 15:04:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 15:04:41,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:41,602 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:41,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:04:41,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:04:41,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:41,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2089124469, now seen corresponding path program 1 times [2025-03-08 15:04:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:41,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428232238] [2025-03-08 15:04:41,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:41,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:04:41,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:04:41,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:41,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:04:41,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545640616] [2025-03-08 15:04:41,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:41,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:04:41,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:04:41,909 INFO L229 MonitoredProcess]: Starting monitored process 5 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:04:41,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:04:41,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:04:42,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:04:42,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:42,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:42,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 15:04:42,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:04:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 152 proven. 147 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2025-03-08 15:04:42,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:04:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 3 proven. 150 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2025-03-08 15:04:42,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:04:42,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428232238] [2025-03-08 15:04:42,654 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 15:04:42,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545640616] [2025-03-08 15:04:42,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545640616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:04:42,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:04:42,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-08 15:04:42,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818635693] [2025-03-08 15:04:42,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:04:42,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:04:42,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:04:42,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:04:42,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:04:42,656 INFO L87 Difference]: Start difference. First operand 425 states and 567 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 4 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 4 states have call successors, (54) [2025-03-08 15:04:43,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:43,016 INFO L93 Difference]: Finished difference Result 855 states and 1139 transitions. [2025-03-08 15:04:43,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:04:43,016 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 4 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 4 states have call successors, (54) Word has length 182 [2025-03-08 15:04:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:43,020 INFO L225 Difference]: With dead ends: 855 [2025-03-08 15:04:43,023 INFO L226 Difference]: Without dead ends: 433 [2025-03-08 15:04:43,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:04:43,024 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 322 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:04:43,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 457 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:04:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-08 15:04:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 425. [2025-03-08 15:04:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 316 states have (on average 1.2816455696202531) internal successors, (405), 318 states have internal predecessors, (405), 80 states have call successors, (80), 28 states have call predecessors, (80), 28 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 15:04:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 565 transitions. [2025-03-08 15:04:43,061 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 565 transitions. Word has length 182 [2025-03-08 15:04:43,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:43,062 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 565 transitions. [2025-03-08 15:04:43,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 4 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 4 states have call successors, (54) [2025-03-08 15:04:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 565 transitions. [2025-03-08 15:04:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 15:04:43,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:43,063 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:43,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 15:04:43,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:04:43,264 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:43,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:43,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1127510452, now seen corresponding path program 1 times [2025-03-08 15:04:43,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:04:43,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107165289] [2025-03-08 15:04:43,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:43,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:04:43,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:04:43,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:04:43,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:43,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:04:43,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114738338] [2025-03-08 15:04:43,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:43,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:04:43,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:04:43,394 INFO L229 MonitoredProcess]: Starting monitored process 6 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:04:43,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 15:04:43,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:04:43,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:04:43,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:43,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:04:43,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:04:43,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:04:43,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:04:43,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:43,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:04:43,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:04:43,744 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:04:43,745 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:04:43,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 15:04:43,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:04:43,950 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 15:04:44,035 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:04:44,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:04:44 BoogieIcfgContainer [2025-03-08 15:04:44,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:04:44,040 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:04:44,040 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:04:44,041 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:04:44,041 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:04:29" (3/4) ... [2025-03-08 15:04:44,043 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:04:44,044 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:04:44,044 INFO L158 Benchmark]: Toolchain (without parser) took 15011.47ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 121.5MB in the beginning and 160.7MB in the end (delta: -39.2MB). Peak memory consumption was 182.9MB. Max. memory is 16.1GB. [2025-03-08 15:04:44,045 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:04:44,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.46ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 105.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:04:44,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.37ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 100.4MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:04:44,046 INFO L158 Benchmark]: Boogie Preprocessor took 55.18ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 94.1MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:04:44,046 INFO L158 Benchmark]: IcfgBuilder took 473.14ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 59.6MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 15:04:44,046 INFO L158 Benchmark]: TraceAbstraction took 14183.96ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 58.7MB in the beginning and 160.8MB in the end (delta: -102.1MB). Peak memory consumption was 115.8MB. Max. memory is 16.1GB. [2025-03-08 15:04:44,047 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 385.9MB. Free memory was 160.8MB in the beginning and 160.7MB in the end (delta: 119.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:04:44,048 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.71ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.46ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 105.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.37ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 100.4MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.18ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 94.1MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 473.14ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 59.6MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14183.96ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 58.7MB in the beginning and 160.8MB in the end (delta: -102.1MB). Peak memory consumption was 115.8MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 385.9MB. Free memory was 160.8MB in the beginning and 160.7MB in the end (delta: 119.9kB). Peak memory consumption was 8.4MB. 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 182, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 171, overapproximation of someUnaryDOUBLEoperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 182. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_3 = 25; [L24] signed char var_1_4 = 10; [L25] signed char var_1_5 = -10; [L26] signed char var_1_6 = -1; [L27] signed short int var_1_7 = -4; [L28] signed char var_1_8 = 50; [L29] signed short int var_1_9 = 2; [L30] unsigned long int var_1_10 = 128; [L31] unsigned char var_1_11 = 2; [L32] unsigned long int var_1_12 = 2781423228; [L33] unsigned long int var_1_13 = 3552320529; [L34] double var_1_14 = 2.25; [L35] unsigned char var_1_15 = 5; [L36] unsigned char var_1_16 = 64; [L37] double var_1_17 = 9.48; [L38] double var_1_18 = 256.05; [L39] float var_1_19 = 1.1; [L40] float var_1_21 = 16.5; [L41] float var_1_22 = 9.4; [L42] unsigned short int var_1_23 = 100; [L43] unsigned char var_1_24 = 5; [L44] unsigned short int var_1_25 = 4; [L45] unsigned short int var_1_26 = 48215; [L46] unsigned short int var_1_27 = 10; [L47] unsigned short int var_1_28 = 1; [L48] signed char var_1_29 = 0; [L49] unsigned long int var_1_30 = 1524073358; [L50] unsigned char var_1_31 = 1; [L51] double var_1_32 = 64.45; VAL [isInitial=0, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=25, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] FCALL updateLastVariables() [L190] CALL updateVariables() [L136] var_1_3 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L138] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L138] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L139] var_1_4 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L140] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L141] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L141] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L142] var_1_5 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L143] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L144] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L144] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L145] var_1_6 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_6 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L146] RET assume_abort_if_not(var_1_6 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L147] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L147] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L148] var_1_11 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L149] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L150] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L150] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L151] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L151] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L152] var_1_12 = __VERIFIER_nondet_ulong() [L153] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L153] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L154] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L154] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L155] var_1_13 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_13 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L156] RET assume_abort_if_not(var_1_13 >= 3221225470) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L157] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L157] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L158] var_1_15 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L159] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L160] CALL assume_abort_if_not(var_1_15 <= 128) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L160] RET assume_abort_if_not(var_1_15 <= 128) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L161] var_1_16 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L162] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L163] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L163] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L164] var_1_17 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L165] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L166] var_1_18 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L167] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L168] var_1_21 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L169] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L170] var_1_22 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L171] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L172] var_1_26 = __VERIFIER_nondet_ushort() [L173] CALL assume_abort_if_not(var_1_26 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L173] RET assume_abort_if_not(var_1_26 >= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L174] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L174] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L175] var_1_30 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_30 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L176] RET assume_abort_if_not(var_1_30 >= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L177] CALL assume_abort_if_not(var_1_30 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L177] RET assume_abort_if_not(var_1_30 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L190] RET updateVariables() [L191] CALL step() [L55] var_1_7 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) [L56] signed long int stepLocal_0 = 128 - 256; VAL [isInitial=1, stepLocal_0=-128, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=50, var_1_9=2] [L57] COND FALSE !((var_1_4 * var_1_3) < stepLocal_0) [L60] var_1_8 = -16 VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=2] [L62] var_1_9 = var_1_6 [L63] signed char stepLocal_4 = var_1_4; VAL [isInitial=1, stepLocal_4=0, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L64] COND TRUE var_1_12 >= stepLocal_4 [L65] var_1_23 = var_1_16 VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L67] var_1_24 = (var_1_16 + var_1_3) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L68] COND TRUE var_1_8 != (var_1_11 + var_1_5) [L69] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L71] var_1_31 = 0 [L72] var_1_32 = var_1_17 VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=2, var_1_19=11/10, var_1_1=32, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L73] COND FALSE !(! (! var_1_31)) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=2, var_1_19=11/10, var_1_1=32, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L76] COND FALSE !(\read(var_1_31)) [L79] var_1_1 = var_1_4 VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=2, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L82] signed long int stepLocal_1 = (var_1_9 * 128) / var_1_11; VAL [isInitial=1, stepLocal_1=-73, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=2, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L83] COND FALSE !(\read(var_1_31)) [L90] var_1_10 = var_1_13 VAL [isInitial=1, stepLocal_1=-73, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=2, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L92] signed long int stepLocal_2 = (- var_1_11) / (var_1_15 + var_1_16); VAL [isInitial=1, stepLocal_1=-73, stepLocal_2=-2, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=2, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L93] COND TRUE stepLocal_2 <= var_1_3 [L94] var_1_14 = ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))) VAL [isInitial=1, stepLocal_1=-73, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L100] unsigned long int stepLocal_5 = var_1_13; VAL [isInitial=1, stepLocal_1=-73, stepLocal_5=7516192766, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L101] COND FALSE !((~ var_1_10) >= stepLocal_5) VAL [isInitial=1, stepLocal_1=-73, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L104] COND TRUE -16 <= var_1_27 VAL [isInitial=1, stepLocal_1=-73, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L105] COND TRUE var_1_5 == var_1_28 [L106] var_1_25 = ((((var_1_4) > (var_1_8)) ? (var_1_4) : (var_1_8))) VAL [isInitial=1, stepLocal_1=-73, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L111] unsigned long int stepLocal_3 = var_1_10; VAL [isInitial=1, stepLocal_1=-73, stepLocal_3=7516192766, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L112] COND FALSE !(\read(var_1_31)) [L119] var_1_19 = var_1_22 VAL [isInitial=1, stepLocal_1=-73, stepLocal_3=7516192766, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L121] EXPR (var_1_6 / var_1_11) | var_1_5 VAL [isInitial=1, stepLocal_1=-73, stepLocal_3=7516192766, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L121] COND FALSE !((var_1_16 + var_1_3) < ((var_1_6 / var_1_11) | var_1_5)) [L126] COND FALSE !(((((var_1_19 + var_1_22) < 0 ) ? -(var_1_19 + var_1_22) : (var_1_19 + var_1_22))) < var_1_18) [L131] var_1_29 = var_1_6 VAL [isInitial=1, stepLocal_1=-73, stepLocal_3=7516192766, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=-52, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L191] RET step() [L192] CALL, EXPR property() [L182] EXPR (((((((((((((! (! var_1_31)) ? (var_1_1 == ((signed char) ((((((var_1_3 - var_1_4)) > (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))) + var_1_6))) : (var_1_31 ? (var_1_1 == ((signed char) var_1_3)) : (var_1_1 == ((signed char) var_1_4)))) && (var_1_7 == ((signed short int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))))) && (((var_1_4 * var_1_3) < (128 - 256)) ? (var_1_8 == ((signed char) (var_1_4 - 4))) : (var_1_8 == ((signed char) -16)))) && (var_1_9 == ((signed short int) var_1_6))) && (var_1_31 ? ((((var_1_9 * 128) / var_1_11) != (((((var_1_4 - var_1_3)) > (var_1_1)) ? ((var_1_4 - var_1_3)) : (var_1_1)))) ? (var_1_10 == ((unsigned long int) (((((var_1_12) < ((var_1_13 - var_1_3))) ? (var_1_12) : ((var_1_13 - var_1_3)))) - var_1_4))) : (var_1_10 == ((unsigned long int) var_1_11))) : (var_1_10 == ((unsigned long int) var_1_13)))) && ((((- var_1_11) / (var_1_15 + var_1_16)) <= var_1_3) ? (var_1_14 == ((double) ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))))) : (var_1_31 ? (var_1_14 == ((double) var_1_17)) : 1))) && (var_1_31 ? ((var_1_10 < (var_1_15 + (var_1_13 + var_1_25))) ? (var_1_19 == ((float) (var_1_21 - (var_1_22 + 8.25f)))) : (var_1_19 == ((float) var_1_18))) : (var_1_19 == ((float) var_1_22)))) && ((var_1_12 >= var_1_4) ? (var_1_23 == ((unsigned short int) var_1_16)) : 1)) && (var_1_24 == ((unsigned char) (var_1_16 + var_1_3)))) && ((-16 <= var_1_27) ? ((var_1_5 == var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) > (var_1_8)) ? (var_1_4) : (var_1_8))))) : 1) : (var_1_25 == ((unsigned short int) (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))) - var_1_4))))) && ((var_1_8 != (var_1_11 + var_1_5)) ? (var_1_27 == ((unsigned short int) var_1_15)) : 1)) && (((~ var_1_10) >= var_1_13) ? (var_1_28 == ((unsigned short int) (var_1_26 - var_1_4))) : 1)) && (((var_1_16 + var_1_3) < ((var_1_6 / var_1_11) | var_1_5)) ? (((3214144168u - (var_1_30 - var_1_10)) != (- var_1_27)) ? (var_1_29 == ((signed char) (((((var_1_3 + var_1_5)) > (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((var_1_3 + var_1_5)) : (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))))) : 1) : ((((((var_1_19 + var_1_22) < 0 ) ? -(var_1_19 + var_1_22) : (var_1_19 + var_1_22))) < var_1_18) ? ((var_1_22 <= var_1_19) ? (var_1_29 == ((signed char) var_1_4)) : 1) : (var_1_29 == ((signed char) var_1_6)))) VAL [isInitial=1, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=-52, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L182-L183] return (((((((((((((((! (! var_1_31)) ? (var_1_1 == ((signed char) ((((((var_1_3 - var_1_4)) > (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))) + var_1_6))) : (var_1_31 ? (var_1_1 == ((signed char) var_1_3)) : (var_1_1 == ((signed char) var_1_4)))) && (var_1_7 == ((signed short int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))))) && (((var_1_4 * var_1_3) < (128 - 256)) ? (var_1_8 == ((signed char) (var_1_4 - 4))) : (var_1_8 == ((signed char) -16)))) && (var_1_9 == ((signed short int) var_1_6))) && (var_1_31 ? ((((var_1_9 * 128) / var_1_11) != (((((var_1_4 - var_1_3)) > (var_1_1)) ? ((var_1_4 - var_1_3)) : (var_1_1)))) ? (var_1_10 == ((unsigned long int) (((((var_1_12) < ((var_1_13 - var_1_3))) ? (var_1_12) : ((var_1_13 - var_1_3)))) - var_1_4))) : (var_1_10 == ((unsigned long int) var_1_11))) : (var_1_10 == ((unsigned long int) var_1_13)))) && ((((- var_1_11) / (var_1_15 + var_1_16)) <= var_1_3) ? (var_1_14 == ((double) ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))))) : (var_1_31 ? (var_1_14 == ((double) var_1_17)) : 1))) && (var_1_31 ? ((var_1_10 < (var_1_15 + (var_1_13 + var_1_25))) ? (var_1_19 == ((float) (var_1_21 - (var_1_22 + 8.25f)))) : (var_1_19 == ((float) var_1_18))) : (var_1_19 == ((float) var_1_22)))) && ((var_1_12 >= var_1_4) ? (var_1_23 == ((unsigned short int) var_1_16)) : 1)) && (var_1_24 == ((unsigned char) (var_1_16 + var_1_3)))) && ((-16 <= var_1_27) ? ((var_1_5 == var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) > (var_1_8)) ? (var_1_4) : (var_1_8))))) : 1) : (var_1_25 == ((unsigned short int) (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))) - var_1_4))))) && ((var_1_8 != (var_1_11 + var_1_5)) ? (var_1_27 == ((unsigned short int) var_1_15)) : 1)) && (((~ var_1_10) >= var_1_13) ? (var_1_28 == ((unsigned short int) (var_1_26 - var_1_4))) : 1)) && (((var_1_16 + var_1_3) < ((var_1_6 / var_1_11) | var_1_5)) ? (((3214144168u - (var_1_30 - var_1_10)) != (- var_1_27)) ? (var_1_29 == ((signed char) (((((var_1_3 + var_1_5)) > (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((var_1_3 + var_1_5)) : (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))))) : 1) : ((((((var_1_19 + var_1_22) < 0 ) ? -(var_1_19 + var_1_22) : (var_1_19 + var_1_22))) < var_1_18) ? ((var_1_22 <= var_1_19) ? (var_1_29 == ((signed char) var_1_4)) : 1) : (var_1_29 == ((signed char) var_1_6))))) && (var_1_31 == ((unsigned char) 0))) && (var_1_32 == ((double) var_1_17)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=-52, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L19] reach_error() VAL [isInitial=1, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=-52, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 172 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 6, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2354 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2347 mSDsluCounter, 2692 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2079 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3879 IncrementalHoareTripleChecker+Invalid, 4105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 613 mSDtfsCounter, 3879 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1331 GetRequests, 1178 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2478 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=4, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 262 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1997 NumberOfCodeBlocks, 1997 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1805 ConstructedInterpolants, 0 QuantifiedInterpolants, 9954 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1697 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 12962/14040 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:04:44,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.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 00bef7012df83cfea6557911ccded0b7d229289545c394298f9cdde0162b421c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:04:46,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:04:46,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:04:46,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:04:46,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:04:46,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:04:46,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:04:46,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:04:46,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:04:46,157 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:04:46,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:04:46,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:04:46,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:04:46,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:04:46,158 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:04:46,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:04:46,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:04:46,158 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:04:46,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:04:46,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:04:46,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:04:46,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:04:46,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:04:46,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:04:46,159 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:04:46,159 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:04:46,159 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:04:46,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:04:46,159 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:04:46,160 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:04:46,160 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:04:46,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:04:46,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:04:46,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:04:46,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:04:46,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:04:46,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:04:46,161 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:04:46,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:04:46,161 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:04:46,161 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:04:46,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:04:46,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:04:46,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:04:46,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:04:46,162 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 -> 00bef7012df83cfea6557911ccded0b7d229289545c394298f9cdde0162b421c [2025-03-08 15:04:46,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:04:46,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:04:46,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:04:46,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:04:46,405 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:04:46,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i [2025-03-08 15:04:47,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f27f43a2/8db4c4c850f54e0f90a0482becc66427/FLAG8e46efc42 [2025-03-08 15:04:47,847 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:04:47,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i [2025-03-08 15:04:47,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f27f43a2/8db4c4c850f54e0f90a0482becc66427/FLAG8e46efc42 [2025-03-08 15:04:47,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f27f43a2/8db4c4c850f54e0f90a0482becc66427 [2025-03-08 15:04:47,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:04:47,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:04:47,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:04:47,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:04:47,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:04:47,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:04:47" (1/1) ... [2025-03-08 15:04:47,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47bebc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:47, skipping insertion in model container [2025-03-08 15:04:47,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:04:47" (1/1) ... [2025-03-08 15:04:47,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:04:48,004 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_amount100_file-27.i[916,929] [2025-03-08 15:04:48,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:04:48,107 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:04:48,116 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_amount100_file-27.i[916,929] [2025-03-08 15:04:48,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:04:48,170 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:04:48,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:48 WrapperNode [2025-03-08 15:04:48,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:04:48,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:04:48,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:04:48,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:04:48,176 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:04:48" (1/1) ... [2025-03-08 15:04:48,186 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:04:48" (1/1) ... [2025-03-08 15:04:48,205 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-08 15:04:48,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:04:48,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:04:48,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:04:48,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:04:48,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:48" (1/1) ... [2025-03-08 15:04:48,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:48" (1/1) ... [2025-03-08 15:04:48,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:48" (1/1) ... [2025-03-08 15:04:48,232 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:04:48,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:48" (1/1) ... [2025-03-08 15:04:48,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:48" (1/1) ... [2025-03-08 15:04:48,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:48" (1/1) ... [2025-03-08 15:04:48,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:48" (1/1) ... [2025-03-08 15:04:48,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:48" (1/1) ... [2025-03-08 15:04:48,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:48" (1/1) ... [2025-03-08 15:04:48,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:04:48,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:04:48,255 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:04:48,255 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:04:48,256 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:48" (1/1) ... [2025-03-08 15:04:48,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:04:48,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:04:48,286 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:04:48,293 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:04:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:04:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:04:48,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:04:48,311 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:04:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:04:48,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:04:48,385 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:04:48,387 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:04:52,365 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 15:04:52,365 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:04:52,374 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:04:52,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:04:52,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:04:52 BoogieIcfgContainer [2025-03-08 15:04:52,376 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:04:52,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:04:52,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:04:52,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:04:52,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:04:47" (1/3) ... [2025-03-08 15:04:52,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d39a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:04:52, skipping insertion in model container [2025-03-08 15:04:52,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:04:48" (2/3) ... [2025-03-08 15:04:52,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d39a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:04:52, skipping insertion in model container [2025-03-08 15:04:52,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:04:52" (3/3) ... [2025-03-08 15:04:52,383 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-27.i [2025-03-08 15:04:52,394 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:04:52,395 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-27.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:04:52,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:04:52,468 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;@6777e245, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:04:52,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:04:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 15:04:52,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 15:04:52,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:52,483 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:52,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:52,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2058320315, now seen corresponding path program 1 times [2025-03-08 15:04:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:04:52,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68165272] [2025-03-08 15:04:52,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:52,497 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:04:52,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:04:52,501 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:04:52,515 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:04:52,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 15:04:52,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 15:04:52,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:52,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:52,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:04:52,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:04:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-08 15:04:52,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:04:52,941 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:04:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68165272] [2025-03-08 15:04:52,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68165272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:52,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:04:52,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:04:52,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939564897] [2025-03-08 15:04:52,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:52,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:04:52,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:04:52,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:04:52,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:04:52,964 INFO L87 Difference]: Start difference. First operand has 85 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 15:04:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:04:52,987 INFO L93 Difference]: Finished difference Result 164 states and 284 transitions. [2025-03-08 15:04:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:04:52,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 177 [2025-03-08 15:04:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:04:52,993 INFO L225 Difference]: With dead ends: 164 [2025-03-08 15:04:52,994 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 15:04:52,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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:04:52,999 INFO L435 NwaCegarLoop]: 125 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, 125 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:04:52,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:04:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 15:04:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-08 15:04:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 15:04:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2025-03-08 15:04:53,040 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 177 [2025-03-08 15:04:53,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:04:53,041 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2025-03-08 15:04:53,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 15:04:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2025-03-08 15:04:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 15:04:53,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:04:53,044 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:53,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:04:53,245 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:04:53,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:04:53,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:04:53,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1064133492, now seen corresponding path program 1 times [2025-03-08 15:04:53,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:04:53,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982363978] [2025-03-08 15:04:53,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:53,247 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:04:53,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:04:53,251 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:04:53,252 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:04:53,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 15:04:53,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 15:04:53,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:53,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:53,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 15:04:53,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:04:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 216 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 15:04:56,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:04:57,626 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:04:57,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982363978] [2025-03-08 15:04:57,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982363978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:04:57,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [497353766] [2025-03-08 15:04:57,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:04:57,627 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 15:04:57,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 15:04:57,646 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:04:57,647 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:04:57,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 15:04:58,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 15:04:58,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:04:58,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:04:58,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 15:04:58,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:04:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 15:04:58,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:04:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [497353766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:04:58,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:04:58,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2025-03-08 15:04:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792863446] [2025-03-08 15:04:58,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:04:58,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:04:58,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:04:58,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:04:58,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:04:58,237 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 15:05:00,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:05:00,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:05:00,282 INFO L93 Difference]: Finished difference Result 236 states and 361 transitions. [2025-03-08 15:05:00,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:05:00,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2025-03-08 15:05:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:05:00,307 INFO L225 Difference]: With dead ends: 236 [2025-03-08 15:05:00,307 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 15:05:00,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:05:00,310 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 108 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:05:00,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 241 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 15:05:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 15:05:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 93. [2025-03-08 15:05:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 15:05:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2025-03-08 15:05:00,324 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 178 [2025-03-08 15:05:00,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:05:00,325 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2025-03-08 15:05:00,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 15:05:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2025-03-08 15:05:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 15:05:00,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:05:00,327 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:00,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-08 15:05:00,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 15:05:00,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:05:00,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:05:00,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:05:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1691058415, now seen corresponding path program 1 times [2025-03-08 15:05:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:05:00,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365758094] [2025-03-08 15:05:00,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:00,729 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:05:00,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:05:00,731 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:05:00,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 15:05:00,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 15:05:01,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 15:05:01,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:01,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:01,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 15:05:01,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:05:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 216 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 15:05:03,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:05:04,602 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:05:04,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365758094] [2025-03-08 15:05:04,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365758094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:05:04,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [806816273] [2025-03-08 15:05:04,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:04,603 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 15:05:04,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 15:05:04,605 INFO L229 MonitoredProcess]: Starting monitored process 6 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:05:04,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-08 15:05:04,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 15:05:05,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 15:05:05,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:05,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:05,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 15:05:05,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:05:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 216 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 15:05:07,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:05:08,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [806816273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:05:08,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:05:08,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2025-03-08 15:05:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845770650] [2025-03-08 15:05:08,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:05:08,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:05:08,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:05:08,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:05:08,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:05:08,765 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 15:05:12,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:05:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:05:13,030 INFO L93 Difference]: Finished difference Result 197 states and 286 transitions. [2025-03-08 15:05:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 15:05:13,032 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 179 [2025-03-08 15:05:13,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:05:13,033 INFO L225 Difference]: With dead ends: 197 [2025-03-08 15:05:13,033 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 15:05:13,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:05:13,034 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 52 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:05:13,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 299 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 15:05:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 15:05:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-03-08 15:05:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 15:05:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2025-03-08 15:05:13,047 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 179 [2025-03-08 15:05:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:05:13,048 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2025-03-08 15:05:13,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 15:05:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2025-03-08 15:05:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 15:05:13,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:05:13,053 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:13,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 15:05:13,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-08 15:05:13,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 15:05:13,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:05:13,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:05:13,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1758065168, now seen corresponding path program 1 times [2025-03-08 15:05:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:05:13,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279547996] [2025-03-08 15:05:13,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:13,455 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:05:13,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:05:13,457 INFO L229 MonitoredProcess]: Starting monitored process 7 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:05:13,459 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 (7)] Waiting until timeout for monitored process [2025-03-08 15:05:13,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 15:05:13,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 15:05:13,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:13,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:13,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:05:13,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:05:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 728 proven. 39 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-08 15:05:14,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:05:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-08 15:05:14,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:05:14,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279547996] [2025-03-08 15:05:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279547996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:05:14,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:05:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 15:05:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865828556] [2025-03-08 15:05:14,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:05:14,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:05:14,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:05:14,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:05:14,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:05:14,976 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2025-03-08 15:05:19,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:05:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:05:19,719 INFO L93 Difference]: Finished difference Result 269 states and 368 transitions. [2025-03-08 15:05:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:05:19,720 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 179 [2025-03-08 15:05:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:05:19,722 INFO L225 Difference]: With dead ends: 269 [2025-03-08 15:05:19,722 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 15:05:19,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:05:19,723 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 205 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:05:19,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 423 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 15:05:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 15:05:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2025-03-08 15:05:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 111 states have internal predecessors, (136), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 15:05:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 216 transitions. [2025-03-08 15:05:19,740 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 216 transitions. Word has length 179 [2025-03-08 15:05:19,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:05:19,741 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 216 transitions. [2025-03-08 15:05:19,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2025-03-08 15:05:19,741 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 216 transitions. [2025-03-08 15:05:19,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 15:05:19,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:05:19,743 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:19,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-03-08 15:05:19,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:05:19,943 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:05:19,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:05:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash 739950769, now seen corresponding path program 1 times [2025-03-08 15:05:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:05:19,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432493840] [2025-03-08 15:05:19,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:19,944 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:05:19,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:05:19,947 INFO L229 MonitoredProcess]: Starting monitored process 8 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:05:19,947 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 (8)] Waiting until timeout for monitored process [2025-03-08 15:05:19,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 15:05:20,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 15:05:20,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:20,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:20,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 15:05:20,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:05:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 15:05:20,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:05:20,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:05:20,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432493840] [2025-03-08 15:05:20,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432493840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:05:20,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:05:20,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:05:20,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61894135] [2025-03-08 15:05:20,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:05:20,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:05:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:05:20,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:05:20,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:05:20,342 INFO L87 Difference]: Start difference. First operand 160 states and 216 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 15:05:22,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 15:05:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:05:23,046 INFO L93 Difference]: Finished difference Result 482 states and 639 transitions. [2025-03-08 15:05:23,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:05:23,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-03-08 15:05:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:05:23,051 INFO L225 Difference]: With dead ends: 482 [2025-03-08 15:05:23,051 INFO L226 Difference]: Without dead ends: 325 [2025-03-08 15:05:23,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:05:23,053 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 198 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:05:23,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 449 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 15:05:23,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-08 15:05:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 256. [2025-03-08 15:05:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 190 states have (on average 1.2473684210526317) internal successors, (237), 193 states have internal predecessors, (237), 48 states have call successors, (48), 17 states have call predecessors, (48), 17 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 15:05:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 333 transitions. [2025-03-08 15:05:23,097 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 333 transitions. Word has length 179 [2025-03-08 15:05:23,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:05:23,098 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 333 transitions. [2025-03-08 15:05:23,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 15:05:23,098 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 333 transitions. [2025-03-08 15:05:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 15:05:23,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:05:23,102 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:23,115 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 (8)] Ended with exit code 0 [2025-03-08 15:05:23,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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:05:23,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:05:23,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:05:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1067503694, now seen corresponding path program 1 times [2025-03-08 15:05:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:05:23,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794329252] [2025-03-08 15:05:23,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:23,303 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:05:23,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:05:23,305 INFO L229 MonitoredProcess]: Starting monitored process 9 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:05:23,306 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 (9)] Waiting until timeout for monitored process [2025-03-08 15:05:23,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 15:05:23,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 15:05:23,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:23,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:23,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:05:23,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:05:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 26 proven. 78 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 15:05:24,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:05:26,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:05:26,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794329252] [2025-03-08 15:05:26,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794329252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:05:26,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1505094959] [2025-03-08 15:05:26,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:26,297 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 15:05:26,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 15:05:26,299 INFO L229 MonitoredProcess]: Starting monitored process 10 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:05:26,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-08 15:05:26,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 15:05:27,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 15:05:27,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:27,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:27,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 15:05:27,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:05:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 26 proven. 78 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 15:05:28,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:05:28,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1505094959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:05:28,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:05:28,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-03-08 15:05:28,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898298299] [2025-03-08 15:05:28,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:05:28,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:05:28,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:05:28,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:05:28,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:05:28,743 INFO L87 Difference]: Start difference. First operand 256 states and 333 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 15:05:32,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:05:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:05:32,348 INFO L93 Difference]: Finished difference Result 515 states and 666 transitions. [2025-03-08 15:05:32,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:05:32,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 179 [2025-03-08 15:05:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:05:32,350 INFO L225 Difference]: With dead ends: 515 [2025-03-08 15:05:32,350 INFO L226 Difference]: Without dead ends: 262 [2025-03-08 15:05:32,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:05:32,351 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 109 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:05:32,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 253 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-08 15:05:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-08 15:05:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2025-03-08 15:05:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 188 states have (on average 1.2287234042553192) internal successors, (231), 191 states have internal predecessors, (231), 48 states have call successors, (48), 17 states have call predecessors, (48), 17 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 15:05:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 327 transitions. [2025-03-08 15:05:32,369 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 327 transitions. Word has length 179 [2025-03-08 15:05:32,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:05:32,370 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 327 transitions. [2025-03-08 15:05:32,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 15:05:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 327 transitions. [2025-03-08 15:05:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 15:05:32,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:05:32,373 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:32,387 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 (9)] Ended with exit code 0 [2025-03-08 15:05:32,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-08 15:05:32,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 15:05:32,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:05:32,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:05:32,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1035180459, now seen corresponding path program 1 times [2025-03-08 15:05:32,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:05:32,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527656389] [2025-03-08 15:05:32,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:05:32,776 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:05:32,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:05:32,777 INFO L229 MonitoredProcess]: Starting monitored process 11 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:05:32,778 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 (11)] Waiting until timeout for monitored process [2025-03-08 15:05:32,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 15:05:33,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 15:05:33,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:05:33,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:05:33,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 15:05:33,057 INFO L279 TraceCheckSpWp]: Computing forward predicates...