/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_7_unsafe.c-amalgamation.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 22:01:12,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 22:01:12,430 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-05 22:01:12,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 22:01:12,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 22:01:12,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 22:01:12,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 22:01:12,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 22:01:12,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 22:01:12,458 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 22:01:12,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 22:01:12,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 22:01:12,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 22:01:12,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 22:01:12,459 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 22:01:12,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 22:01:12,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 22:01:12,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 22:01:12,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 22:01:12,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 22:01:12,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 22:01:12,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 22:01:12,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 22:01:12,464 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 22:01:12,464 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 22:01:12,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 22:01:12,464 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 22:01:12,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 22:01:12,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 22:01:12,464 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 22:01:12,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 22:01:12,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 22:01:12,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 22:01:12,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 22:01:12,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 22:01:12,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 22:01:12,465 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 22:01:12,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 22:01:12,466 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 22:01:12,466 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 22:01:12,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 22:01:12,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 22:01:12,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 22:01:12,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 22:01:12,470 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-05 22:01:12,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 22:01:12,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 22:01:12,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 22:01:12,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 22:01:12,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 22:01:12,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/neural-networks/softmax_7_unsafe.c-amalgamation.i [2024-11-05 22:01:13,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 22:01:14,244 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 22:01:14,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/softmax_7_unsafe.c-amalgamation.i [2024-11-05 22:01:14,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/414f78247/ff7b4c09ee0540368828437ed7570c33/FLAG44a516753 [2024-11-05 22:01:14,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/414f78247/ff7b4c09ee0540368828437ed7570c33 [2024-11-05 22:01:14,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 22:01:14,277 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 22:01:14,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 22:01:14,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 22:01:14,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 22:01:14,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:14,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf0da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14, skipping insertion in model container [2024-11-05 22:01:14,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:14,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 22:01:14,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/softmax_7_unsafe.c-amalgamation.i[63474,63487] [2024-11-05 22:01:14,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 22:01:14,728 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 22:01:14,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/softmax_7_unsafe.c-amalgamation.i[63474,63487] [2024-11-05 22:01:14,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 22:01:14,904 INFO L204 MainTranslator]: Completed translation [2024-11-05 22:01:14,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14 WrapperNode [2024-11-05 22:01:14,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 22:01:14,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 22:01:14,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 22:01:14,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 22:01:14,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:14,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:14,945 INFO L138 Inliner]: procedures = 562, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 110 [2024-11-05 22:01:14,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 22:01:14,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 22:01:14,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 22:01:14,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 22:01:14,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:14,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:14,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:14,992 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 7, 8, 4]. 38 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 2, 2]. [2024-11-05 22:01:14,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:14,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:14,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:15,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:15,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:15,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:15,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 22:01:15,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 22:01:15,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 22:01:15,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 22:01:15,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (1/1) ... [2024-11-05 22:01:15,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 22:01:15,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 22:01:15,042 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-05 22:01:15,044 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-05 22:01:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-05 22:01:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-05 22:01:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-05 22:01:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-05 22:01:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 22:01:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 22:01:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 22:01:15,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 22:01:15,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-05 22:01:15,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 22:01:15,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 22:01:15,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 22:01:15,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-05 22:01:15,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-05 22:01:15,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-05 22:01:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-05 22:01:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 22:01:15,157 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 22:01:15,159 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 22:01:15,701 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-05 22:01:15,701 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 22:01:15,713 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 22:01:15,713 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-05 22:01:15,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 10:01:15 BoogieIcfgContainer [2024-11-05 22:01:15,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 22:01:15,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 22:01:15,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 22:01:15,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 22:01:15,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 10:01:14" (1/3) ... [2024-11-05 22:01:15,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bd1542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 10:01:15, skipping insertion in model container [2024-11-05 22:01:15,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:01:14" (2/3) ... [2024-11-05 22:01:15,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bd1542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 10:01:15, skipping insertion in model container [2024-11-05 22:01:15,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 10:01:15" (3/3) ... [2024-11-05 22:01:15,726 INFO L112 eAbstractionObserver]: Analyzing ICFG softmax_7_unsafe.c-amalgamation.i [2024-11-05 22:01:15,737 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 22:01:15,737 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 22:01:15,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 22:01:15,793 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;@503e82aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 22:01:15,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 22:01:15,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 22:01:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-05 22:01:15,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:01:15,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:01:15,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:01:15,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:01:15,806 INFO L85 PathProgramCache]: Analyzing trace with hash -223873175, now seen corresponding path program 1 times [2024-11-05 22:01:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:01:15,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [783166647] [2024-11-05 22:01:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:01:15,814 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-05 22:01:15,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:01:15,817 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-05 22:01:15,819 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-05 22:01:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:01:15,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 22:01:15,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:01:15,926 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-05 22:01:15,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:01:15,930 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-05 22:01:15,930 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:01:15,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [783166647] [2024-11-05 22:01:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [783166647] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:01:15,931 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:01:15,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 22:01:15,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535438796] [2024-11-05 22:01:15,932 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:01:15,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 22:01:15,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:01:15,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 22:01:15,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 22:01:15,950 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 22:01:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:01:15,959 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2024-11-05 22:01:15,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 22:01:15,960 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-05 22:01:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:01:15,966 INFO L225 Difference]: With dead ends: 47 [2024-11-05 22:01:15,966 INFO L226 Difference]: Without dead ends: 21 [2024-11-05 22:01:15,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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-05 22:01:15,972 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:01:15,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:01:15,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-05 22:01:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-05 22:01:15,991 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-05 22:01:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-05 22:01:15,992 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2024-11-05 22:01:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:01:15,993 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-05 22:01:15,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 22:01:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-05 22:01:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-05 22:01:15,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:01:15,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:01:15,999 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-05 22:01:16,194 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-05 22:01:16,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:01:16,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:01:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1702451998, now seen corresponding path program 1 times [2024-11-05 22:01:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:01:16,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820160537] [2024-11-05 22:01:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:01:16,196 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-05 22:01:16,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:01:16,200 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-05 22:01:16,203 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-05 22:01:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:01:16,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 22:01:16,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:01:16,320 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-05 22:01:16,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:01:16,333 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-05 22:01:16,333 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:01:16,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820160537] [2024-11-05 22:01:16,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1820160537] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:01:16,334 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:01:16,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 22:01:16,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021071771] [2024-11-05 22:01:16,334 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:01:16,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 22:01:16,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:01:16,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 22:01:16,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 22:01:16,336 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 22:01:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:01:16,557 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-05 22:01:16,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 22:01:16,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-05 22:01:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:01:16,558 INFO L225 Difference]: With dead ends: 36 [2024-11-05 22:01:16,558 INFO L226 Difference]: Without dead ends: 24 [2024-11-05 22:01:16,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-05 22:01:16,559 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 22:01:16,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 31 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 22:01:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-05 22:01:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-05 22:01:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 22:01:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-05 22:01:16,563 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2024-11-05 22:01:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:01:16,563 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-05 22:01:16,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 22:01:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-05 22:01:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-05 22:01:16,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:01:16,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:01:16,568 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-05 22:01:16,767 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-05 22:01:16,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:01:16,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:01:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash -939866796, now seen corresponding path program 1 times [2024-11-05 22:01:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:01:16,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [655943721] [2024-11-05 22:01:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:01:16,771 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-05 22:01:16,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:01:16,773 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-05 22:01:16,774 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-05 22:01:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:01:16,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 22:01:16,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:01:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-05 22:01:16,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:01:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-05 22:01:16,917 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:01:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [655943721] [2024-11-05 22:01:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [655943721] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:01:16,917 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:01:16,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 22:01:16,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142880704] [2024-11-05 22:01:16,918 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:01:16,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 22:01:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:01:16,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 22:01:16,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 22:01:16,919 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-05 22:01:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:01:18,176 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-11-05 22:01:18,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 22:01:18,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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) Word has length 18 [2024-11-05 22:01:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:01:18,177 INFO L225 Difference]: With dead ends: 37 [2024-11-05 22:01:18,177 INFO L226 Difference]: Without dead ends: 28 [2024-11-05 22:01:18,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-05 22:01:18,178 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-05 22:01:18,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 36 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-05 22:01:18,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-05 22:01:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-05 22:01:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 22:01:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-05 22:01:18,189 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2024-11-05 22:01:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:01:18,189 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-05 22:01:18,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-05 22:01:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-05 22:01:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 22:01:18,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:01:18,190 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:01:18,194 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-05 22:01:18,394 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-05 22:01:18,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:01:18,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:01:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash -709993652, now seen corresponding path program 1 times [2024-11-05 22:01:18,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:01:18,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370111812] [2024-11-05 22:01:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:01:18,395 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-05 22:01:18,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:01:18,398 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-05 22:01:18,399 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-05 22:01:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:01:18,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 22:01:18,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:01:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-05 22:01:18,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:01:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-05 22:01:18,846 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:01:18,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370111812] [2024-11-05 22:01:18,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1370111812] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:01:18,847 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:01:18,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 22:01:18,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117949108] [2024-11-05 22:01:18,847 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:01:18,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 22:01:18,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:01:18,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 22:01:18,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 22:01:18,848 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-05 22:01:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:01:18,939 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-05 22:01:18,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 22:01:18,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-05 22:01:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:01:18,942 INFO L225 Difference]: With dead ends: 34 [2024-11-05 22:01:18,942 INFO L226 Difference]: Without dead ends: 31 [2024-11-05 22:01:18,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 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-05 22:01:18,944 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 22:01:18,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 22:01:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-05 22:01:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-05 22:01:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 22:01:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-05 22:01:18,949 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 26 [2024-11-05 22:01:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:01:18,949 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-05 22:01:18,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-05 22:01:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-05 22:01:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-05 22:01:18,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:01:18,950 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:01:18,961 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-05 22:01:19,150 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-05 22:01:19,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:01:19,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:01:19,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1268080504, now seen corresponding path program 1 times [2024-11-05 22:01:19,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:01:19,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [18648105] [2024-11-05 22:01:19,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:01:19,152 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-05 22:01:19,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:01:19,153 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-05 22:01:19,157 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-05 22:01:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 22:01:19,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 22:01:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 22:01:20,121 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-05 22:01:20,121 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-05 22:01:20,122 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 22:01:20,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-05 22:01:20,327 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-05 22:01:20,330 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-05 22:01:20,380 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 22:01:20,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 10:01:20 BoogieIcfgContainer [2024-11-05 22:01:20,384 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 22:01:20,384 INFO L158 Benchmark]: Toolchain (without parser) took 6107.48ms. Allocated memory was 209.7MB in the beginning and 357.6MB in the end (delta: 147.8MB). Free memory was 156.5MB in the beginning and 183.4MB in the end (delta: -26.9MB). Peak memory consumption was 121.3MB. Max. memory is 8.0GB. [2024-11-05 22:01:20,386 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 209.7MB. Free memory is still 156.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 22:01:20,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.76ms. Allocated memory was 209.7MB in the beginning and 357.6MB in the end (delta: 147.8MB). Free memory was 156.5MB in the beginning and 291.4MB in the end (delta: -134.9MB). Peak memory consumption was 41.6MB. Max. memory is 8.0GB. [2024-11-05 22:01:20,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.34ms. Allocated memory is still 357.6MB. Free memory was 291.4MB in the beginning and 288.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 22:01:20,388 INFO L158 Benchmark]: Boogie Preprocessor took 60.76ms. Allocated memory is still 357.6MB. Free memory was 288.3MB in the beginning and 285.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 22:01:20,388 INFO L158 Benchmark]: RCFGBuilder took 709.61ms. Allocated memory is still 357.6MB. Free memory was 285.2MB in the beginning and 267.8MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-05 22:01:20,389 INFO L158 Benchmark]: TraceAbstraction took 4664.78ms. Allocated memory is still 357.6MB. Free memory was 267.3MB in the beginning and 183.4MB in the end (delta: 83.9MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. [2024-11-05 22:01:20,390 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.94ms. Allocated memory is still 209.7MB. Free memory is still 156.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 627.76ms. Allocated memory was 209.7MB in the beginning and 357.6MB in the end (delta: 147.8MB). Free memory was 156.5MB in the beginning and 291.4MB in the end (delta: -134.9MB). Peak memory consumption was 41.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.34ms. Allocated memory is still 357.6MB. Free memory was 291.4MB in the beginning and 288.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.76ms. Allocated memory is still 357.6MB. Free memory was 288.3MB in the beginning and 285.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 709.61ms. Allocated memory is still 357.6MB. Free memory was 285.2MB in the beginning and 267.8MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4664.78ms. Allocated memory is still 357.6MB. Free memory was 267.3MB in the beginning and 183.4MB in the end (delta: 83.9MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 873]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of expf at line 854, overapproximation of __builtin_isinf_sign at line 867. Possible FailurePath: [L863] float x[2], y[2]; [L864] x[0] = __VERIFIER_nondet_float() [L865] x[1] = __VERIFIER_nondet_float() [L866] EXPR x[0] [L866] COND FALSE !(!(!__builtin_isnan (x[0]) && !__builtin_isinf_sign (x[0]))) [L867] EXPR x[1] [L867] COND FALSE !(!(!__builtin_isnan (x[1]) && !__builtin_isinf_sign (x[1]))) [L868] CALL softmax(x, y, 2) [L847] int i; [L848] EXPR x[0] [L848] float max = x[0]; [L849] i = 1 VAL [i=1, max=-2.0, n=2, x={-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.0, n=2, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=2, max=0.0, n=2, x={-2147483648:0}, y={3:0}] [L849] COND FALSE !(i < n) VAL [max=0.0, n=2, x={-2147483648:0}, y={3:0}] [L852] float sum = 0.0f; [L853] i = 0 VAL [i=0, max=0.0, n=2, 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.0, n=2, 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=2, max=0.0, n=2, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND FALSE !(i < n) VAL [max=0.0, n=2, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] i = 0 VAL [i=0, max=0.0, n=2, sum=0.0, 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.0, n=2, sum=0.0, 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.0, n=2, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND FALSE !(i < n) VAL [max=0.0, sum=0.0, x={-2147483648:0}, y={3:0}] [L868] RET softmax(x, y, 2) [L869] int i; [L870] float sum = 0.0f; [L871] i = 0 VAL [i=0, sum=0.0, y={3:0}] [L871] COND TRUE i < 2 [L872] EXPR y[i] [L872] sum += y[i] VAL [i=0, sum=NaN, y={3:0}] [L871] ++i VAL [i=1, sum=NaN, y={3:0}] [L871] COND TRUE i < 2 [L872] EXPR y[i] [L872] sum += y[i] VAL [i=1, sum=NaN, y={3:0}] [L871] ++i VAL [i=2, sum=NaN, y={3:0}] [L871] COND FALSE !(i < 2) VAL [sum=NaN, y={3:0}] [L873] COND TRUE !(sum == 1.0f) VAL [y={3:0}] [L873] reach_error() VAL [y={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 139 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 87 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 314 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 20/20 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-05 22:01:20,418 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...