/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/softmax_1_unsafe.c-amalgamation.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 10:39:12,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 10:39:12,590 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:39:12,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 10:39:12,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 10:39:12,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 10:39:12,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 10:39:12,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 10:39:12,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 10:39:12,630 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 10:39:12,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 10:39:12,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 10:39:12,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 10:39:12,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 10:39:12,636 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 10:39:12,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 10:39:12,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 10:39:12,636 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 10:39:12,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 10:39:12,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 10:39:12,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 10:39:12,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 10:39:12,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 10:39:12,639 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 10:39:12,639 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 10:39:12,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 10:39:12,640 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 10:39:12,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 10:39:12,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 10:39:12,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 10:39:12,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 10:39:12,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 10:39:12,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 10:39:12,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 10:39:12,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 10:39:12,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 10:39:12,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 10:39:12,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 10:39:12,643 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 10:39:12,643 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 10:39:12,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 10:39:12,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 10:39:12,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 10:39:12,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 10:39:12,644 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:39:12,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 10:39:12,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 10:39:12,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 10:39:12,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 10:39:12,896 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 10:39:12,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/neural-networks/softmax_1_unsafe.c-amalgamation.i [2024-11-06 10:39:14,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 10:39:14,487 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 10:39:14,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/softmax_1_unsafe.c-amalgamation.i [2024-11-06 10:39:14,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e1c6be7/6dace6665e6c48ac996b33d745f6fafc/FLAGa16a8b5b2 [2024-11-06 10:39:14,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e1c6be7/6dace6665e6c48ac996b33d745f6fafc [2024-11-06 10:39:14,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 10:39:14,796 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 10:39:14,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 10:39:14,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 10:39:14,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 10:39:14,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:14" (1/1) ... [2024-11-06 10:39:14,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73bf3cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:14, skipping insertion in model container [2024-11-06 10:39:14,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:14" (1/1) ... [2024-11-06 10:39:14,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 10:39:15,401 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/softmax_1_unsafe.c-amalgamation.i[63430,63443] [2024-11-06 10:39:15,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 10:39:15,420 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 10:39:15,480 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/softmax_1_unsafe.c-amalgamation.i[63430,63443] [2024-11-06 10:39:15,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 10:39:15,608 INFO L204 MainTranslator]: Completed translation [2024-11-06 10:39:15,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:15 WrapperNode [2024-11-06 10:39:15,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 10:39:15,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 10:39:15,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 10:39:15,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 10:39:15,617 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:39:15" (1/1) ... [2024-11-06 10:39:15,645 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:39:15" (1/1) ... [2024-11-06 10:39:15,671 INFO L138 Inliner]: procedures = 562, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2024-11-06 10:39:15,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 10:39:15,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 10:39:15,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 10:39:15,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 10:39:15,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:15" (1/1) ... [2024-11-06 10:39:15,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:15" (1/1) ... [2024-11-06 10:39:15,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:15" (1/1) ... [2024-11-06 10:39:15,697 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 4, 7, 8]. 38 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 7, 0]. The 4 writes are split as follows [0, 2, 0, 2]. [2024-11-06 10:39:15,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:15" (1/1) ... [2024-11-06 10:39:15,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:15" (1/1) ... [2024-11-06 10:39:15,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:15" (1/1) ... [2024-11-06 10:39:15,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:15" (1/1) ... [2024-11-06 10:39:15,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:15" (1/1) ... [2024-11-06 10:39:15,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:15" (1/1) ... [2024-11-06 10:39:15,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 10:39:15,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 10:39:15,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 10:39:15,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 10:39:15,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:15" (1/1) ... [2024-11-06 10:39:15,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 10:39:15,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 10:39:15,747 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:39:15,751 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:39:15,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-06 10:39:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-06 10:39:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-06 10:39:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-06 10:39:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 10:39:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 10:39:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 10:39:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 10:39:15,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-06 10:39:15,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 10:39:15,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 10:39:15,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 10:39:15,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-06 10:39:15,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-06 10:39:15,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-06 10:39:15,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-06 10:39:15,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 10:39:15,881 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 10:39:15,883 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 10:39:16,801 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-06 10:39:16,802 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 10:39:16,818 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 10:39:16,818 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-06 10:39:16,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:16 BoogieIcfgContainer [2024-11-06 10:39:16,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 10:39:16,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 10:39:16,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 10:39:16,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 10:39:16,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:39:14" (1/3) ... [2024-11-06 10:39:16,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687e7b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:16, skipping insertion in model container [2024-11-06 10:39:16,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:15" (2/3) ... [2024-11-06 10:39:16,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687e7b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:16, skipping insertion in model container [2024-11-06 10:39:16,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:16" (3/3) ... [2024-11-06 10:39:16,831 INFO L112 eAbstractionObserver]: Analyzing ICFG softmax_1_unsafe.c-amalgamation.i [2024-11-06 10:39:16,844 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 10:39:16,844 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 10:39:16,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 10:39:16,899 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;@4065d33f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 10:39:16,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 10:39:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 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:39:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 10:39:16,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 10:39:16,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 10:39:16,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 10:39:16,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 10:39:16,918 INFO L85 PathProgramCache]: Analyzing trace with hash 962609502, now seen corresponding path program 1 times [2024-11-06 10:39:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 10:39:16,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341461483] [2024-11-06 10:39:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 10:39:16,931 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:39:16,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 10:39:16,934 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:39:16,936 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:39:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 10:39:17,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 10:39:17,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 10:39:17,103 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:39:17,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 10:39:17,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 10:39:17,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341461483] [2024-11-06 10:39:17,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341461483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 10:39:17,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 10:39:17,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 10:39:17,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88342897] [2024-11-06 10:39:17,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 10:39:17,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 10:39:17,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 10:39:17,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 10:39:17,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 10:39:17,142 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:39:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 10:39:17,155 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2024-11-06 10:39:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 10:39:17,157 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2024-11-06 10:39:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 10:39:17,164 INFO L225 Difference]: With dead ends: 43 [2024-11-06 10:39:17,164 INFO L226 Difference]: Without dead ends: 19 [2024-11-06 10:39:17,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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:39:17,170 INFO L432 NwaCegarLoop]: 26 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, 26 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:39:17,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 10:39:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-06 10:39:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-06 10:39:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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:39:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-06 10:39:17,204 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2024-11-06 10:39:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 10:39:17,205 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-06 10:39:17,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:39:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-06 10:39:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 10:39:17,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 10:39:17,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 10:39:17,217 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-06 10:39:17,408 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:39:17,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 10:39:17,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 10:39:17,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1163296571, now seen corresponding path program 1 times [2024-11-06 10:39:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 10:39:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010467647] [2024-11-06 10:39:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 10:39:17,412 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:39:17,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 10:39:17,415 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:39:17,416 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:39:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 10:39:17,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 10:39:17,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 10:39:17,587 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:39:17,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 10:39:17,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 10:39:17,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010467647] [2024-11-06 10:39:17,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010467647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 10:39:17,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 10:39:17,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 10:39:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96833179] [2024-11-06 10:39:17,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 10:39:17,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 10:39:17,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 10:39:17,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 10:39:17,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 10:39:17,595 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:39:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 10:39:18,160 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-06 10:39:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 10:39:18,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-11-06 10:39:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 10:39:18,161 INFO L225 Difference]: With dead ends: 32 [2024-11-06 10:39:18,161 INFO L226 Difference]: Without dead ends: 22 [2024-11-06 10:39:18,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 10:39:18,163 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 10:39:18,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 10:39:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-06 10:39:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-06 10:39:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:39:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-06 10:39:18,168 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2024-11-06 10:39:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 10:39:18,168 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-06 10:39:18,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:39:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-06 10:39:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 10:39:18,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 10:39:18,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 10:39:18,175 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:39:18,370 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:39:18,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 10:39:18,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 10:39:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1831433709, now seen corresponding path program 1 times [2024-11-06 10:39:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 10:39:18,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510405910] [2024-11-06 10:39:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 10:39:18,373 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:39:18,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 10:39:18,375 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-06 10:39:18,376 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-06 10:39:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 10:39:18,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 10:39:18,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 10:39:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 10:39:18,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 10:39:18,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 10:39:18,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510405910] [2024-11-06 10:39:18,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510405910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 10:39:18,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 10:39:18,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 10:39:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604832922] [2024-11-06 10:39:18,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 10:39:18,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 10:39:18,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 10:39:18,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 10:39:18,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 10:39:18,555 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:39:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 10:39:19,873 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-06 10:39:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 10:39:19,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-06 10:39:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 10:39:19,874 INFO L225 Difference]: With dead ends: 31 [2024-11-06 10:39:19,874 INFO L226 Difference]: Without dead ends: 24 [2024-11-06 10:39:19,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-06 10:39:19,875 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 10:39:19,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 29 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 10:39:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-06 10:39:19,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-06 10:39:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:39:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-06 10:39:19,883 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2024-11-06 10:39:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 10:39:19,883 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-06 10:39:19,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:39:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-06 10:39:19,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-06 10:39:19,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 10:39:19,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 10:39:19,891 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-06 10:39:20,089 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-06 10:39:20,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 10:39:20,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 10:39:20,091 INFO L85 PathProgramCache]: Analyzing trace with hash -965453673, now seen corresponding path program 1 times [2024-11-06 10:39:20,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 10:39:20,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136432194] [2024-11-06 10:39:20,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 10:39:20,092 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:39:20,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 10:39:20,095 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-06 10:39:20,095 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-06 10:39:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 10:39:20,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 10:39:20,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 10:39:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-06 10:39:20,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 10:39:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-06 10:39:20,533 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 10:39:20,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136432194] [2024-11-06 10:39:20,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136432194] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 10:39:20,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 10:39:20,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-06 10:39:20,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780894800] [2024-11-06 10:39:20,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 10:39:20,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 10:39:20,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 10:39:20,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 10:39:20,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-06 10:39:20,536 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:39:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 10:39:21,934 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-11-06 10:39:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 10:39:21,936 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 21 [2024-11-06 10:39:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 10:39:21,937 INFO L225 Difference]: With dead ends: 38 [2024-11-06 10:39:21,937 INFO L226 Difference]: Without dead ends: 30 [2024-11-06 10:39:21,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-06 10:39:21,942 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 10:39:21,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 10:39:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-06 10:39:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-06 10:39:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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:39:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-06 10:39:21,947 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2024-11-06 10:39:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 10:39:21,947 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-06 10:39:21,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:39:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-06 10:39:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 10:39:21,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 10:39:21,951 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 10:39:21,963 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-06 10:39:22,152 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-06 10:39:22,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 10:39:22,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 10:39:22,153 INFO L85 PathProgramCache]: Analyzing trace with hash -438545125, now seen corresponding path program 2 times [2024-11-06 10:39:22,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 10:39:22,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746011469] [2024-11-06 10:39:22,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 10:39:22,153 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:39:22,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 10:39:22,156 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 10:39:22,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 10:39:22,725 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 10:39:22,725 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 10:39:22,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 10:39:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 10:39:23,369 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-06 10:39:23,369 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 10:39:23,370 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 10:39:23,396 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 (6)] Ended with exit code 0 [2024-11-06 10:39:23,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:39:23,579 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-06 10:39:23,613 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 10:39:23,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:39:23 BoogieIcfgContainer [2024-11-06 10:39:23,616 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 10:39:23,616 INFO L158 Benchmark]: Toolchain (without parser) took 8820.14ms. Allocated memory was 190.8MB in the beginning and 299.9MB in the end (delta: 109.1MB). Free memory was 140.6MB in the beginning and 136.6MB in the end (delta: 3.9MB). Peak memory consumption was 113.7MB. Max. memory is 8.0GB. [2024-11-06 10:39:23,617 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 10:39:23,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 810.88ms. Allocated memory was 190.8MB in the beginning and 299.9MB in the end (delta: 109.1MB). Free memory was 140.2MB in the beginning and 245.1MB in the end (delta: -104.9MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. [2024-11-06 10:39:23,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.25ms. Allocated memory is still 299.9MB. Free memory was 245.1MB in the beginning and 242.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-06 10:39:23,617 INFO L158 Benchmark]: Boogie Preprocessor took 43.49ms. Allocated memory is still 299.9MB. Free memory was 242.0MB in the beginning and 238.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-06 10:39:23,618 INFO L158 Benchmark]: RCFGBuilder took 1102.11ms. Allocated memory is still 299.9MB. Free memory was 238.9MB in the beginning and 222.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-06 10:39:23,618 INFO L158 Benchmark]: TraceAbstraction took 6792.88ms. Allocated memory is still 299.9MB. Free memory was 221.6MB in the beginning and 136.6MB in the end (delta: 84.9MB). Peak memory consumption was 84.9MB. Max. memory is 8.0GB. [2024-11-06 10:39:23,619 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.15ms. Allocated memory is still 190.8MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 810.88ms. Allocated memory was 190.8MB in the beginning and 299.9MB in the end (delta: 109.1MB). Free memory was 140.2MB in the beginning and 245.1MB in the end (delta: -104.9MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.25ms. Allocated memory is still 299.9MB. Free memory was 245.1MB in the beginning and 242.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.49ms. Allocated memory is still 299.9MB. Free memory was 242.0MB in the beginning and 238.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1102.11ms. Allocated memory is still 299.9MB. Free memory was 238.9MB in the beginning and 222.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 6792.88ms. Allocated memory is still 299.9MB. Free memory was 221.6MB in the beginning and 136.6MB in the end (delta: 84.9MB). Peak memory consumption was 84.9MB. 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: 869]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of expf at line 854, overapproximation of __builtin_isinf_sign at line 867. Possible FailurePath: [L863] float x[2], y[2]; [L864] x[0] = __VERIFIER_nondet_float() [L865] x[1] = __VERIFIER_nondet_float() [L866] EXPR x[0] [L866] COND FALSE !(!(!__builtin_isnan (x[0]) && !__builtin_isinf_sign (x[0]))) [L867] EXPR x[1] [L867] COND FALSE !(!(!__builtin_isnan (x[1]) && !__builtin_isinf_sign (x[1]))) [L868] CALL softmax(x, y, 2) [L847] int i; [L848] EXPR x[0] [L848] float max = x[0]; [L849] i = 1 VAL [i=1, max=-2.0, n=2, x={7:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=1, max=0.0, n=2, x={7:0}, y={3:0}] [L849] ++i VAL [i=2, max=0.0, n=2, x={7:0}, y={3:0}] [L849] COND FALSE !(i < n) VAL [max=0.0, n=2, x={7:0}, y={3:0}] [L852] float sum = 0.0f; [L853] i = 0 VAL [i=0, max=0.0, n=2, sum=0.0, x={7:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=1, max=0.0, n=2, sum=0.000000000000000000000000000000000000008908043127325148, x={7:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=2, max=0.0, n=2, sum=-0.0000000000000000000000000000002465190563914532, x={7:0}, y={3:0}] [L853] COND FALSE !(i < n) VAL [max=0.0, n=2, sum=-0.0000000000000000000000000000002465190563914532, x={7:0}, y={3:0}] [L858] i = 0 VAL [i=0, max=0.0, n=2, sum=-0.0000000000000000000000000000002465190563914532, x={7:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=1, max=0.0, n=2, sum=-0.0000000000000000000000000000002465190563914532, x={7:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=2, max=0.0, n=2, sum=-0.0000000000000000000000000000002465190563914532, x={7:0}, y={3:0}] [L858] COND FALSE !(i < n) VAL [max=0.0, sum=-0.0000000000000000000000000000002465190563914532, x={7:0}, y={3:0}] [L868] RET softmax(x, y, 2) [L869] EXPR y[1] [L869] COND TRUE !(__builtin_islessequal(y[1], 0.9f)) [L869] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 83 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 71 mSDtfsCounter, 83 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=4, 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.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 5/7 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-06 10:39:23,653 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...