/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/neural-networks/softmax_13_unsafe.c-amalgamation.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 10:32:37,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 10:32:37,361 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-03 10:32:37,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 10:32:37,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 10:32:37,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 10:32:37,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 10:32:37,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 10:32:37,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 10:32:37,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 10:32:37,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 10:32:37,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 10:32:37,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 10:32:37,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 10:32:37,397 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 10:32:37,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 10:32:37,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 10:32:37,398 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 10:32:37,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 10:32:37,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 10:32:37,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 10:32:37,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 10:32:37,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 10:32:37,400 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 10:32:37,400 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 10:32:37,401 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 10:32:37,401 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 10:32:37,401 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 10:32:37,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 10:32:37,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 10:32:37,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 10:32:37,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 10:32:37,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 10:32:37,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 10:32:37,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 10:32:37,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 10:32:37,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 10:32:37,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 10:32:37,404 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 10:32:37,404 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 10:32:37,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 10:32:37,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 10:32:37,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 10:32:37,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 10:32:37,405 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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-03 10:32:37,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 10:32:37,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 10:32:37,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 10:32:37,652 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 10:32:37,653 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 10:32:37,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/neural-networks/softmax_13_unsafe.c-amalgamation.i [2024-11-03 10:32:39,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 10:32:39,300 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 10:32:39,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/softmax_13_unsafe.c-amalgamation.i [2024-11-03 10:32:39,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c2c81d5/ea190e5a23a64e218ba967289d927d91/FLAGb604bd739 [2024-11-03 10:32:39,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c2c81d5/ea190e5a23a64e218ba967289d927d91 [2024-11-03 10:32:39,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 10:32:39,347 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 10:32:39,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 10:32:39,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 10:32:39,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 10:32:39,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 10:32:39" (1/1) ... [2024-11-03 10:32:39,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3235e836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:39, skipping insertion in model container [2024-11-03 10:32:39,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 10:32:39" (1/1) ... [2024-11-03 10:32:39,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 10:32:39,976 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_13_unsafe.c-amalgamation.i[63385,63398] [2024-11-03 10:32:39,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 10:32:39,990 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 10:32:40,046 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_13_unsafe.c-amalgamation.i[63385,63398] [2024-11-03 10:32:40,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 10:32:40,194 INFO L204 MainTranslator]: Completed translation [2024-11-03 10:32:40,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40 WrapperNode [2024-11-03 10:32:40,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 10:32:40,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 10:32:40,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 10:32:40,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 10:32:40,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (1/1) ... [2024-11-03 10:32:40,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (1/1) ... [2024-11-03 10:32:40,255 INFO L138 Inliner]: procedures = 562, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2024-11-03 10:32:40,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 10:32:40,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 10:32:40,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 10:32:40,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 10:32:40,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (1/1) ... [2024-11-03 10:32:40,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (1/1) ... [2024-11-03 10:32:40,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (1/1) ... [2024-11-03 10:32:40,285 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-03 10:32:40,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (1/1) ... [2024-11-03 10:32:40,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (1/1) ... [2024-11-03 10:32:40,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (1/1) ... [2024-11-03 10:32:40,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (1/1) ... [2024-11-03 10:32:40,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (1/1) ... [2024-11-03 10:32:40,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (1/1) ... [2024-11-03 10:32:40,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 10:32:40,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 10:32:40,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 10:32:40,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 10:32:40,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (1/1) ... [2024-11-03 10:32:40,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 10:32:40,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 10:32:40,340 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-03 10:32:40,346 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-03 10:32:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-03 10:32:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-03 10:32:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-03 10:32:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-03 10:32:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-03 10:32:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 10:32:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-03 10:32:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-03 10:32:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-03 10:32:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 10:32:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 10:32:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 10:32:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-03 10:32:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-03 10:32:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-03 10:32:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-03 10:32:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-03 10:32:40,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 10:32:40,511 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 10:32:41,487 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-03 10:32:41,487 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 10:32:41,495 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 10:32:41,495 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-03 10:32:41,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 10:32:41 BoogieIcfgContainer [2024-11-03 10:32:41,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 10:32:41,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 10:32:41,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 10:32:41,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 10:32:41,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 10:32:39" (1/3) ... [2024-11-03 10:32:41,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de06b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 10:32:41, skipping insertion in model container [2024-11-03 10:32:41,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:40" (2/3) ... [2024-11-03 10:32:41,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de06b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 10:32:41, skipping insertion in model container [2024-11-03 10:32:41,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 10:32:41" (3/3) ... [2024-11-03 10:32:41,502 INFO L112 eAbstractionObserver]: Analyzing ICFG softmax_13_unsafe.c-amalgamation.i [2024-11-03 10:32:41,513 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 10:32:41,514 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 10:32:41,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 10:32:41,560 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;@78f1a0c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 10:32:41,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 10:32:41,564 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-03 10:32:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-03 10:32:41,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:32:41,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:32:41,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:32:41,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:32:41,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1499734502, now seen corresponding path program 1 times [2024-11-03 10:32:41,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:32:41,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [753157101] [2024-11-03 10:32:41,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:32:41,582 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-03 10:32:41,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:32:41,585 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-03 10:32:41,586 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-03 10:32:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:32:41,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 10:32:41,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:32:41,774 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-03 10:32:41,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:32:41,779 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-03 10:32:41,780 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:32:41,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [753157101] [2024-11-03 10:32:41,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [753157101] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:32:41,781 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:32:41,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-03 10:32:41,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719986443] [2024-11-03 10:32:41,786 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:32:41,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 10:32:41,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:32:41,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 10:32:41,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 10:32:41,812 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-03 10:32:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:32:41,825 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2024-11-03 10:32:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 10:32:41,827 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-03 10:32:41,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:32:41,833 INFO L225 Difference]: With dead ends: 39 [2024-11-03 10:32:41,834 INFO L226 Difference]: Without dead ends: 17 [2024-11-03 10:32:41,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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-03 10:32:41,840 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-03 10:32:41,844 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-03 10:32:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-03 10:32:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-03 10:32:41,869 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-03 10:32:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-03 10:32:41,871 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2024-11-03 10:32:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:32:41,871 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-03 10:32:41,872 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-03 10:32:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-03 10:32:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-03 10:32:41,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:32:41,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:32:41,878 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-03 10:32:42,073 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-03 10:32:42,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:32:42,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:32:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash 411161283, now seen corresponding path program 1 times [2024-11-03 10:32:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:32:42,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599864630] [2024-11-03 10:32:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:32:42,076 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-03 10:32:42,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:32:42,079 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-03 10:32:42,080 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-03 10:32:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:32:42,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 10:32:42,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:32:42,275 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-03 10:32:42,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:32:42,301 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-03 10:32:42,302 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:32:42,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599864630] [2024-11-03 10:32:42,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1599864630] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:32:42,302 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:32:42,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 10:32:42,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717898120] [2024-11-03 10:32:42,303 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:32:42,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 10:32:42,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:32:42,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 10:32:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 10:32:42,309 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 10:32:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:32:42,778 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-03 10:32:42,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 10:32:42,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-03 10:32:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:32:42,781 INFO L225 Difference]: With dead ends: 31 [2024-11-03 10:32:42,781 INFO L226 Difference]: Without dead ends: 21 [2024-11-03 10:32:42,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-03 10:32:42,783 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 10:32:42,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 10:32:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-03 10:32:42,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-03 10:32:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 10:32:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-03 10:32:42,788 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2024-11-03 10:32:42,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:32:42,788 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-03 10:32:42,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 10:32:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-03 10:32:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-03 10:32:42,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:32:42,789 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:32:42,796 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 (3)] Ended with exit code 0 [2024-11-03 10:32:42,989 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-03 10:32:42,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:32:42,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:32:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash 410179299, now seen corresponding path program 1 times [2024-11-03 10:32:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:32:42,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [434388579] [2024-11-03 10:32:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:32:42,992 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-03 10:32:42,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:32:42,995 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-03 10:32:42,997 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-03 10:32:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:32:43,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 10:32:43,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:32:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 10:32:43,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:32:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 10:32:43,432 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:32:43,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [434388579] [2024-11-03 10:32:43,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [434388579] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 10:32:43,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 10:32:43,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-03 10:32:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953256604] [2024-11-03 10:32:43,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 10:32:43,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 10:32:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:32:43,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 10:32:43,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-03 10:32:43,434 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-03 10:32:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:32:43,982 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-03 10:32:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 10:32:43,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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 18 [2024-11-03 10:32:43,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:32:43,984 INFO L225 Difference]: With dead ends: 36 [2024-11-03 10:32:43,984 INFO L226 Difference]: Without dead ends: 26 [2024-11-03 10:32:43,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-03 10:32:43,985 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-03 10:32:43,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-03 10:32:43,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-03 10:32:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-03 10:32:43,990 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-03 10:32:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-11-03 10:32:43,990 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2024-11-03 10:32:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:32:43,991 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-03 10:32:43,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-03 10:32:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-11-03 10:32:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-03 10:32:43,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:32:43,992 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:32:43,998 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-03 10:32:44,195 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-03 10:32:44,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:32:44,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:32:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1684866034, now seen corresponding path program 2 times [2024-11-03 10:32:44,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:32:44,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [612359851] [2024-11-03 10:32:44,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:32:44,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 10:32:44,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:32:44,200 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-03 10:32:44,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-03 10:32:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:32:44,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 10:32:44,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:32:44,423 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-03 10:32:44,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:32:44,499 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-03 10:32:44,499 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:32:44,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [612359851] [2024-11-03 10:32:44,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [612359851] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:32:44,499 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:32:44,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-03 10:32:44,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582978011] [2024-11-03 10:32:44,500 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:32:44,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 10:32:44,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:32:44,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 10:32:44,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-03 10:32:44,505 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 10:32:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:32:45,930 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-11-03 10:32:45,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 10:32:45,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-03 10:32:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:32:45,932 INFO L225 Difference]: With dead ends: 37 [2024-11-03 10:32:45,932 INFO L226 Difference]: Without dead ends: 30 [2024-11-03 10:32:45,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-03 10:32:45,933 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-03 10:32:45,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-03 10:32:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-03 10:32:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-03 10:32:45,939 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-03 10:32:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-03 10:32:45,940 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 21 [2024-11-03 10:32:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:32:45,940 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-03 10:32:45,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 10:32:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-03 10:32:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-03 10:32:45,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:32:45,941 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:32:45,948 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-03 10:32:46,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 10:32:46,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:32:46,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:32:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1327175530, now seen corresponding path program 1 times [2024-11-03 10:32:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:32:46,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [815906281] [2024-11-03 10:32:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:32:46,143 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-03 10:32:46,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:32:46,144 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-03 10:32:46,145 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-03 10:32:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:32:46,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 10:32:46,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:32:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 10:32:46,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:32:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 10:32:46,996 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:32:46,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [815906281] [2024-11-03 10:32:46,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [815906281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 10:32:46,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 10:32:46,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-03 10:32:46,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252959830] [2024-11-03 10:32:46,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 10:32:46,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 10:32:46,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:32:46,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 10:32:46,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-03 10:32:46,999 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 10:32:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:32:49,942 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-11-03 10:32:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 10:32:49,943 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-03 10:32:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:32:49,944 INFO L225 Difference]: With dead ends: 48 [2024-11-03 10:32:49,944 INFO L226 Difference]: Without dead ends: 38 [2024-11-03 10:32:49,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-03 10:32:49,945 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-03 10:32:49,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 47 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-03 10:32:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-03 10:32:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-03 10:32:49,952 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-03 10:32:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-03 10:32:49,953 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 29 [2024-11-03 10:32:49,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:32:49,953 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-03 10:32:49,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 10:32:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-03 10:32:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-03 10:32:49,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:32:49,954 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-03 10:32:49,973 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-03 10:32:50,154 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-03 10:32:50,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:32:50,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:32:50,156 INFO L85 PathProgramCache]: Analyzing trace with hash -314962658, now seen corresponding path program 2 times [2024-11-03 10:32:50,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:32:50,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [926248117] [2024-11-03 10:32:50,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:32:50,156 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-03 10:32:50,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:32:50,158 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-03 10:32:50,159 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-03 10:32:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 10:32:52,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-03 10:32:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 10:32:53,696 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-03 10:32:53,696 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-03 10:32:53,697 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 10:32:53,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-03 10:32:53,899 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-03 10:32:53,902 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2024-11-03 10:32:53,950 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 10:32:53,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 10:32:53 BoogieIcfgContainer [2024-11-03 10:32:53,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 10:32:53,953 INFO L158 Benchmark]: Toolchain (without parser) took 14606.29ms. Allocated memory is still 282.1MB. Free memory was 225.4MB in the beginning and 148.2MB in the end (delta: 77.3MB). Peak memory consumption was 77.6MB. Max. memory is 8.0GB. [2024-11-03 10:32:53,953 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 10:32:53,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 844.44ms. Allocated memory is still 282.1MB. Free memory was 225.4MB in the beginning and 213.2MB in the end (delta: 12.2MB). Peak memory consumption was 42.4MB. Max. memory is 8.0GB. [2024-11-03 10:32:53,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.64ms. Allocated memory is still 282.1MB. Free memory was 213.2MB in the beginning and 210.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 10:32:53,954 INFO L158 Benchmark]: Boogie Preprocessor took 48.13ms. Allocated memory is still 282.1MB. Free memory was 210.1MB in the beginning and 207.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 10:32:53,954 INFO L158 Benchmark]: RCFGBuilder took 1191.38ms. Allocated memory is still 282.1MB. Free memory was 207.5MB in the beginning and 191.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-03 10:32:53,954 INFO L158 Benchmark]: TraceAbstraction took 12454.69ms. Allocated memory is still 282.1MB. Free memory was 191.2MB in the beginning and 148.2MB in the end (delta: 43.1MB). Peak memory consumption was 42.6MB. Max. memory is 8.0GB. [2024-11-03 10:32:53,955 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.12ms. Allocated memory is still 192.9MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 844.44ms. Allocated memory is still 282.1MB. Free memory was 225.4MB in the beginning and 213.2MB in the end (delta: 12.2MB). Peak memory consumption was 42.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.64ms. Allocated memory is still 282.1MB. Free memory was 213.2MB in the beginning and 210.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.13ms. Allocated memory is still 282.1MB. Free memory was 210.1MB in the beginning and 207.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1191.38ms. Allocated memory is still 282.1MB. Free memory was 207.5MB in the beginning and 191.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12454.69ms. Allocated memory is still 282.1MB. Free memory was 191.2MB in the beginning and 148.2MB in the end (delta: 43.1MB). Peak memory consumption was 42.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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.000016212929040193558, 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.000006212929292814806, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=2, max=-0.000006212929292814806, 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=0.000000000000000000000000000006264664923102801, 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=-0.00000000000000000000000000000017872629883913549, 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=-0.000000000000000000000000000000000000011754943508222875, 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=-0.000000000000000000000000000000000002268704097087015, x={-2147483648:0}, y={3:0}] [L853] COND FALSE !(i < n) VAL [max=0.654321014881134, n=4, sum=-0.000000000000000000000000000000000002268704097087015, x={-2147483648:0}, y={3:0}] [L858] i = 0 VAL [i=0, max=0.654321014881134, n=4, sum=-0.000000000000000000000000000000000002268704097087015, 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=-0.000000000000000000000000000000000002268704097087015, 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=-0.000000000000000000000000000000000002268704097087015, 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=-0.000000000000000000000000000000000002268704097087015, 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=-0.000000000000000000000000000000000002268704097087015, x={-2147483648:0}, y={3:0}] [L858] COND FALSE !(i < n) VAL [max=0.654321014881134, sum=-0.000000000000000000000000000000000002268704097087015, x={-2147483648:0}, y={3:0}] [L869] RET softmax(x, y, 4) [L870] EXPR y[2] [L870] EXPR y[3] [L870] COND TRUE !(__builtin_isgreaterequal(y[2], y[3])) [L870] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 236 IncrementalHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 77 mSDtfsCounter, 236 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=5, InterpolantAutomatonStates: 24, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 440 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 56/74 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-03 10:32:53,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...