/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_2_safe.c-amalgamation.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 01:40:08,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 01:40:08,536 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:08,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 01:40:08,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 01:40:08,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 01:40:08,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 01:40:08,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 01:40:08,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 01:40:08,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 01:40:08,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 01:40:08,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 01:40:08,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 01:40:08,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 01:40:08,568 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 01:40:08,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 01:40:08,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 01:40:08,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 01:40:08,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 01:40:08,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 01:40:08,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 01:40:08,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 01:40:08,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 01:40:08,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 01:40:08,571 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 01:40:08,571 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 01:40:08,571 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 01:40:08,571 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 01:40:08,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 01:40:08,572 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 01:40:08,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 01:40:08,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 01:40:08,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 01:40:08,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 01:40:08,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 01:40:08,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 01:40:08,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 01:40:08,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 01:40:08,574 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 01:40:08,574 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 01:40:08,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 01:40:08,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 01:40:08,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 01:40:08,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 01:40:08,576 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:08,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 01:40:08,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 01:40:08,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 01:40:08,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 01:40:08,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 01:40:08,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/neural-networks/softmax_2_safe.c-amalgamation.i [2024-11-06 01:40:10,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 01:40:10,462 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 01:40:10,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/softmax_2_safe.c-amalgamation.i [2024-11-06 01:40:10,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5810df9/2b21da3f660c47319df431228b3bbf10/FLAGcf89c8a4d [2024-11-06 01:40:10,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5810df9/2b21da3f660c47319df431228b3bbf10 [2024-11-06 01:40:10,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 01:40:10,734 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 01:40:10,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 01:40:10,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 01:40:10,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 01:40:10,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:40:10" (1/1) ... [2024-11-06 01:40:10,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dce129d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:10, skipping insertion in model container [2024-11-06 01:40:10,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:40:10" (1/1) ... [2024-11-06 01:40:10,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 01:40:11,402 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_2_safe.c-amalgamation.i[63649,63662] [2024-11-06 01:40:11,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 01:40:11,415 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 01:40:11,459 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_2_safe.c-amalgamation.i[63649,63662] [2024-11-06 01:40:11,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 01:40:11,588 INFO L204 MainTranslator]: Completed translation [2024-11-06 01:40:11,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:11 WrapperNode [2024-11-06 01:40:11,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 01:40:11,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 01:40:11,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 01:40:11,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 01:40:11,595 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:11" (1/1) ... [2024-11-06 01:40:11,623 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:11" (1/1) ... [2024-11-06 01:40:11,651 INFO L138 Inliner]: procedures = 562, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 121 [2024-11-06 01:40:11,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 01:40:11,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 01:40:11,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 01:40:11,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 01:40:11,662 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:11" (1/1) ... [2024-11-06 01:40:11,663 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:11" (1/1) ... [2024-11-06 01:40:11,667 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:11" (1/1) ... [2024-11-06 01:40:11,680 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 7, 4, 12]. 48 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 6 writes are split as follows [0, 0, 2, 4]. [2024-11-06 01:40:11,681 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:11" (1/1) ... [2024-11-06 01:40:11,681 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:11" (1/1) ... [2024-11-06 01:40:11,689 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:11" (1/1) ... [2024-11-06 01:40:11,692 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:11" (1/1) ... [2024-11-06 01:40:11,694 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:11" (1/1) ... [2024-11-06 01:40:11,696 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:11" (1/1) ... [2024-11-06 01:40:11,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 01:40:11,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 01:40:11,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 01:40:11,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 01:40:11,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:11" (1/1) ... [2024-11-06 01:40:11,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 01:40:11,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 01:40:11,737 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:11,742 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:11,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-06 01:40:11,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-06 01:40:11,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-06 01:40:11,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-06 01:40:11,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 01:40:11,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 01:40:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 01:40:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 01:40:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-06 01:40:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 01:40:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 01:40:11,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 01:40:11,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-06 01:40:11,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-06 01:40:11,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-06 01:40:11,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-06 01:40:11,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 01:40:11,908 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 01:40:11,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 01:40:12,541 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-06 01:40:12,541 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 01:40:12,553 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 01:40:12,553 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-06 01:40:12,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:40:12 BoogieIcfgContainer [2024-11-06 01:40:12,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 01:40:12,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 01:40:12,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 01:40:12,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 01:40:12,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 01:40:10" (1/3) ... [2024-11-06 01:40:12,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437ba97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:40:12, skipping insertion in model container [2024-11-06 01:40:12,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:11" (2/3) ... [2024-11-06 01:40:12,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437ba97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:40:12, skipping insertion in model container [2024-11-06 01:40:12,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:40:12" (3/3) ... [2024-11-06 01:40:12,571 INFO L112 eAbstractionObserver]: Analyzing ICFG softmax_2_safe.c-amalgamation.i [2024-11-06 01:40:12,588 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 01:40:12,589 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 01:40:12,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 01:40:12,649 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;@43a692e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 01:40:12,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 01:40:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 01:40:12,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:12,658 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:12,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:12,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1115135503, now seen corresponding path program 1 times [2024-11-06 01:40:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:12,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628662181] [2024-11-06 01:40:12,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:12,671 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:12,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:12,673 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:12,675 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:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:12,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 01:40:12,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:12,846 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:12,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:40:12,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:12,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628662181] [2024-11-06 01:40:12,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628662181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:40:12,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:40:12,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 01:40:12,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179332364] [2024-11-06 01:40:12,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:40:12,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 01:40:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 01:40:12,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 01:40:12,871 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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 9.0) internal successors, (18), 2 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:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:12,885 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2024-11-06 01:40:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 01:40:12,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 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:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:12,895 INFO L225 Difference]: With dead ends: 51 [2024-11-06 01:40:12,895 INFO L226 Difference]: Without dead ends: 23 [2024-11-06 01:40:12,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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:12,903 INFO L432 NwaCegarLoop]: 30 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, 30 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:12,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 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:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-06 01:40:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-06 01:40:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-06 01:40:12,932 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2024-11-06 01:40:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:12,933 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-06 01:40:12,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 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:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-06 01:40:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 01:40:12,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:12,934 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:12,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-06 01:40:13,135 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:13,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:13,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1012784617, now seen corresponding path program 1 times [2024-11-06 01:40:13,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:13,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843897725] [2024-11-06 01:40:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:13,138 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:13,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:13,141 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:13,143 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:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:13,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 01:40:13,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:13,343 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:13,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:40:13,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:13,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843897725] [2024-11-06 01:40:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843897725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:40:13,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:40:13,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 01:40:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134364204] [2024-11-06 01:40:13,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:40:13,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 01:40:13,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:13,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 01:40:13,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 01:40:13,349 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:13,787 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-11-06 01:40:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 01:40:13,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:13,788 INFO L225 Difference]: With dead ends: 36 [2024-11-06 01:40:13,789 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 01:40:13,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:13,790 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 35 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.4s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:13,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 35 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 01:40:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 01:40:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-06 01:40:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-06 01:40:13,802 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 18 [2024-11-06 01:40:13,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:13,803 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-06 01:40:13,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-06 01:40:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-06 01:40:13,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:13,804 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 01:40:13,810 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:14,004 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:14,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:14,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:14,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1861853373, now seen corresponding path program 1 times [2024-11-06 01:40:14,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:14,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334553951] [2024-11-06 01:40:14,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:14,007 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:14,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:14,009 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:14,010 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:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:14,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 01:40:14,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 01:40:14,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:40:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 01:40:14,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:14,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334553951] [2024-11-06 01:40:14,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334553951] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:40:14,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:40:14,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 01:40:14,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242119953] [2024-11-06 01:40:14,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:40:14,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 01:40:14,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:14,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 01:40:14,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 01:40:14,319 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:14,953 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-06 01:40:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 01:40:14,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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) Word has length 21 [2024-11-06 01:40:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:14,955 INFO L225 Difference]: With dead ends: 40 [2024-11-06 01:40:14,955 INFO L226 Difference]: Without dead ends: 30 [2024-11-06 01:40:14,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 01:40:14,957 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:14,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 69 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 01:40:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-06 01:40:14,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-06 01:40:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-06 01:40:14,966 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 21 [2024-11-06 01:40:14,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:14,967 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-06 01:40:14,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-06 01:40:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-06 01:40:14,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:14,968 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:40:14,976 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:15,168 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:15,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:15,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:15,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1527099075, now seen corresponding path program 2 times [2024-11-06 01:40:15,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:15,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660090137] [2024-11-06 01:40:15,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 01:40:15,170 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:15,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:15,172 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:15,173 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:15,279 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 01:40:15,279 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:40:15,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 01:40:15,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 01:40:15,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:40:15,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:15,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660090137] [2024-11-06 01:40:15,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660090137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:40:15,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:40:15,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 01:40:15,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631317495] [2024-11-06 01:40:15,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:40:15,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 01:40:15,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:15,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 01:40:15,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 01:40:15,369 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:16,684 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-06 01:40:16,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 01:40:16,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 27 [2024-11-06 01:40:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:16,686 INFO L225 Difference]: With dead ends: 41 [2024-11-06 01:40:16,686 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 01:40:16,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:16,687 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 30 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.3s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:16,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 30 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 01:40:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 01:40:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-06 01:40:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-06 01:40:16,692 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 27 [2024-11-06 01:40:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:16,693 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-06 01:40:16,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-06 01:40:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 01:40:16,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:16,694 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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:16,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-06 01:40:16,894 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:16,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:16,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash 95620673, now seen corresponding path program 1 times [2024-11-06 01:40:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:16,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672226458] [2024-11-06 01:40:16,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:16,896 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:16,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:16,897 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:16,898 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:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:17,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 01:40:17,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 01:40:17,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:40:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 01:40:17,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:17,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672226458] [2024-11-06 01:40:17,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672226458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:40:17,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:40:17,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-06 01:40:17,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631766573] [2024-11-06 01:40:17,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:40:17,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 01:40:17,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 01:40:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-06 01:40:17,381 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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:18,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-06 01:40:20,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-06 01:40:21,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:21,086 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2024-11-06 01:40:21,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 01:40:21,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 31 [2024-11-06 01:40:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:21,088 INFO L225 Difference]: With dead ends: 52 [2024-11-06 01:40:21,088 INFO L226 Difference]: Without dead ends: 44 [2024-11-06 01:40:21,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-06 01:40:21,089 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:21,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 63 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-06 01:40:21,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-06 01:40:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-06 01:40:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 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:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-06 01:40:21,096 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 31 [2024-11-06 01:40:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:21,097 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-06 01:40:21,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-06 01:40:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-06 01:40:21,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:21,098 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:40:21,108 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 01:40:21,298 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:21,299 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:21,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2083858099, now seen corresponding path program 2 times [2024-11-06 01:40:21,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:21,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844640615] [2024-11-06 01:40:21,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 01:40:21,300 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:21,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:21,301 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:21,302 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:22,907 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 01:40:22,907 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 01:40:22,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 01:40:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 01:40:24,476 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-06 01:40:24,476 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 01:40:24,477 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 01:40:24,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-06 01:40:24,678 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:24,681 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2024-11-06 01:40:24,730 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 01:40:24,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 01:40:24 BoogieIcfgContainer [2024-11-06 01:40:24,733 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 01:40:24,733 INFO L158 Benchmark]: Toolchain (without parser) took 13999.63ms. Allocated memory is still 359.7MB. Free memory was 303.3MB in the beginning and 249.3MB in the end (delta: 53.9MB). Peak memory consumption was 54.7MB. Max. memory is 8.0GB. [2024-11-06 01:40:24,733 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 203.4MB. Free memory was 156.8MB in the beginning and 156.8MB in the end (delta: 66.8kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 01:40:24,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 853.92ms. Allocated memory is still 359.7MB. Free memory was 303.3MB in the beginning and 301.2MB in the end (delta: 2.1MB). Peak memory consumption was 48.0MB. Max. memory is 8.0GB. [2024-11-06 01:40:24,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.41ms. Allocated memory is still 359.7MB. Free memory was 301.2MB in the beginning and 298.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-06 01:40:24,734 INFO L158 Benchmark]: Boogie Preprocessor took 47.88ms. Allocated memory is still 359.7MB. Free memory was 298.0MB in the beginning and 294.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-06 01:40:24,734 INFO L158 Benchmark]: RCFGBuilder took 856.50ms. Allocated memory is still 359.7MB. Free memory was 294.9MB in the beginning and 278.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-06 01:40:24,735 INFO L158 Benchmark]: TraceAbstraction took 12172.80ms. Allocated memory is still 359.7MB. Free memory was 278.1MB in the beginning and 249.3MB in the end (delta: 28.7MB). Peak memory consumption was 28.7MB. Max. memory is 8.0GB. [2024-11-06 01:40:24,736 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 203.4MB. Free memory was 156.8MB in the beginning and 156.8MB in the end (delta: 66.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 853.92ms. Allocated memory is still 359.7MB. Free memory was 303.3MB in the beginning and 301.2MB in the end (delta: 2.1MB). Peak memory consumption was 48.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.41ms. Allocated memory is still 359.7MB. Free memory was 301.2MB in the beginning and 298.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.88ms. Allocated memory is still 359.7MB. Free memory was 298.0MB in the beginning and 294.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 856.50ms. Allocated memory is still 359.7MB. Free memory was 294.9MB in the beginning and 278.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 12172.80ms. Allocated memory is still 359.7MB. Free memory was 278.1MB in the beginning and 249.3MB in the end (delta: 28.7MB). Peak memory consumption was 28.7MB. 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 871. Possible FailurePath: [L863] float x[4], y[4]; [L864] x[0] = __VERIFIER_nondet_float() [L865] x[1] = __VERIFIER_nondet_float() [L866] x[2] = __VERIFIER_nondet_float() [L867] x[3] = __VERIFIER_nondet_float() [L868] EXPR x[0] [L868] COND FALSE !(!(!__builtin_isnan (x[0]) && !__builtin_isinf_sign (x[0]))) [L869] EXPR x[1] [L869] COND FALSE !(!(!__builtin_isnan (x[1]) && !__builtin_isinf_sign (x[1]))) [L870] EXPR x[2] [L870] COND FALSE !(!(!__builtin_isnan (x[2]) && !__builtin_isinf_sign (x[2]))) [L871] EXPR x[3] [L871] COND FALSE !(!(!__builtin_isnan (x[3]) && !__builtin_isinf_sign (x[3]))) [L872] CALL softmax(x, y, 4) [L847] int i; [L848] EXPR x[0] [L848] float max = x[0]; [L849] i = 1 VAL [i=1, max=0.000000000000000000000000000000000000000000002802596928649634, n=4, x={-2147483648: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=2.0, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=2, max=2.0, n=4, x={-2147483648: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=2, max=36893496943512125000, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=3, max=36893496943512125000, n=4, x={-2147483648: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=3, max=158456325028528680000000000000, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=4, max=158456325028528680000000000000, n=4, x={-2147483648:0}, y={3:0}] [L849] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, n=4, x={-2147483648:0}, y={3:0}] [L852] float sum = 0.0f; [L853] i = 0 VAL [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648: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=158456325028528680000000000000, n=4, sum=-0.0000000000000000000000000000000001215084862804738, x={-2147483648: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=158456325028528680000000000000, n=4, sum=1.0078125, x={-2147483648: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=3, max=158456325028528680000000000000, n=4, sum=16529.25390625, x={-2147483648: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=4, max=158456325028528680000000000000, n=4, sum=16529.25390625, x={-2147483648:0}, y={3:0}] [L853] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, n=4, sum=16529.25390625, x={-2147483648:0}, y={3:0}] [L858] i = 0 VAL [i=0, max=158456325028528680000000000000, n=4, sum=16529.25390625, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=1, max=158456325028528680000000000000, n=4, sum=16529.25390625, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=2, max=158456325028528680000000000000, n=4, sum=16529.25390625, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=3, max=158456325028528680000000000000, n=4, sum=16529.25390625, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=4, max=158456325028528680000000000000, n=4, sum=16529.25390625, x={-2147483648:0}, y={3:0}] [L858] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, sum=16529.25390625, x={-2147483648:0}, y={3:0}] [L872] RET softmax(x, y, 4) [L873] EXPR y[0] [L873] COND TRUE !(__builtin_isgreaterequal(y[0], 0.0f)) [L873] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 227 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 151 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 109 mSDtfsCounter, 151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=5, InterpolantAutomatonStates: 21, 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, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 158 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 304 SizeOfPredicates, 0 NumberOfNonLiveVariables, 439 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 38/42 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:24,769 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...