/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_11_safe.c-amalgamation.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 01:40:02,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 01:40:02,077 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:02,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 01:40:02,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 01:40:02,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 01:40:02,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 01:40:02,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 01:40:02,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 01:40:02,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 01:40:02,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 01:40:02,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 01:40:02,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 01:40:02,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 01:40:02,109 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 01:40:02,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 01:40:02,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 01:40:02,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 01:40:02,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 01:40:02,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 01:40:02,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 01:40:02,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 01:40:02,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 01:40:02,117 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 01:40:02,117 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 01:40:02,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 01:40:02,117 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 01:40:02,118 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 01:40:02,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 01:40:02,118 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 01:40:02,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 01:40:02,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 01:40:02,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 01:40:02,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 01:40:02,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 01:40:02,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 01:40:02,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 01:40:02,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 01:40:02,121 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 01:40:02,122 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 01:40:02,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 01:40:02,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 01:40:02,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 01:40:02,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 01:40:02,123 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:02,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 01:40:02,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 01:40:02,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 01:40:02,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 01:40:02,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 01:40:02,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/neural-networks/softmax_11_safe.c-amalgamation.i [2024-11-06 01:40:03,763 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 01:40:04,032 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 01:40:04,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/softmax_11_safe.c-amalgamation.i [2024-11-06 01:40:04,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946de2b12/bae25d40639442aca75548a4ec2fd2d5/FLAG920972968 [2024-11-06 01:40:04,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946de2b12/bae25d40639442aca75548a4ec2fd2d5 [2024-11-06 01:40:04,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 01:40:04,073 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 01:40:04,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 01:40:04,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 01:40:04,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 01:40:04,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:40:04" (1/1) ... [2024-11-06 01:40:04,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2454e39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:04, skipping insertion in model container [2024-11-06 01:40:04,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:40:04" (1/1) ... [2024-11-06 01:40:04,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 01:40:04,638 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_11_safe.c-amalgamation.i[63382,63395] [2024-11-06 01:40:04,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 01:40:04,657 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 01:40:04,723 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_11_safe.c-amalgamation.i[63382,63395] [2024-11-06 01:40:04,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 01:40:04,888 INFO L204 MainTranslator]: Completed translation [2024-11-06 01:40:04,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:04 WrapperNode [2024-11-06 01:40:04,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 01:40:04,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 01:40:04,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 01:40:04,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 01:40:04,894 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:04" (1/1) ... [2024-11-06 01:40:04,915 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:04" (1/1) ... [2024-11-06 01:40:04,937 INFO L138 Inliner]: procedures = 562, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2024-11-06 01:40:04,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 01:40:04,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 01:40:04,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 01:40:04,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 01:40:04,946 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:04" (1/1) ... [2024-11-06 01:40:04,947 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:04" (1/1) ... [2024-11-06 01:40:04,950 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:04" (1/1) ... [2024-11-06 01:40:04,968 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 7, 10, 5]. 42 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, 4, 2]. [2024-11-06 01:40:04,968 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:04" (1/1) ... [2024-11-06 01:40:04,968 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:04" (1/1) ... [2024-11-06 01:40:04,985 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:04" (1/1) ... [2024-11-06 01:40:04,989 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:04" (1/1) ... [2024-11-06 01:40:04,991 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:04" (1/1) ... [2024-11-06 01:40:04,992 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:04" (1/1) ... [2024-11-06 01:40:04,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 01:40:04,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 01:40:04,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 01:40:04,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 01:40:05,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:04" (1/1) ... [2024-11-06 01:40:05,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 01:40:05,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 01:40:05,036 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:05,039 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:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-06 01:40:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-06 01:40:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-06 01:40:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-06 01:40:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 01:40:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 01:40:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 01:40:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 01:40:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-06 01:40:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 01:40:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 01:40:05,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 01:40:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-06 01:40:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-06 01:40:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-06 01:40:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-06 01:40:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 01:40:05,214 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 01:40:05,216 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 01:40:06,189 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-06 01:40:06,189 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 01:40:06,199 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 01:40:06,199 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-06 01:40:06,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:40:06 BoogieIcfgContainer [2024-11-06 01:40:06,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 01:40:06,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 01:40:06,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 01:40:06,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 01:40:06,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 01:40:04" (1/3) ... [2024-11-06 01:40:06,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631a18f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:40:06, skipping insertion in model container [2024-11-06 01:40:06,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:40:04" (2/3) ... [2024-11-06 01:40:06,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631a18f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:40:06, skipping insertion in model container [2024-11-06 01:40:06,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:40:06" (3/3) ... [2024-11-06 01:40:06,215 INFO L112 eAbstractionObserver]: Analyzing ICFG softmax_11_safe.c-amalgamation.i [2024-11-06 01:40:06,228 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 01:40:06,228 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 01:40:06,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 01:40:06,277 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;@446b6a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 01:40:06,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 01:40:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 01:40:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-06 01:40:06,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:06,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:40:06,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:06,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:06,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1499734502, now seen corresponding path program 1 times [2024-11-06 01:40:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:06,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29203331] [2024-11-06 01:40:06,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:06,303 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:06,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:06,305 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:06,306 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:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:06,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 01:40:06,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:06,473 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:06,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:40:06,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:06,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29203331] [2024-11-06 01:40:06,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29203331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:40:06,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:40:06,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 01:40:06,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486976860] [2024-11-06 01:40:06,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:40:06,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 01:40:06,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:06,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 01:40:06,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 01:40:06,500 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 01:40:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:06,511 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2024-11-06 01:40:06,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 01:40:06,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-06 01:40:06,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:06,519 INFO L225 Difference]: With dead ends: 39 [2024-11-06 01:40:06,519 INFO L226 Difference]: Without dead ends: 17 [2024-11-06 01:40:06,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:06,527 INFO L432 NwaCegarLoop]: 24 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, 24 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:06,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 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:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-06 01:40:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-06 01:40:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-06 01:40:06,557 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2024-11-06 01:40:06,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:06,557 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-06 01:40:06,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 01:40:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-06 01:40:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-06 01:40:06,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:06,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:40:06,565 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:06,759 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:06,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:06,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash 411161283, now seen corresponding path program 1 times [2024-11-06 01:40:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:06,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640015120] [2024-11-06 01:40:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:06,762 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:06,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:06,763 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:06,765 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:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:06,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 01:40:06,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:06,946 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:06,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:40:06,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:06,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640015120] [2024-11-06 01:40:06,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640015120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:40:06,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:40:06,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 01:40:06,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619717076] [2024-11-06 01:40:06,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:40:06,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 01:40:06,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:06,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 01:40:06,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 01:40:06,952 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 01:40:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:07,996 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-06 01:40:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 01:40:07,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-06 01:40:07,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:07,998 INFO L225 Difference]: With dead ends: 30 [2024-11-06 01:40:07,998 INFO L226 Difference]: Without dead ends: 20 [2024-11-06 01:40:07,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:07,999 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:08,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 01:40:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-06 01:40:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-06 01:40:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-06 01:40:08,004 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2024-11-06 01:40:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:08,005 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-06 01:40:08,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 01:40:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-06 01:40:08,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 01:40:08,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:08,006 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:08,012 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:08,206 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:08,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:08,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1799615534, now seen corresponding path program 1 times [2024-11-06 01:40:08,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:08,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679251751] [2024-11-06 01:40:08,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:08,208 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:08,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:08,210 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:08,211 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:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:08,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 01:40:08,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:08,460 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:08,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:40:08,537 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:08,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:08,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679251751] [2024-11-06 01:40:08,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679251751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:40:08,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:40:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 01:40:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627238294] [2024-11-06 01:40:08,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:40:08,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 01:40:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:08,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 01:40:08,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 01:40:08,543 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:09,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:09,525 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-11-06 01:40:09,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 01:40:09,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:09,527 INFO L225 Difference]: With dead ends: 34 [2024-11-06 01:40:09,527 INFO L226 Difference]: Without dead ends: 24 [2024-11-06 01:40:09,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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:09,528 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:09,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 01:40:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-06 01:40:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-06 01:40:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 01:40:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-11-06 01:40:09,533 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2024-11-06 01:40:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:09,533 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-06 01:40:09,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-11-06 01:40:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-06 01:40:09,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:09,534 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:40:09,541 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:09,735 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:09,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:09,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1684866034, now seen corresponding path program 2 times [2024-11-06 01:40:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729162324] [2024-11-06 01:40:09,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 01:40:09,737 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:09,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:09,740 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:09,741 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:09,853 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 01:40:09,853 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:40:09,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 01:40:09,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:09,930 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:09,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:40:09,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:09,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729162324] [2024-11-06 01:40:09,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729162324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:40:09,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:40:09,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 01:40:09,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307329620] [2024-11-06 01:40:09,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:40:09,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 01:40:09,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 01:40:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 01:40:09,932 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:11,424 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-11-06 01:40:11,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 01:40:11,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 21 [2024-11-06 01:40:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:11,425 INFO L225 Difference]: With dead ends: 35 [2024-11-06 01:40:11,425 INFO L226 Difference]: Without dead ends: 28 [2024-11-06 01:40:11,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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:11,426 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:11,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 23 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 01:40:11,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-06 01:40:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-06 01:40:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 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:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-06 01:40:11,431 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2024-11-06 01:40:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:11,432 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-06 01:40:11,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-06 01:40:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 01:40:11,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:11,433 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:40:11,439 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:11,633 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:11,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:11,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1465781074, now seen corresponding path program 1 times [2024-11-06 01:40:11,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:11,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709620585] [2024-11-06 01:40:11,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:40:11,635 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:11,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:11,636 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:11,638 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:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:40:11,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 01:40:11,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:40:12,079 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:12,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:40:12,222 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:12,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:40:12,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709620585] [2024-11-06 01:40:12,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709620585] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:40:12,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:40:12,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-06 01:40:12,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575603485] [2024-11-06 01:40:12,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:40:12,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 01:40:12,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:40:12,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 01:40:12,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-06 01:40:12,224 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:40:13,695 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-11-06 01:40:13,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 01:40:13,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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 25 [2024-11-06 01:40:13,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:40:13,697 INFO L225 Difference]: With dead ends: 46 [2024-11-06 01:40:13,697 INFO L226 Difference]: Without dead ends: 38 [2024-11-06 01:40:13,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 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:13,698 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 01:40:13,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 43 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 01:40:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-06 01:40:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-06 01:40:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-06 01:40:13,705 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2024-11-06 01:40:13,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:40:13,706 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-06 01:40:13,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-06 01:40:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 01:40:13,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:40:13,707 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:40:13,721 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:13,907 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:13,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:40:13,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:40:13,909 INFO L85 PathProgramCache]: Analyzing trace with hash -314962658, now seen corresponding path program 2 times [2024-11-06 01:40:13,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:40:13,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036360362] [2024-11-06 01:40:13,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 01:40:13,909 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,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:40:13,910 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:13,911 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:15,541 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 01:40:15,542 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 01:40:15,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 01:40:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 01:40:17,096 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-06 01:40:17,096 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 01:40:17,097 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 01:40:17,125 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:17,298 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:17,302 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2024-11-06 01:40:17,340 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 01:40:17,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 01:40:17 BoogieIcfgContainer [2024-11-06 01:40:17,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 01:40:17,344 INFO L158 Benchmark]: Toolchain (without parser) took 13271.06ms. Allocated memory is still 330.3MB. Free memory was 280.8MB in the beginning and 226.4MB in the end (delta: 54.5MB). Peak memory consumption was 55.5MB. Max. memory is 8.0GB. [2024-11-06 01:40:17,344 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 213.9MB. Free memory is still 167.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 01:40:17,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 815.41ms. Allocated memory is still 330.3MB. Free memory was 280.3MB in the beginning and 213.7MB in the end (delta: 66.6MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. [2024-11-06 01:40:17,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.99ms. Allocated memory is still 330.3MB. Free memory was 213.7MB in the beginning and 210.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-06 01:40:17,344 INFO L158 Benchmark]: Boogie Preprocessor took 57.97ms. Allocated memory is still 330.3MB. Free memory was 210.6MB in the beginning and 208.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-06 01:40:17,345 INFO L158 Benchmark]: RCFGBuilder took 1202.82ms. Allocated memory is still 330.3MB. Free memory was 208.0MB in the beginning and 191.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-06 01:40:17,345 INFO L158 Benchmark]: TraceAbstraction took 11136.95ms. Allocated memory is still 330.3MB. Free memory was 191.2MB in the beginning and 226.4MB in the end (delta: -35.2MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 01:40:17,346 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 213.9MB. Free memory is still 167.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 815.41ms. Allocated memory is still 330.3MB. Free memory was 280.3MB in the beginning and 213.7MB in the end (delta: 66.6MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.99ms. Allocated memory is still 330.3MB. Free memory was 213.7MB in the beginning and 210.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.97ms. Allocated memory is still 330.3MB. Free memory was 210.6MB in the beginning and 208.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1202.82ms. Allocated memory is still 330.3MB. Free memory was 208.0MB in the beginning and 191.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 11136.95ms. Allocated memory is still 330.3MB. Free memory was 191.2MB in the beginning and 226.4MB in the end (delta: -35.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 870]: 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 868. Possible FailurePath: [L863] float x[4], y[4]; [L864] x[0] = __VERIFIER_nondet_float() [L865] EXPR x[0] [L865] x[1] = x[0] + 1e-5f [L866] x[2] = 0.123456f [L867] x[3] = 0.654321f [L868] EXPR x[0] [L868] COND FALSE !(!(!__builtin_isnan (x[0]) && !__builtin_isinf_sign (x[0]))) [L869] 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.06173799932003021, 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=-0.06172800064086914, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=2, max=-0.06172800064086914, 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=0.12345600128173828, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=3, max=0.12345600128173828, 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=0.654321014881134, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=4, max=0.654321014881134, n=4, x={-2147483648:0}, y={3:0}] [L849] COND FALSE !(i < n) VAL [max=0.654321014881134, n=4, x={-2147483648:0}, y={3:0}] [L852] float sum = 0.0f; [L853] i = 0 VAL [i=0, max=0.654321014881134, 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=0.654321014881134, n=4, sum=38685663121156280000000000, 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=0.654321014881134, n=4, sum=36893488147419103000, 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=0.654321014881134, n=4, sum=562949953421312, 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=0.654321014881134, n=4, sum=562949953421312, x={-2147483648:0}, y={3:0}] [L853] COND FALSE !(i < n) VAL [max=0.654321014881134, n=4, sum=562949953421312, x={-2147483648:0}, y={3:0}] [L858] i = 0 VAL [i=0, max=0.654321014881134, n=4, sum=562949953421312, 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=0.654321014881134, n=4, sum=562949953421312, 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=0.654321014881134, n=4, sum=562949953421312, 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=0.654321014881134, n=4, sum=562949953421312, 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=0.654321014881134, n=4, sum=562949953421312, x={-2147483648:0}, y={3:0}] [L858] COND FALSE !(i < n) VAL [max=0.654321014881134, sum=562949953421312, x={-2147483648:0}, y={3:0}] [L869] RET softmax(x, y, 4) [L870] EXPR y[0] [L870] EXPR y[1] [L870] COND TRUE !(__builtin_islessequal(y[0], y[1])) [L870] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 142 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 79 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 122 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 402 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:17,379 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...