/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/neural-networks/elu_2_safe.c-amalgamation.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 01:11:43,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 01:11:43,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 01:11:43,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 01:11:43,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 01:11:43,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 01:11:43,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 01:11:43,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 01:11:43,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 01:11:43,343 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 01:11:43,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 01:11:43,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 01:11:43,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 01:11:43,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 01:11:43,347 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 01:11:43,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 01:11:43,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 01:11:43,347 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 01:11:43,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 01:11:43,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 01:11:43,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 01:11:43,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 01:11:43,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 01:11:43,351 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 01:11:43,352 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 01:11:43,352 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 01:11:43,352 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 01:11:43,352 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 01:11:43,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 01:11:43,352 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 01:11:43,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 01:11:43,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 01:11:43,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 01:11:43,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 01:11:43,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 01:11:43,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 01:11:43,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 01:11:43,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 01:11:43,354 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 01:11:43,354 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 01:11:43,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 01:11:43,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 01:11:43,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 01:11:43,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 01:11:43,356 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 01:11:43,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 01:11:43,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 01:11:43,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 01:11:43,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 01:11:43,608 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 01:11:43,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/neural-networks/elu_2_safe.c-amalgamation.i [2024-11-06 01:11:44,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 01:11:45,243 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 01:11:45,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/elu_2_safe.c-amalgamation.i [2024-11-06 01:11:45,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b0ab468/62df8871b912428fb1f70ed56ea8e160/FLAG22dcff354 [2024-11-06 01:11:45,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b0ab468/62df8871b912428fb1f70ed56ea8e160 [2024-11-06 01:11:45,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 01:11:45,280 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 01:11:45,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 01:11:45,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 01:11:45,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 01:11:45,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:45,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0f5bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45, skipping insertion in model container [2024-11-06 01:11:45,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:45,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 01:11:45,790 WARN L1674 CHandler]: Possible shadowing of function y1 [2024-11-06 01:11:45,791 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/elu_2_safe.c-amalgamation.i[63118,63131] [2024-11-06 01:11:45,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 01:11:45,805 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 01:11:45,841 WARN L1674 CHandler]: Possible shadowing of function y1 [2024-11-06 01:11:45,842 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/elu_2_safe.c-amalgamation.i[63118,63131] [2024-11-06 01:11:45,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 01:11:45,990 INFO L204 MainTranslator]: Completed translation [2024-11-06 01:11:45,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45 WrapperNode [2024-11-06 01:11:45,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 01:11:45,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 01:11:45,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 01:11:45,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 01:11:45,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:46,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:46,038 INFO L138 Inliner]: procedures = 559, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2024-11-06 01:11:46,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 01:11:46,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 01:11:46,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 01:11:46,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 01:11:46,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:46,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:46,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:46,057 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-06 01:11:46,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:46,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:46,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:46,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:46,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:46,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:46,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 01:11:46,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 01:11:46,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 01:11:46,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 01:11:46,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (1/1) ... [2024-11-06 01:11:46,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 01:11:46,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 01:11:46,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 01:11:46,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 01:11:46,132 INFO L130 BoogieDeclarations]: Found specification of procedure elu [2024-11-06 01:11:46,132 INFO L138 BoogieDeclarations]: Found implementation of procedure elu [2024-11-06 01:11:46,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 01:11:46,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 01:11:46,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 01:11:46,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 01:11:46,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 01:11:46,222 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 01:11:46,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 01:11:46,430 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-06 01:11:46,431 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 01:11:46,441 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 01:11:46,441 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-06 01:11:46,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:11:46 BoogieIcfgContainer [2024-11-06 01:11:46,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 01:11:46,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 01:11:46,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 01:11:46,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 01:11:46,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 01:11:45" (1/3) ... [2024-11-06 01:11:46,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8d0aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:11:46, skipping insertion in model container [2024-11-06 01:11:46,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:11:45" (2/3) ... [2024-11-06 01:11:46,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8d0aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:11:46, skipping insertion in model container [2024-11-06 01:11:46,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:11:46" (3/3) ... [2024-11-06 01:11:46,450 INFO L112 eAbstractionObserver]: Analyzing ICFG elu_2_safe.c-amalgamation.i [2024-11-06 01:11:46,463 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 01:11:46,464 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 01:11:46,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 01:11:46,511 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;@34ddf734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 01:11:46,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 01:11:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 01:11:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 01:11:46,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:11:46,523 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:11:46,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:11:46,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:11:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1270606093, now seen corresponding path program 1 times [2024-11-06 01:11:46,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:11:46,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743198125] [2024-11-06 01:11:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:11:46,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:11:46,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:11:46,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:11:46,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 01:11:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:11:46,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 01:11:46,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:11:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 01:11:46,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:11:46,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:11:46,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743198125] [2024-11-06 01:11:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743198125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:11:46,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:11:46,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 01:11:46,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324281281] [2024-11-06 01:11:46,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:11:46,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 01:11:46,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:11:46,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 01:11:46,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 01:11:46,707 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 01:11:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:11:46,724 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-11-06 01:11:46,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 01:11:46,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-06 01:11:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:11:46,731 INFO L225 Difference]: With dead ends: 33 [2024-11-06 01:11:46,732 INFO L226 Difference]: Without dead ends: 14 [2024-11-06 01:11:46,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 01:11:46,739 INFO L432 NwaCegarLoop]: 19 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, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:11:46,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:11:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-06 01:11:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-06 01:11:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 01:11:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-06 01:11:46,774 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 17 [2024-11-06 01:11:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:11:46,775 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-06 01:11:46,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 01:11:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-06 01:11:46,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 01:11:46,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:11:46,778 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:11:46,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-06 01:11:46,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:11:46,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:11:46,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:11:46,983 INFO L85 PathProgramCache]: Analyzing trace with hash -9257585, now seen corresponding path program 1 times [2024-11-06 01:11:46,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:11:46,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953874634] [2024-11-06 01:11:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:11:46,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:11:46,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:11:46,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:11:46,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 01:11:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:11:47,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 01:11:47,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:11:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 01:11:49,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:11:49,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:11:49,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953874634] [2024-11-06 01:11:49,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953874634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:11:49,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:11:49,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-06 01:11:49,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643991333] [2024-11-06 01:11:49,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:11:49,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 01:11:49,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:11:49,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 01:11:49,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-06 01:11:49,954 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 01:12:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:12:01,456 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-06 01:12:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 01:12:01,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-06 01:12:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:12:01,464 INFO L225 Difference]: With dead ends: 24 [2024-11-06 01:12:01,464 INFO L226 Difference]: Without dead ends: 20 [2024-11-06 01:12:01,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-06 01:12:01,466 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 01:12:01,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 50 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 01:12:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-06 01:12:01,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-06 01:12:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 01:12:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-06 01:12:01,475 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 17 [2024-11-06 01:12:01,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:12:01,475 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-06 01:12:01,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 01:12:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-06 01:12:01,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 01:12:01,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:12:01,477 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:12:01,482 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-06 01:12:01,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:12:01,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:12:01,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:12:01,679 INFO L85 PathProgramCache]: Analyzing trace with hash 19371566, now seen corresponding path program 1 times [2024-11-06 01:12:01,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:12:01,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128332379] [2024-11-06 01:12:01,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:12:01,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:12:01,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:12:01,682 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:12:01,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 01:12:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:12:01,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 01:12:01,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:12:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-06 01:12:03,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:12:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 01:12:03,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:12:03,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128332379] [2024-11-06 01:12:03,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128332379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:12:03,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:12:03,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-06 01:12:03,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957572233] [2024-11-06 01:12:03,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:12:03,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 01:12:03,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:12:03,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 01:12:03,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-06 01:12:03,689 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 01:12:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:12:08,164 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-11-06 01:12:08,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 01:12:08,167 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2024-11-06 01:12:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:12:08,168 INFO L225 Difference]: With dead ends: 30 [2024-11-06 01:12:08,168 INFO L226 Difference]: Without dead ends: 20 [2024-11-06 01:12:08,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-06 01:12:08,170 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 01:12:08,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 54 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 01:12:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-06 01:12:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2024-11-06 01:12:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 01:12:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-06 01:12:08,177 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 17 [2024-11-06 01:12:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:12:08,178 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-06 01:12:08,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 01:12:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-06 01:12:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 01:12:08,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:12:08,180 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:12:08,185 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 (4)] Forceful destruction successful, exit code 0 [2024-11-06 01:12:08,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:12:08,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:12:08,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:12:08,382 INFO L85 PathProgramCache]: Analyzing trace with hash 119825134, now seen corresponding path program 2 times [2024-11-06 01:12:08,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:12:08,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136428212] [2024-11-06 01:12:08,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 01:12:08,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:12:08,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:12:08,386 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 01:12:08,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-06 01:12:08,443 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 01:12:08,444 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 01:12:08,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 01:12:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 01:12:08,490 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-06 01:12:08,491 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 01:12:08,492 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 01:12:08,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-06 01:12:08,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 01:12:08,699 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-06 01:12:08,729 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 01:12:08,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 01:12:08 BoogieIcfgContainer [2024-11-06 01:12:08,733 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 01:12:08,734 INFO L158 Benchmark]: Toolchain (without parser) took 23454.40ms. Allocated memory was 197.1MB in the beginning and 313.5MB in the end (delta: 116.4MB). Free memory was 149.1MB in the beginning and 163.8MB in the end (delta: -14.8MB). Peak memory consumption was 102.3MB. Max. memory is 8.0GB. [2024-11-06 01:12:08,734 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 01:12:08,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 709.17ms. Allocated memory was 197.1MB in the beginning and 313.5MB in the end (delta: 116.4MB). Free memory was 148.7MB in the beginning and 260.7MB in the end (delta: -112.0MB). Peak memory consumption was 54.1MB. Max. memory is 8.0GB. [2024-11-06 01:12:08,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.47ms. Allocated memory is still 313.5MB. Free memory was 260.7MB in the beginning and 257.7MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-06 01:12:08,737 INFO L158 Benchmark]: Boogie Preprocessor took 29.84ms. Allocated memory is still 313.5MB. Free memory was 257.7MB in the beginning and 255.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-06 01:12:08,738 INFO L158 Benchmark]: RCFGBuilder took 371.83ms. Allocated memory is still 313.5MB. Free memory was 255.6MB in the beginning and 244.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-11-06 01:12:08,739 INFO L158 Benchmark]: TraceAbstraction took 22289.71ms. Allocated memory is still 313.5MB. Free memory was 243.5MB in the beginning and 163.8MB in the end (delta: 79.7MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. [2024-11-06 01:12:08,740 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 197.1MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 709.17ms. Allocated memory was 197.1MB in the beginning and 313.5MB in the end (delta: 116.4MB). Free memory was 148.7MB in the beginning and 260.7MB in the end (delta: -112.0MB). Peak memory consumption was 54.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.47ms. Allocated memory is still 313.5MB. Free memory was 260.7MB in the beginning and 257.7MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.84ms. Allocated memory is still 313.5MB. Free memory was 257.7MB in the beginning and 255.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 371.83ms. Allocated memory is still 313.5MB. Free memory was 255.6MB in the beginning and 244.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 22289.71ms. Allocated memory is still 313.5MB. Free memory was 243.5MB in the beginning and 163.8MB in the end (delta: 79.7MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 859]: 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 expm1f at line 850. Possible FailurePath: [L854] float x1 = __VERIFIER_nondet_float(); [L855] float x2 = x1 + 1e-5f; VAL [x1=-0.00000000000000000010842021724855044, x2=0.000009999999747378752] [L856] COND FALSE !(!(!__builtin_isnan (x1))) VAL [x1=-0.00000000000000000010842021724855044, x2=0.000009999999747378752] [L857] CALL, EXPR elu(x1) VAL [\old(x)=-0.00000000000000000010842021724855044] [L847] COND FALSE !(x >= 0.0f) [L850] return expm1f(x); [L857] RET, EXPR elu(x1) VAL [x1=-0.00000000000000000010842021724855044, x2=0.000009999999747378752] [L857] float y1 = elu(x1); [L858] CALL, EXPR elu(x2) VAL [\old(x)=0.000009999999747378752] [L847] COND TRUE x >= 0.0f [L848] return x; VAL [\old(x)=0.000009999999747378752, \result=0.000009999999747378752] [L858] RET, EXPR elu(x2) VAL [x1=-0.00000000000000000010842021724855044, x2=0.000009999999747378752, y1=2.0] [L858] float y2 = elu(x2); [L859] COND TRUE !(__builtin_islessequal(y1, y2)) VAL [x1=-0.00000000000000000010842021724855044, x2=0.000009999999747378752] [L859] reach_error() VAL [x1=-0.00000000000000000010842021724855044, x2=0.000009999999747378752] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 144 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 37 mSDtfsCounter, 144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 64 ConstructedInterpolants, 2 QuantifiedInterpolants, 248 SizeOfPredicates, 6 NumberOfNonLiveVariables, 120 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 11/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-06 01:12:08,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...