/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 WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/neural-networks/softmax_7_unsafe.c-amalgamation.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 01:40:20,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 01:40:20,841 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 01:40:20,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 01:40:20,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 01:40:20,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 01:40:20,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 01:40:20,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 01:40:20,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 01:40:20,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 01:40:20,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 01:40:20,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 01:40:20,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 01:40:20,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 01:40:20,878 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 01:40:20,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 01:40:20,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 01:40:20,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 01:40:20,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 01:40:20,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 01:40:20,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 01:40:20,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 01:40:20,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 01:40:20,882 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 01:40:20,882 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 01:40:20,882 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 01:40:20,883 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 01:40:20,883 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 01:40:20,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 01:40:20,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 01:40:20,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 01:40:20,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 01:40:20,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 01:40:20,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 01:40:20,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 01:40:20,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 01:40:20,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 01:40:20,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 01:40:20,885 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 01:40:20,886 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 01:40:20,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 01:40:20,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 01:40:20,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 01:40:20,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 01:40:20,887 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 -> WOLF [2024-11-06 01:40:21,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 01:40:21,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 01:40:21,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 01:40:21,140 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 01:40:21,141 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 01:40:21,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/neural-networks/softmax_7_unsafe.c-amalgamation.i [2024-11-06 01:40:22,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 01:40:22,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 01:40:22,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/softmax_7_unsafe.c-amalgamation.i [2024-11-06 01:40:22,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1508024cb/87a1dd8a8cea49929ec2de3856014afe/FLAG63ec7026a [2024-11-06 01:40:22,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1508024cb/87a1dd8a8cea49929ec2de3856014afe [2024-11-06 01:40:22,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 01:40:22,755 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 01:40:22,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 01:40:22,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 01:40:22,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 01:40:22,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:40:22" (1/1) ... [2024-11-06 01:40:22,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430e4992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:22, skipping insertion in model container [2024-11-06 01:40:22,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:40:22" (1/1) ... [2024-11-06 01:40:22,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 01:40:23,320 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_7_unsafe.c-amalgamation.i[63474,63487] [2024-11-06 01:40:23,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 01:40:23,332 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 01:40:23,393 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_7_unsafe.c-amalgamation.i[63474,63487] [2024-11-06 01:40:23,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 01:40:23,533 INFO L204 MainTranslator]: Completed translation [2024-11-06 01:40:23,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23 WrapperNode [2024-11-06 01:40:23,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 01:40:23,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 01:40:23,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 01:40:23,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 01:40:23,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (1/1) ... [2024-11-06 01:40:23,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (1/1) ... [2024-11-06 01:40:23,591 INFO L138 Inliner]: procedures = 562, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 110 [2024-11-06 01:40:23,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 01:40:23,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 01:40:23,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 01:40:23,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 01:40:23,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (1/1) ... [2024-11-06 01:40:23,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (1/1) ... [2024-11-06 01:40:23,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (1/1) ... [2024-11-06 01:40:23,618 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 7, 4, 8]. 38 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 2, 2]. [2024-11-06 01:40:23,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (1/1) ... [2024-11-06 01:40:23,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (1/1) ... [2024-11-06 01:40:23,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (1/1) ... [2024-11-06 01:40:23,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (1/1) ... [2024-11-06 01:40:23,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (1/1) ... [2024-11-06 01:40:23,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (1/1) ... [2024-11-06 01:40:23,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 01:40:23,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 01:40:23,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 01:40:23,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 01:40:23,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (1/1) ... [2024-11-06 01:40:23,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 01:40:23,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 01:40:23,670 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 01:40:23,672 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 01:40:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-06 01:40:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-06 01:40:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-06 01:40:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-06 01:40:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 01:40:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 01:40:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 01:40:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 01:40:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-06 01:40:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 01:40:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 01:40:23,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 01:40:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-06 01:40:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-06 01:40:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-06 01:40:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-06 01:40:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 01:40:23,796 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 01:40:23,799 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 01:40:24,442 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-06 01:40:24,443 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 01:40:24,452 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 01:40:24,452 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-06 01:40:24,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:40:24 BoogieIcfgContainer [2024-11-06 01:40:24,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 01:40:24,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 01:40:24,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 01:40:24,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 01:40:24,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 01:40:22" (1/3) ... [2024-11-06 01:40:24,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7896daa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:40:24, skipping insertion in model container [2024-11-06 01:40:24,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:23" (2/3) ... [2024-11-06 01:40:24,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7896daa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:40:24, skipping insertion in model container [2024-11-06 01:40:24,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:40:24" (3/3) ... [2024-11-06 01:40:24,462 INFO L112 eAbstractionObserver]: Analyzing ICFG softmax_7_unsafe.c-amalgamation.i [2024-11-06 01:40:24,478 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 01:40:24,478 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 01:40:24,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 01:40:24,530 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;@26b8c9f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 01:40:24,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 01:40:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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 01:40:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 01:40:24,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:24,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:40:24,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:24,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash -223873175, now seen corresponding path program 1 times [2024-11-06 01:40:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:24,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634379225] [2024-11-06 01:40:24,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:24,559 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 01:40:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:24,563 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 01:40:24,565 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 01:40:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:24,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 01:40:24,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:24,723 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 01:40:24,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:40:24,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:24,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634379225] [2024-11-06 01:40:24,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634379225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:40:24,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:40:24,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 01:40:24,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692945013] [2024-11-06 01:40:24,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:40:24,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 01:40:24,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:24,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 01:40:24,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 01:40:24,760 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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.5) internal successors, (15), 2 states have internal predecessors, (15), 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 01:40:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:24,774 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2024-11-06 01:40:24,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 01:40:24,776 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2024-11-06 01:40:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:24,782 INFO L225 Difference]: With dead ends: 47 [2024-11-06 01:40:24,782 INFO L226 Difference]: Without dead ends: 21 [2024-11-06 01:40:24,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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 01:40:24,790 INFO L432 NwaCegarLoop]: 29 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, 29 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 01:40:24,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:40:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-06 01:40:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-06 01:40:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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 01:40:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-06 01:40:24,819 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2024-11-06 01:40:24,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:24,821 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-06 01:40:24,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 01:40:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-06 01:40:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 01:40:24,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:24,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:40:24,828 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 01:40:25,023 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 01:40:25,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:25,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:25,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1702451998, now seen corresponding path program 1 times [2024-11-06 01:40:25,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:25,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643729947] [2024-11-06 01:40:25,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:25,026 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 01:40:25,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:25,029 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 01:40:25,030 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 01:40:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:25,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 01:40:25,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:25,193 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 01:40:25,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:40:25,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:25,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643729947] [2024-11-06 01:40:25,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643729947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:40:25,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:40:25,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 01:40:25,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523295420] [2024-11-06 01:40:25,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:40:25,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 01:40:25,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:25,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 01:40:25,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 01:40:25,200 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 01:40:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:25,982 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-06 01:40:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 01:40:25,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-11-06 01:40:25,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:25,984 INFO L225 Difference]: With dead ends: 36 [2024-11-06 01:40:25,984 INFO L226 Difference]: Without dead ends: 24 [2024-11-06 01:40:25,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 01:40:25,985 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 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.8s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:25,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 01:40:25,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-06 01:40:25,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-06 01:40:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 01:40:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-06 01:40:25,991 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2024-11-06 01:40:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:25,991 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-06 01:40:25,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 01:40:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-06 01:40:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 01:40:25,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:25,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:40:26,000 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 01:40:26,194 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 01:40:26,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:26,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:26,196 INFO L85 PathProgramCache]: Analyzing trace with hash -939866796, now seen corresponding path program 1 times [2024-11-06 01:40:26,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:26,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927034595] [2024-11-06 01:40:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:26,197 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 01:40:26,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:26,200 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 01:40:26,201 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 01:40:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:26,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 01:40:26,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:26,374 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 01:40:26,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:40:26,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:26,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927034595] [2024-11-06 01:40:26,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927034595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:40:26,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:40:26,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 01:40:26,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855892902] [2024-11-06 01:40:26,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:40:26,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 01:40:26,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:26,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 01:40:26,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 01:40:26,378 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 01:40:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:27,858 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-11-06 01:40:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 01:40:27,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-06 01:40:27,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:27,860 INFO L225 Difference]: With dead ends: 35 [2024-11-06 01:40:27,860 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 01:40:27,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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 01:40:27,862 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:27,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 01:40:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 01:40:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-06 01:40:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 01:40:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-06 01:40:27,869 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2024-11-06 01:40:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:27,869 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-06 01:40:27,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 01:40:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-06 01:40:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-06 01:40:27,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:27,870 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, 1] [2024-11-06 01:40:27,875 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 01:40:28,074 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 01:40:28,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:28,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash 135710544, now seen corresponding path program 1 times [2024-11-06 01:40:28,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:28,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194588057] [2024-11-06 01:40:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:28,077 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 01:40:28,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:28,080 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 01:40:28,094 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 01:40:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:28,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 01:40:28,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:28,503 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 01:40:28,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:40:28,633 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 01:40:28,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:28,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194588057] [2024-11-06 01:40:28,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194588057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:40:28,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:40:28,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-06 01:40:28,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780969805] [2024-11-06 01:40:28,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:40:28,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 01:40:28,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:28,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 01:40:28,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-06 01:40:28,636 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 01:40:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:29,927 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-06 01:40:29,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 01:40:29,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 22 [2024-11-06 01:40:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:29,929 INFO L225 Difference]: With dead ends: 42 [2024-11-06 01:40:29,929 INFO L226 Difference]: Without dead ends: 32 [2024-11-06 01:40:29,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 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 01:40:29,931 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:29,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 58 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 01:40:29,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-06 01:40:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-06 01:40:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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 01:40:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-06 01:40:29,937 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 22 [2024-11-06 01:40:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:29,937 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-06 01:40:29,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 01:40:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-06 01:40:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 01:40:29,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:29,939 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, 1] [2024-11-06 01:40:29,949 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 01:40:30,142 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 01:40:30,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:30,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:30,143 INFO L85 PathProgramCache]: Analyzing trace with hash -709993652, now seen corresponding path program 2 times [2024-11-06 01:40:30,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:30,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331973264] [2024-11-06 01:40:30,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 01:40:30,144 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 01:40:30,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:30,145 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 01:40:30,147 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 01:40:30,238 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 01:40:30,239 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:40:30,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 01:40:30,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 01:40:30,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:40:30,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:30,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331973264] [2024-11-06 01:40:30,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331973264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:40:30,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:40:30,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 01:40:30,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361243383] [2024-11-06 01:40:30,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:40:30,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 01:40:30,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:30,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 01:40:30,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 01:40:30,260 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 01:40:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:30,370 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-06 01:40:30,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 01:40:30,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) Word has length 26 [2024-11-06 01:40:30,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:30,374 INFO L225 Difference]: With dead ends: 33 [2024-11-06 01:40:30,374 INFO L226 Difference]: Without dead ends: 30 [2024-11-06 01:40:30,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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 01:40:30,375 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:30,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 01:40:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-06 01:40:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-06 01:40:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 01:40:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-06 01:40:30,381 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2024-11-06 01:40:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:30,381 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-06 01:40:30,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 01:40:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-06 01:40:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-06 01:40:30,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:30,382 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, 1, 1, 1] [2024-11-06 01:40:30,387 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 (6)] Forceful destruction successful, exit code 0 [2024-11-06 01:40:30,586 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 01:40:30,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:30,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:30,587 INFO L85 PathProgramCache]: Analyzing trace with hash 597560746, now seen corresponding path program 1 times [2024-11-06 01:40:30,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:30,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634051740] [2024-11-06 01:40:30,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:30,588 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 01:40:30,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:30,596 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:40:30,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 01:40:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:31,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 01:40:31,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:31,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 01:40:31,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:40:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 01:40:31,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634051740] [2024-11-06 01:40:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634051740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:40:31,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:40:31,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 01:40:31,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202984395] [2024-11-06 01:40:31,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:40:31,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 01:40:31,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:31,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 01:40:31,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-06 01:40:31,083 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 01:40:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:31,266 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-06 01:40:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 01:40:31,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2024-11-06 01:40:31,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:31,270 INFO L225 Difference]: With dead ends: 35 [2024-11-06 01:40:31,270 INFO L226 Difference]: Without dead ends: 32 [2024-11-06 01:40:31,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-06 01:40:31,271 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:31,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 83 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 01:40:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-06 01:40:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-06 01:40:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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 01:40:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-06 01:40:31,277 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 28 [2024-11-06 01:40:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:31,278 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-06 01:40:31,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 01:40:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-06 01:40:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-06 01:40:31,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:31,280 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:40:31,294 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 (7)] Ended with exit code 0 [2024-11-06 01:40:31,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:40:31,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:31,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:31,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1268080504, now seen corresponding path program 2 times [2024-11-06 01:40:31,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:31,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930565123] [2024-11-06 01:40:31,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 01:40:31,483 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 01:40:31,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:31,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:40:31,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-06 01:40:33,560 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 01:40:33,561 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 01:40:33,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 01:40:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 01:40:34,077 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-06 01:40:34,077 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 01:40:34,078 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 01:40:34,099 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 (8)] Forceful destruction successful, exit code 0 [2024-11-06 01:40:34,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:40:34,283 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2024-11-06 01:40:34,323 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 01:40:34,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 01:40:34 BoogieIcfgContainer [2024-11-06 01:40:34,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 01:40:34,326 INFO L158 Benchmark]: Toolchain (without parser) took 11571.13ms. Allocated memory was 183.5MB in the beginning and 249.6MB in the end (delta: 66.1MB). Free memory was 138.3MB in the beginning and 157.3MB in the end (delta: -19.1MB). Peak memory consumption was 47.8MB. Max. memory is 8.0GB. [2024-11-06 01:40:34,327 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 01:40:34,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 777.22ms. Allocated memory is still 183.5MB. Free memory was 137.9MB in the beginning and 125.4MB in the end (delta: 12.5MB). Peak memory consumption was 45.2MB. Max. memory is 8.0GB. [2024-11-06 01:40:34,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.15ms. Allocated memory is still 183.5MB. Free memory was 125.4MB in the beginning and 122.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-06 01:40:34,329 INFO L158 Benchmark]: Boogie Preprocessor took 45.84ms. Allocated memory is still 183.5MB. Free memory was 122.2MB in the beginning and 119.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-06 01:40:34,329 INFO L158 Benchmark]: RCFGBuilder took 813.99ms. Allocated memory is still 183.5MB. Free memory was 119.6MB in the beginning and 103.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-06 01:40:34,329 INFO L158 Benchmark]: TraceAbstraction took 9871.17ms. Allocated memory was 183.5MB in the beginning and 249.6MB in the end (delta: 66.1MB). Free memory was 102.8MB in the beginning and 157.3MB in the end (delta: -54.5MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2024-11-06 01:40:34,330 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.14ms. Allocated memory is still 183.5MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 777.22ms. Allocated memory is still 183.5MB. Free memory was 137.9MB in the beginning and 125.4MB in the end (delta: 12.5MB). Peak memory consumption was 45.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.15ms. Allocated memory is still 183.5MB. Free memory was 125.4MB in the beginning and 122.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.84ms. Allocated memory is still 183.5MB. Free memory was 122.2MB in the beginning and 119.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 813.99ms. Allocated memory is still 183.5MB. Free memory was 119.6MB in the beginning and 103.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 9871.17ms. Allocated memory was 183.5MB in the beginning and 249.6MB in the end (delta: 66.1MB). Free memory was 102.8MB in the beginning and 157.3MB in the end (delta: -54.5MB). Peak memory consumption was 12.1MB. 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: 873]: 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.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=2, max=0.0, n=2, sum=0.0, x={7:0}, y={3:0}] [L853] COND FALSE !(i < n) VAL [max=0.0, n=2, sum=0.0, x={7:0}, y={3:0}] [L858] i = 0 VAL [i=0, max=0.0, n=2, sum=0.0, 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.0, 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.0, x={7:0}, y={3:0}] [L858] COND FALSE !(i < n) VAL [max=0.0, sum=0.0, x={7:0}, y={3:0}] [L868] RET softmax(x, y, 2) [L869] int i; [L870] float sum = 0.0f; [L871] i = 0 VAL [i=0, sum=0.0, y={3:0}] [L871] COND TRUE i < 2 [L872] EXPR y[i] [L872] sum += y[i] VAL [i=0, sum=NaN, y={3:0}] [L871] ++i VAL [i=1, sum=NaN, y={3:0}] [L871] COND TRUE i < 2 [L872] EXPR y[i] [L872] sum += y[i] VAL [i=1, sum=NaN, y={3:0}] [L871] ++i VAL [i=2, sum=NaN, y={3:0}] [L871] COND FALSE !(i < 2) VAL [sum=NaN, y={3:0}] [L873] COND TRUE !(sum == 1.0f) VAL [y={3:0}] [L873] reach_error() VAL [y={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 274 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 129 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=6, InterpolantAutomatonStates: 23, 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, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 154 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 476 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 32/36 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 01:40:34,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...