/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 --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy FOX -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/neural-networks/sqrt_2_safe.c-amalgamation.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 10:45:00,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 10:45:00,724 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-06 10:45:00,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 10:45:00,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 10:45:00,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 10:45:00,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 10:45:00,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 10:45:00,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 10:45:00,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 10:45:00,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 10:45:00,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 10:45:00,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 10:45:00,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 10:45:00,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 10:45:00,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 10:45:00,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 10:45:00,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 10:45:00,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 10:45:00,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 10:45:00,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 10:45:00,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 10:45:00,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 10:45:00,772 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 10:45:00,772 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 10:45:00,772 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 10:45:00,772 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 10:45:00,773 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 10:45:00,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 10:45:00,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 10:45:00,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 10:45:00,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 10:45:00,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 10:45:00,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 10:45:00,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 10:45:00,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 10:45:00,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 10:45:00,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 10:45:00,775 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 10:45:00,776 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 10:45:00,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 10:45:00,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 10:45:00,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 10:45:00,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 10:45:00,777 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.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FOX [2024-11-06 10:45:01,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 10:45:01,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 10:45:01,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 10:45:01,032 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 10:45:01,033 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 10:45:01,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/neural-networks/sqrt_2_safe.c-amalgamation.i [2024-11-06 10:45:02,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 10:45:02,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 10:45:02,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/sqrt_2_safe.c-amalgamation.i [2024-11-06 10:45:02,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b8edfb5/af5cc30015284e99bb1d17934667517c/FLAG98cdca0ea [2024-11-06 10:45:02,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b8edfb5/af5cc30015284e99bb1d17934667517c [2024-11-06 10:45:02,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 10:45:02,759 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 10:45:02,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 10:45:02,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 10:45:02,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 10:45:02,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:02" (1/1) ... [2024-11-06 10:45:02,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60dbceeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:02, skipping insertion in model container [2024-11-06 10:45:02,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:02" (1/1) ... [2024-11-06 10:45:02,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 10:45:03,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/sqrt_2_safe.c-amalgamation.i[63034,63047] [2024-11-06 10:45:03,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 10:45:03,342 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 10:45:03,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/sqrt_2_safe.c-amalgamation.i[63034,63047] [2024-11-06 10:45:03,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 10:45:03,512 INFO L204 MainTranslator]: Completed translation [2024-11-06 10:45:03,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03 WrapperNode [2024-11-06 10:45:03,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 10:45:03,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 10:45:03,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 10:45:03,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 10:45:03,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (1/1) ... [2024-11-06 10:45:03,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (1/1) ... [2024-11-06 10:45:03,565 INFO L138 Inliner]: procedures = 558, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2024-11-06 10:45:03,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 10:45:03,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 10:45:03,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 10:45:03,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 10:45:03,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (1/1) ... [2024-11-06 10:45:03,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (1/1) ... [2024-11-06 10:45:03,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (1/1) ... [2024-11-06 10:45:03,586 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-06 10:45:03,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (1/1) ... [2024-11-06 10:45:03,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (1/1) ... [2024-11-06 10:45:03,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (1/1) ... [2024-11-06 10:45:03,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (1/1) ... [2024-11-06 10:45:03,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (1/1) ... [2024-11-06 10:45:03,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (1/1) ... [2024-11-06 10:45:03,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 10:45:03,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 10:45:03,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 10:45:03,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 10:45:03,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (1/1) ... [2024-11-06 10:45:03,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 10:45:03,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 10:45:03,634 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-06 10:45:03,637 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-06 10:45:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 10:45:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 10:45:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 10:45:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 10:45:03,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 10:45:03,790 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 10:45:03,794 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 10:45:07,936 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-06 10:45:07,936 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 10:45:07,944 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 10:45:07,944 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-06 10:45:07,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:07 BoogieIcfgContainer [2024-11-06 10:45:07,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 10:45:07,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 10:45:07,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 10:45:07,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 10:45:07,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:45:02" (1/3) ... [2024-11-06 10:45:07,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c62f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:07, skipping insertion in model container [2024-11-06 10:45:07,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:03" (2/3) ... [2024-11-06 10:45:07,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c62f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:07, skipping insertion in model container [2024-11-06 10:45:07,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:07" (3/3) ... [2024-11-06 10:45:07,951 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_2_safe.c-amalgamation.i [2024-11-06 10:45:07,967 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 10:45:07,970 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 10:45:08,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 10:45:08,022 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;@77d38fcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 10:45:08,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 10:45:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 10:45:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-06 10:45:08,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 10:45:08,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-06 10:45:08,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 10:45:08,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 10:45:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash 889508712, now seen corresponding path program 1 times [2024-11-06 10:45:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 10:45:08,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160543172] [2024-11-06 10:45:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 10:45:08,049 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-06 10:45:08,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 10:45:08,051 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-06 10:45:08,052 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-06 10:45:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 10:45:08,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 10:45:08,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 10:45:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 10:45:08,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 10:45:08,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 10:45:08,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160543172] [2024-11-06 10:45:08,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160543172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 10:45:08,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 10:45:08,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 10:45:08,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233143022] [2024-11-06 10:45:08,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 10:45:08,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 10:45:08,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 10:45:08,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 10:45:08,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 10:45:08,211 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 10:45:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 10:45:08,220 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-06 10:45:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 10:45:08,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-06 10:45:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 10:45:08,233 INFO L225 Difference]: With dead ends: 19 [2024-11-06 10:45:08,233 INFO L226 Difference]: Without dead ends: 7 [2024-11-06 10:45:08,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-06 10:45:08,241 INFO L432 NwaCegarLoop]: 10 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, 10 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-06 10:45:08,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 10:45:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2024-11-06 10:45:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-11-06 10:45:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 10:45:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6 transitions. [2024-11-06 10:45:08,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 6 transitions. Word has length 6 [2024-11-06 10:45:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 10:45:08,269 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 6 transitions. [2024-11-06 10:45:08,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 10:45:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 6 transitions. [2024-11-06 10:45:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-06 10:45:08,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 10:45:08,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-06 10:45:08,278 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 [2024-11-06 10:45:08,471 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-06 10:45:08,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 10:45:08,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 10:45:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash 889568294, now seen corresponding path program 1 times [2024-11-06 10:45:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 10:45:08,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793321443] [2024-11-06 10:45:08,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 10:45:08,474 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-06 10:45:08,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 10:45:08,477 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-06 10:45:08,478 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-06 10:45:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 10:45:11,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 10:45:11,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 10:45:20,171 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 10:45:28,338 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 10:45:36,448 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 10:45:40,508 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~x~0#1_7| (_ FloatingPoint 8 24))) (and (fp.geq |v_ULTIMATE.start_main_~x~0#1_7| (_ +zero 8 24)) (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~x~0#1_7|) .cse0)) |c_ULTIMATE.start_main_~z~0#1|) (= (fp.sqrt roundNearestTiesToEven |v_ULTIMATE.start_main_~x~0#1_7|) |c_ULTIMATE.start_main_~y~0#1|))) is different from false [2024-11-06 10:45:44,552 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~x~0#1_7| (_ FloatingPoint 8 24))) (and (fp.geq |v_ULTIMATE.start_main_~x~0#1_7| (_ +zero 8 24)) (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~x~0#1_7|) .cse0)) |c_ULTIMATE.start_main_~z~0#1|) (= (fp.sqrt roundNearestTiesToEven |v_ULTIMATE.start_main_~x~0#1_7|) |c_ULTIMATE.start_main_~y~0#1|))) is different from true [2024-11-06 10:45:56,716 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 10:46:04,910 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 10:46:08,973 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~x~0#1_7| (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.sqrt roundNearestTiesToEven |v_ULTIMATE.start_main_~x~0#1_7|) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~x~0#1_7|) .cse0)))) (fp.geq |v_ULTIMATE.start_main_~x~0#1_7| (_ +zero 8 24)))) is different from false [2024-11-06 10:46:13,010 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~x~0#1_7| (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.sqrt roundNearestTiesToEven |v_ULTIMATE.start_main_~x~0#1_7|) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~x~0#1_7|) .cse0)))) (fp.geq |v_ULTIMATE.start_main_~x~0#1_7| (_ +zero 8 24)))) is different from true [2024-11-06 10:46:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 10:46:13,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 10:46:13,011 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 10:46:13,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793321443] [2024-11-06 10:46:13,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793321443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 10:46:13,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 10:46:13,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 10:46:13,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554203995] [2024-11-06 10:46:13,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 10:46:13,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 10:46:13,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 10:46:13,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 10:46:13,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=6, Unknown=4, NotChecked=10, Total=30 [2024-11-06 10:46:13,015 INFO L87 Difference]: Start difference. First operand 7 states and 6 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 10:46:17,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 10:46:21,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 10:46:25,306 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~x~0#1_7| (_ FloatingPoint 8 24))) (and (fp.geq |v_ULTIMATE.start_main_~x~0#1_7| (_ +zero 8 24)) (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~x~0#1_7|) .cse0)) |c_ULTIMATE.start_main_~z~0#1|) (= (fp.sqrt roundNearestTiesToEven |v_ULTIMATE.start_main_~x~0#1_7|) |c_ULTIMATE.start_main_~y~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-06 10:46:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 10:46:25,317 INFO L93 Difference]: Finished difference Result 7 states and 6 transitions. [2024-11-06 10:46:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 10:46:25,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-06 10:46:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 10:46:25,318 INFO L225 Difference]: With dead ends: 7 [2024-11-06 10:46:25,318 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 10:46:25,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=12, Invalid=7, Unknown=5, NotChecked=18, Total=42 [2024-11-06 10:46:25,319 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-06 10:46:25,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 11 Unchecked, 8.2s Time] [2024-11-06 10:46:25,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 10:46:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 10:46:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 10:46:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 10:46:25,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2024-11-06 10:46:25,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 10:46:25,322 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 10:46:25,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 10:46:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 10:46:25,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 10:46:25,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 10:46:25,334 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-06 10:46:25,526 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-06 10:46:25,529 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-06 10:46:25,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 10:46:25,536 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 10:46:25,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:46:25 BoogieIcfgContainer [2024-11-06 10:46:25,543 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 10:46:25,544 INFO L158 Benchmark]: Toolchain (without parser) took 82784.38ms. Allocated memory was 199.2MB in the beginning and 321.9MB in the end (delta: 122.7MB). Free memory was 144.2MB in the beginning and 205.3MB in the end (delta: -61.2MB). Peak memory consumption was 61.8MB. Max. memory is 8.0GB. [2024-11-06 10:46:25,544 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 10:46:25,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 752.29ms. Allocated memory was 199.2MB in the beginning and 321.9MB in the end (delta: 122.7MB). Free memory was 143.9MB in the beginning and 257.7MB in the end (delta: -113.9MB). Peak memory consumption was 35.6MB. Max. memory is 8.0GB. [2024-11-06 10:46:25,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.52ms. Allocated memory is still 321.9MB. Free memory was 257.7MB in the beginning and 255.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-06 10:46:25,546 INFO L158 Benchmark]: Boogie Preprocessor took 31.24ms. Allocated memory is still 321.9MB. Free memory was 255.0MB in the beginning and 253.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-06 10:46:25,546 INFO L158 Benchmark]: RCFGBuilder took 4346.44ms. Allocated memory is still 321.9MB. Free memory was 253.0MB in the beginning and 241.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-11-06 10:46:25,547 INFO L158 Benchmark]: TraceAbstraction took 77596.57ms. Allocated memory is still 321.9MB. Free memory was 239.9MB in the beginning and 205.3MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2024-11-06 10:46:25,549 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.13ms. Allocated memory is still 199.2MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 752.29ms. Allocated memory was 199.2MB in the beginning and 321.9MB in the end (delta: 122.7MB). Free memory was 143.9MB in the beginning and 257.7MB in the end (delta: -113.9MB). Peak memory consumption was 35.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.52ms. Allocated memory is still 321.9MB. Free memory was 257.7MB in the beginning and 255.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.24ms. Allocated memory is still 321.9MB. Free memory was 255.0MB in the beginning and 253.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 4346.44ms. Allocated memory is still 321.9MB. Free memory was 253.0MB in the beginning and 241.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 77596.57ms. Allocated memory is still 321.9MB. Free memory was 239.9MB in the beginning and 205.3MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. 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 - PositiveResult [Line: 851]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 77.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 13 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 61.2s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 2 QuantifiedInterpolants, 62 SizeOfPredicates, 1 NumberOfNonLiveVariables, 48 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-06 10:46:25,721 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...