/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:13:30,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:13:30,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 19:13:30,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:13:30,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:13:30,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:13:30,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:13:30,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:13:30,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:13:30,257 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:13:30,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:13:30,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:13:30,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:13:30,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:13:30,258 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:13:30,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:13:30,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:13:30,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:13:30,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:13:30,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:13:30,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:13:30,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:13:30,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:13:30,262 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:13:30,262 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:13:30,262 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:13:30,262 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:13:30,263 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:13:30,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:13:30,263 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:13:30,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:13:30,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:13:30,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:13:30,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:13:30,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:13:30,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:13:30,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:13:30,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:13:30,265 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:13:30,265 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:13:30,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:13:30,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:13:30,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:13:30,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:13:30,271 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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 [2024-11-05 19:13:30,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:13:30,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:13:30,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:13:30,488 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:13:30,491 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:13:30,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i [2024-11-05 19:13:31,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:13:31,990 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:13:31,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i [2024-11-05 19:13:32,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e821ea6be/7604d6e40dea4e9ca8222a824cfe8480/FLAG63b753466 [2024-11-05 19:13:32,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e821ea6be/7604d6e40dea4e9ca8222a824cfe8480 [2024-11-05 19:13:32,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:13:32,025 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:13:32,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:13:32,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:13:32,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:13:32,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18afc54f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32, skipping insertion in model container [2024-11-05 19:13:32,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:13:32,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i[915,928] [2024-11-05 19:13:32,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:13:32,261 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:13:32,271 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i[915,928] [2024-11-05 19:13:32,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:13:32,305 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:13:32,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32 WrapperNode [2024-11-05 19:13:32,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:13:32,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:13:32,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:13:32,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:13:32,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,346 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-05 19:13:32,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:13:32,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:13:32,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:13:32,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:13:32,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,375 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]. [2024-11-05 19:13:32,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:13:32,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:13:32,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:13:32,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:13:32,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (1/1) ... [2024-11-05 19:13:32,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:13:32,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:13:32,428 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) [2024-11-05 19:13:32,431 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 [2024-11-05 19:13:32,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:13:32,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:13:32,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:13:32,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:13:32,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:13:32,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:13:32,521 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:13:32,523 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:13:36,262 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-05 19:13:36,263 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:13:36,275 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:13:36,276 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:13:36,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:13:36 BoogieIcfgContainer [2024-11-05 19:13:36,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:13:36,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:13:36,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:13:36,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:13:36,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:13:32" (1/3) ... [2024-11-05 19:13:36,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60912a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:13:36, skipping insertion in model container [2024-11-05 19:13:36,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:32" (2/3) ... [2024-11-05 19:13:36,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60912a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:13:36, skipping insertion in model container [2024-11-05 19:13:36,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:13:36" (3/3) ... [2024-11-05 19:13:36,292 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-3.i [2024-11-05 19:13:36,305 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:13:36,305 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:13:36,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:13:36,361 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;@12904084, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:13:36,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:13:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-05 19:13:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-05 19:13:36,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:13:36,377 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:13:36,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:13:36,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:13:36,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1541050139, now seen corresponding path program 1 times [2024-11-05 19:13:36,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:13:36,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1765270147] [2024-11-05 19:13:36,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:13:36,391 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 [2024-11-05 19:13:36,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:13:36,393 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) [2024-11-05 19:13:36,394 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 [2024-11-05 19:13:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:13:36,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:13:36,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:13:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-05 19:13:36,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:13:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-05 19:13:36,761 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:13:36,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1765270147] [2024-11-05 19:13:36,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1765270147] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:13:36,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:13:36,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 19:13:36,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984901976] [2024-11-05 19:13:36,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:13:36,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:13:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:13:36,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:13:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:13:36,785 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-05 19:13:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:13:36,804 INFO L93 Difference]: Finished difference Result 105 states and 182 transitions. [2024-11-05 19:13:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:13:36,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2024-11-05 19:13:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:13:36,819 INFO L225 Difference]: With dead ends: 105 [2024-11-05 19:13:36,819 INFO L226 Difference]: Without dead ends: 52 [2024-11-05 19:13:36,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:13:36,827 INFO L432 NwaCegarLoop]: 77 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, 77 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 [2024-11-05 19:13:36,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 19:13:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-05 19:13:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-05 19:13:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-05 19:13:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2024-11-05 19:13:36,860 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 124 [2024-11-05 19:13:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:13:36,861 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2024-11-05 19:13:36,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-05 19:13:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2024-11-05 19:13:36,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-05 19:13:36,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:13:36,863 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:13:36,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 19:13:37,064 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 [2024-11-05 19:13:37,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:13:37,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:13:37,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1582704411, now seen corresponding path program 1 times [2024-11-05 19:13:37,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:13:37,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [697577508] [2024-11-05 19:13:37,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:13:37,067 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 [2024-11-05 19:13:37,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:13:37,070 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) [2024-11-05 19:13:37,072 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 [2024-11-05 19:13:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:13:37,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 19:13:37,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:13:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-05 19:13:37,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:13:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-05 19:13:37,860 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:13:37,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [697577508] [2024-11-05 19:13:37,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [697577508] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:13:37,861 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:13:37,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2024-11-05 19:13:37,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085954326] [2024-11-05 19:13:37,861 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:13:37,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 19:13:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:13:37,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 19:13:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 19:13:37,864 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-05 19:13:39,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:13:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:13:39,657 INFO L93 Difference]: Finished difference Result 199 states and 299 transitions. [2024-11-05 19:13:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 19:13:39,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 124 [2024-11-05 19:13:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:13:39,661 INFO L225 Difference]: With dead ends: 199 [2024-11-05 19:13:39,661 INFO L226 Difference]: Without dead ends: 150 [2024-11-05 19:13:39,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 19:13:39,662 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 61 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-05 19:13:39,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 170 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-05 19:13:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-05 19:13:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 98. [2024-11-05 19:13:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-05 19:13:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 147 transitions. [2024-11-05 19:13:39,685 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 147 transitions. Word has length 124 [2024-11-05 19:13:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:13:39,686 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 147 transitions. [2024-11-05 19:13:39,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-05 19:13:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 147 transitions. [2024-11-05 19:13:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-05 19:13:39,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:13:39,687 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:13:39,693 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 (3)] Forceful destruction successful, exit code 0 [2024-11-05 19:13:39,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:13:39,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:13:39,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:13:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1639962713, now seen corresponding path program 1 times [2024-11-05 19:13:39,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:13:39,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [774394159] [2024-11-05 19:13:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:13:39,893 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 [2024-11-05 19:13:39,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:13:39,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:13:39,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 19:13:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:13:39,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 19:13:40,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:13:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-05 19:13:40,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:13:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-05 19:13:40,737 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:13:40,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [774394159] [2024-11-05 19:13:40,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [774394159] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:13:40,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:13:40,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-05 19:13:40,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197730575] [2024-11-05 19:13:40,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:13:40,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 19:13:40,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:13:40,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 19:13:40,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 19:13:40,740 INFO L87 Difference]: Start difference. First operand 98 states and 147 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-05 19:13:42,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:13:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:13:42,700 INFO L93 Difference]: Finished difference Result 209 states and 305 transitions. [2024-11-05 19:13:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 19:13:42,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 124 [2024-11-05 19:13:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:13:42,719 INFO L225 Difference]: With dead ends: 209 [2024-11-05 19:13:42,719 INFO L226 Difference]: Without dead ends: 114 [2024-11-05 19:13:42,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-05 19:13:42,723 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 35 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-05 19:13:42,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 113 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-05 19:13:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-05 19:13:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2024-11-05 19:13:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-05 19:13:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2024-11-05 19:13:42,742 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 124 [2024-11-05 19:13:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:13:42,743 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2024-11-05 19:13:42,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-05 19:13:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2024-11-05 19:13:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-05 19:13:42,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:13:42,745 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:13:42,751 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 (4)] Ended with exit code 0 [2024-11-05 19:13:42,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:13:42,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:13:42,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:13:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1641809755, now seen corresponding path program 1 times [2024-11-05 19:13:42,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:13:42,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2145741611] [2024-11-05 19:13:42,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:13:42,970 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 [2024-11-05 19:13:42,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:13:42,974 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) [2024-11-05 19:13:42,975 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 [2024-11-05 19:13:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 19:13:43,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 19:13:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 19:13:43,133 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-05 19:13:43,133 WARN L124 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2024-11-05 19:13:43,133 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-11-05 19:13:43,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 19:13:43,153 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 (5)] Forceful destruction successful, exit code 0 [2024-11-05 19:13:43,344 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 [2024-11-05 19:13:43,348 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-05 19:13:43,360 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 19:13:43,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 07:13:43 BoogieIcfgContainer [2024-11-05 19:13:43,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 19:13:43,362 INFO L158 Benchmark]: Toolchain (without parser) took 11337.75ms. Allocated memory is still 390.1MB. Free memory was 334.9MB in the beginning and 338.0MB in the end (delta: -3.1MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 19:13:43,362 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 233.8MB. Free memory is still 180.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 19:13:43,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.04ms. Allocated memory is still 390.1MB. Free memory was 334.4MB in the beginning and 319.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-05 19:13:43,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.21ms. Allocated memory is still 390.1MB. Free memory was 319.2MB in the beginning and 317.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 19:13:43,363 INFO L158 Benchmark]: Boogie Preprocessor took 55.61ms. Allocated memory is still 390.1MB. Free memory was 317.1MB in the beginning and 313.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 19:13:43,363 INFO L158 Benchmark]: RCFGBuilder took 3873.97ms. Allocated memory is still 390.1MB. Free memory was 313.9MB in the beginning and 296.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-05 19:13:43,363 INFO L158 Benchmark]: TraceAbstraction took 7082.94ms. Allocated memory is still 390.1MB. Free memory was 295.6MB in the beginning and 338.0MB in the end (delta: -42.4MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 19:13:43,364 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.10ms. Allocated memory is still 233.8MB. Free memory is still 180.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 279.04ms. Allocated memory is still 390.1MB. Free memory was 334.4MB in the beginning and 319.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.21ms. Allocated memory is still 390.1MB. Free memory was 319.2MB in the beginning and 317.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.61ms. Allocated memory is still 390.1MB. Free memory was 317.1MB in the beginning and 313.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 3873.97ms. Allocated memory is still 390.1MB. Free memory was 313.9MB in the beginning and 296.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 7082.94ms. Allocated memory is still 390.1MB. Free memory was 295.6MB in the beginning and 338.0MB in the end (delta: -42.4MB). There was no memory consumed. Max. memory is 8.0GB. * 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: unable to decide satisfiability of path constraint. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_6 = -64; [L26] signed long int var_1_7 = -5; [L27] signed long int var_1_8 = 500; [L28] signed long int var_1_9 = -5; [L29] signed long int var_1_10 = -100; [L30] unsigned char var_1_11 = 1; [L31] signed long int var_1_12 = 127; [L32] signed long int var_1_13 = 15; [L33] signed long int var_1_14 = 0; [L34] signed long int var_1_15 = 5; [L35] signed long int var_1_16 = 8; [L36] unsigned char last_1_var_1_11 = 1; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] CALL updateLastVariables() [L99] last_1_var_1_11 = var_1_11 [L109] RET updateLastVariables() [L110] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_4 >= 0) [L20] COND FALSE !(!cond) [L68] RET assume_abort_if_not(var_1_4 >= 0) [L69] CALL assume_abort_if_not(var_1_4 <= 0) [L20] COND FALSE !(!cond) [L69] RET assume_abort_if_not(var_1_4 <= 0) [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) [L20] COND FALSE !(!cond) [L71] RET assume_abort_if_not(var_1_5 >= 0) [L72] CALL assume_abort_if_not(var_1_5 <= 0) [L20] COND FALSE !(!cond) [L72] RET assume_abort_if_not(var_1_5 <= 0) [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= -1073741823) [L20] COND FALSE !(!cond) [L74] RET assume_abort_if_not(var_1_7 >= -1073741823) [L75] CALL assume_abort_if_not(var_1_7 <= 1073741823) [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not(var_1_7 <= 1073741823) [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= -1073741823) [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(var_1_8 >= -1073741823) [L78] CALL assume_abort_if_not(var_1_8 <= 1073741823) [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(var_1_8 <= 1073741823) [L79] var_1_9 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_9 >= -536870912) [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(var_1_9 >= -536870912) [L81] CALL assume_abort_if_not(var_1_9 <= 536870912) [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(var_1_9 <= 536870912) [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= -536870911) [L20] COND FALSE !(!cond) [L83] RET assume_abort_if_not(var_1_10 >= -536870911) [L84] CALL assume_abort_if_not(var_1_10 <= 536870911) [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(var_1_10 <= 536870911) [L85] var_1_13 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_13 >= -2147483648) [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not(var_1_13 >= -2147483648) [L87] CALL assume_abort_if_not(var_1_13 <= 2147483647) [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(var_1_13 <= 2147483647) [L88] var_1_14 = __VERIFIER_nondet_long() [L89] CALL assume_abort_if_not(var_1_14 >= -2147483648) [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not(var_1_14 >= -2147483648) [L90] CALL assume_abort_if_not(var_1_14 <= 2147483647) [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not(var_1_14 <= 2147483647) [L91] var_1_15 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_15 >= -2147483648) [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not(var_1_15 >= -2147483648) [L93] CALL assume_abort_if_not(var_1_15 <= 2147483647) [L20] COND FALSE !(!cond) [L93] RET assume_abort_if_not(var_1_15 <= 2147483647) [L94] var_1_16 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_16 >= -2147483648) [L20] COND FALSE !(!cond) [L95] RET assume_abort_if_not(var_1_16 >= -2147483648) [L96] CALL assume_abort_if_not(var_1_16 <= 2147483647) [L20] COND FALSE !(!cond) [L96] RET assume_abort_if_not(var_1_16 <= 2147483647) [L110] RET updateVariables() [L111] CALL step() [L40] unsigned char stepLocal_0 = last_1_var_1_11; [L41] COND FALSE !(! last_1_var_1_11) [L46] signed long int stepLocal_2 = var_1_7; [L47] signed long int stepLocal_1 = var_1_10; [L48] COND FALSE !(var_1_8 <= stepLocal_2) [L55] COND FALSE !(! var_1_11) [L58] var_1_6 = ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7) [L60] COND FALSE !(\read(var_1_4)) [L63] var_1_12 = var_1_15 [L111] RET step() [L112] CALL, EXPR property() [L102-L103] return ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : 1) : 1) && ((! var_1_11) ? (var_1_6 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_6 == ((signed long int) ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7))))) && ((var_1_8 <= var_1_7) ? ((var_1_10 >= var_1_9) ? (var_1_11 == ((unsigned char) (! var_1_5))) : (var_1_11 == ((unsigned char) (var_1_1 || (! var_1_5))))) : 1)) && (var_1_4 ? (var_1_12 == ((signed long int) (((((((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + var_1_15)) < ((((((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) < 0 ) ? -((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) : ((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))))))) ? ((((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + var_1_15)) : ((((((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) < 0 ) ? -((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) : ((((3.5) < (var_1_16)) ? (3.5) : (var_1_16)))))))))) : (var_1_12 == ((signed long int) var_1_15))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) [L19] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 360 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 203 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 742 GetRequests, 730 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 60 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 738 ConstructedInterpolants, 0 QuantifiedInterpolants, 1537 SizeOfPredicates, 1 NumberOfNonLiveVariables, 591 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 4432/4560 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-05 19:13:43,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...