/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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 00:11:25,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 00:11:25,659 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 00:11:25,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 00:11:25,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 00:11:25,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 00:11:25,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 00:11:25,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 00:11:25,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 00:11:25,694 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 00:11:25,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 00:11:25,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 00:11:25,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 00:11:25,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 00:11:25,695 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 00:11:25,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 00:11:25,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 00:11:25,701 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 00:11:25,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 00:11:25,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 00:11:25,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 00:11:25,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 00:11:25,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 00:11:25,703 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 00:11:25,703 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 00:11:25,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 00:11:25,704 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 00:11:25,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 00:11:25,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 00:11:25,704 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 00:11:25,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 00:11:25,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 00:11:25,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 00:11:25,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 00:11:25,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 00:11:25,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 00:11:25,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 00:11:25,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 00:11:25,707 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 00:11:25,707 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 00:11:25,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 00:11:25,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 00:11:25,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 00:11:25,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 00:11:25,709 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 00:11:25,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 00:11:25,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 00:11:25,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 00:11:25,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 00:11:25,994 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 00:11:25,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2024-11-06 00:11:27,753 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 00:11:27,959 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 00:11:27,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2024-11-06 00:11:27,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dfe83a06/bed9572b1f00486fa0bb80006adf2342/FLAGcd9d4b4ec [2024-11-06 00:11:27,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dfe83a06/bed9572b1f00486fa0bb80006adf2342 [2024-11-06 00:11:27,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 00:11:27,992 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 00:11:27,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 00:11:27,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 00:11:28,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 00:11:28,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:11:27" (1/1) ... [2024-11-06 00:11:28,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ec00b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28, skipping insertion in model container [2024-11-06 00:11:28,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:11:27" (1/1) ... [2024-11-06 00:11:28,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 00:11:28,198 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2024-11-06 00:11:28,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 00:11:28,228 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 00:11:28,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2024-11-06 00:11:28,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 00:11:28,263 INFO L204 MainTranslator]: Completed translation [2024-11-06 00:11:28,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28 WrapperNode [2024-11-06 00:11:28,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 00:11:28,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 00:11:28,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 00:11:28,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 00:11:28,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (1/1) ... [2024-11-06 00:11:28,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (1/1) ... [2024-11-06 00:11:28,296 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2024-11-06 00:11:28,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 00:11:28,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 00:11:28,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 00:11:28,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 00:11:28,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (1/1) ... [2024-11-06 00:11:28,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (1/1) ... [2024-11-06 00:11:28,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (1/1) ... [2024-11-06 00:11:28,322 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-06 00:11:28,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (1/1) ... [2024-11-06 00:11:28,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (1/1) ... [2024-11-06 00:11:28,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (1/1) ... [2024-11-06 00:11:28,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (1/1) ... [2024-11-06 00:11:28,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (1/1) ... [2024-11-06 00:11:28,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (1/1) ... [2024-11-06 00:11:28,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 00:11:28,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 00:11:28,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 00:11:28,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 00:11:28,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (1/1) ... [2024-11-06 00:11:28,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 00:11:28,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 00:11:28,378 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 00:11:28,383 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 00:11:28,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 00:11:28,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-06 00:11:28,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-06 00:11:28,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 00:11:28,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 00:11:28,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 00:11:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 00:11:28,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 00:11:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-06 00:11:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-06 00:11:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 00:11:28,493 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 00:11:28,495 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 00:11:28,630 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-06 00:11:28,630 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 00:11:28,648 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 00:11:28,648 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 00:11:28,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:11:28 BoogieIcfgContainer [2024-11-06 00:11:28,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 00:11:28,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 00:11:28,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 00:11:28,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 00:11:28,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:11:27" (1/3) ... [2024-11-06 00:11:28,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11eba5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:11:28, skipping insertion in model container [2024-11-06 00:11:28,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:11:28" (2/3) ... [2024-11-06 00:11:28,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11eba5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:11:28, skipping insertion in model container [2024-11-06 00:11:28,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:11:28" (3/3) ... [2024-11-06 00:11:28,661 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2024-11-06 00:11:28,678 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 00:11:28,678 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 00:11:28,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 00:11:28,805 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;@7f77777e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 00:11:28,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 00:11:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-06 00:11:28,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:11:28,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:11:28,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:11:28,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:11:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash 212076531, now seen corresponding path program 1 times [2024-11-06 00:11:28,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:11:28,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714576612] [2024-11-06 00:11:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:11:28,843 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 00:11:28,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:11:28,848 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 00:11:28,849 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 00:11:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:11:28,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 00:11:28,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:11:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 00:11:28,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 00:11:28,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:11:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714576612] [2024-11-06 00:11:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714576612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 00:11:28,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 00:11:28,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 00:11:28,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408425295] [2024-11-06 00:11:28,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 00:11:29,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 00:11:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:11:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 00:11:29,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 00:11:29,024 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:11:29,058 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2024-11-06 00:11:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 00:11:29,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-06 00:11:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:11:29,067 INFO L225 Difference]: With dead ends: 28 [2024-11-06 00:11:29,067 INFO L226 Difference]: Without dead ends: 14 [2024-11-06 00:11:29,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 00:11:29,073 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 00:11:29,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 00:11:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-06 00:11:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2024-11-06 00:11:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-06 00:11:29,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2024-11-06 00:11:29,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:11:29,100 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-06 00:11:29,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-11-06 00:11:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-06 00:11:29,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:11:29,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:11:29,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-06 00:11:29,303 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 00:11:29,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:11:29,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:11:29,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1435974389, now seen corresponding path program 1 times [2024-11-06 00:11:29,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:11:29,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914745896] [2024-11-06 00:11:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:11:29,306 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 00:11:29,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:11:29,313 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 00:11:29,315 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 00:11:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:11:29,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 00:11:29,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:11:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 00:11:29,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:11:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 00:11:29,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:11:29,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914745896] [2024-11-06 00:11:29,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914745896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 00:11:29,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 00:11:29,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 00:11:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441662743] [2024-11-06 00:11:29,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 00:11:29,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 00:11:29,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:11:29,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 00:11:29,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 00:11:29,431 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:29,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:11:29,516 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2024-11-06 00:11:29,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 00:11:29,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-06 00:11:29,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:11:29,519 INFO L225 Difference]: With dead ends: 27 [2024-11-06 00:11:29,519 INFO L226 Difference]: Without dead ends: 21 [2024-11-06 00:11:29,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 00:11:29,521 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 00:11:29,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 00:11:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-06 00:11:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2024-11-06 00:11:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-06 00:11:29,529 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2024-11-06 00:11:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:11:29,530 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-06 00:11:29,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-11-06 00:11:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 00:11:29,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:11:29,531 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:11:29,536 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 00:11:29,735 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 00:11:29,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:11:29,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:11:29,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1662320891, now seen corresponding path program 2 times [2024-11-06 00:11:29,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:11:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295986977] [2024-11-06 00:11:29,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 00:11:29,738 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 00:11:29,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:11:29,741 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 00:11:29,742 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 00:11:29,785 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 00:11:29,786 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 00:11:29,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 00:11:29,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:11:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 00:11:29,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 00:11:29,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:11:29,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295986977] [2024-11-06 00:11:29,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295986977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 00:11:29,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 00:11:29,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 00:11:29,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656206878] [2024-11-06 00:11:29,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 00:11:29,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 00:11:29,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:11:29,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 00:11:29,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 00:11:29,820 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:11:29,850 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-06 00:11:29,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 00:11:29,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 16 [2024-11-06 00:11:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:11:29,851 INFO L225 Difference]: With dead ends: 22 [2024-11-06 00:11:29,851 INFO L226 Difference]: Without dead ends: 18 [2024-11-06 00:11:29,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 00:11:29,852 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 00:11:29,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 00:11:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-06 00:11:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-06 00:11:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-06 00:11:29,865 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2024-11-06 00:11:29,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:11:29,866 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-06 00:11:29,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-06 00:11:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 00:11:29,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:11:29,867 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:11:29,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-06 00:11:30,067 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 00:11:30,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:11:30,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:11:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash -5994546, now seen corresponding path program 1 times [2024-11-06 00:11:30,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:11:30,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308063628] [2024-11-06 00:11:30,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 00:11:30,069 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 00:11:30,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:11:30,076 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 00:11:30,078 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 00:11:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 00:11:30,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 00:11:30,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:11:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 00:11:30,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:11:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 00:11:30,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:11:30,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308063628] [2024-11-06 00:11:30,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308063628] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 00:11:30,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 00:11:30,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 00:11:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545314728] [2024-11-06 00:11:30,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 00:11:30,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 00:11:30,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:11:30,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 00:11:30,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-06 00:11:30,336 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:11:30,581 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-11-06 00:11:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 00:11:30,584 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-06 00:11:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:11:30,585 INFO L225 Difference]: With dead ends: 39 [2024-11-06 00:11:30,585 INFO L226 Difference]: Without dead ends: 32 [2024-11-06 00:11:30,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2024-11-06 00:11:30,586 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 00:11:30,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 31 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 00:11:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-06 00:11:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-06 00:11:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-06 00:11:30,599 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 17 [2024-11-06 00:11:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:11:30,599 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-06 00:11:30,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-06 00:11:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-06 00:11:30,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:11:30,601 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:11:30,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-06 00:11:30,801 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 00:11:30,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:11:30,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:11:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash 776585922, now seen corresponding path program 2 times [2024-11-06 00:11:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:11:30,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083836094] [2024-11-06 00:11:30,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 00:11:30,803 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 00:11:30,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:11:30,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 00:11:30,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 00:11:30,877 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 00:11:30,878 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 00:11:30,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 00:11:30,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:11:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 00:11:31,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:11:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 00:11:31,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:11:31,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083836094] [2024-11-06 00:11:31,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083836094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 00:11:31,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 00:11:31,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-06 00:11:31,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536309044] [2024-11-06 00:11:31,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 00:11:31,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-06 00:11:31,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:11:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-06 00:11:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2024-11-06 00:11:31,322 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:11:31,629 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-06 00:11:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 00:11:31,630 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-06 00:11:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:11:31,630 INFO L225 Difference]: With dead ends: 42 [2024-11-06 00:11:31,630 INFO L226 Difference]: Without dead ends: 35 [2024-11-06 00:11:31,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-06 00:11:31,632 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 00:11:31,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 00:11:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-06 00:11:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-06 00:11:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-06 00:11:31,637 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2024-11-06 00:11:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:11:31,638 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-06 00:11:31,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-06 00:11:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 00:11:31,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:11:31,639 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:11:31,645 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-06 00:11:31,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 00:11:31,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:11:31,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:11:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1133517568, now seen corresponding path program 3 times [2024-11-06 00:11:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:11:31,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383464906] [2024-11-06 00:11:31,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 00:11:31,844 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 00:11:31,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:11:31,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 00:11:31,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 00:11:31,908 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-06 00:11:31,908 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 00:11:31,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 00:11:31,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:11:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-06 00:11:31,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:11:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-06 00:11:32,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:11:32,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383464906] [2024-11-06 00:11:32,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383464906] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 00:11:32,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 00:11:32,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-06 00:11:32,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591510690] [2024-11-06 00:11:32,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 00:11:32,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 00:11:32,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:11:32,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 00:11:32,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-06 00:11:32,063 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:11:32,220 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-11-06 00:11:32,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 00:11:32,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-06 00:11:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:11:32,222 INFO L225 Difference]: With dead ends: 41 [2024-11-06 00:11:32,222 INFO L226 Difference]: Without dead ends: 35 [2024-11-06 00:11:32,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-06 00:11:32,223 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 00:11:32,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 00:11:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-06 00:11:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-06 00:11:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 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-06 00:11:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-06 00:11:32,231 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2024-11-06 00:11:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:11:32,231 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-06 00:11:32,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-06 00:11:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-06 00:11:32,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:11:32,232 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:11:32,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-06 00:11:32,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 00:11:32,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:11:32,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:11:32,435 INFO L85 PathProgramCache]: Analyzing trace with hash 64740169, now seen corresponding path program 4 times [2024-11-06 00:11:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:11:32,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296842911] [2024-11-06 00:11:32,436 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-06 00:11:32,436 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 00:11:32,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:11:32,438 INFO L229 MonitoredProcess]: Starting monitored process 8 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 00:11:32,439 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 (8)] Waiting until timeout for monitored process [2024-11-06 00:11:32,518 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-06 00:11:32,518 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 00:11:32,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-06 00:11:32,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 00:11:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-06 00:11:37,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 00:11:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-06 00:11:39,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 00:11:39,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296842911] [2024-11-06 00:11:39,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296842911] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 00:11:39,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 00:11:39,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-06 00:11:39,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781850442] [2024-11-06 00:11:39,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 00:11:39,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 00:11:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 00:11:39,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 00:11:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=121, Unknown=1, NotChecked=0, Total=182 [2024-11-06 00:11:39,614 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:41,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 00:11:44,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 00:11:46,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 00:11:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 00:11:58,654 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-06 00:11:58,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 00:11:58,655 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-06 00:11:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 00:11:58,656 INFO L225 Difference]: With dead ends: 50 [2024-11-06 00:11:58,656 INFO L226 Difference]: Without dead ends: 41 [2024-11-06 00:11:58,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=124, Invalid=217, Unknown=1, NotChecked=0, Total=342 [2024-11-06 00:11:58,657 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-06 00:11:58,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 37 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-06 00:11:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-06 00:11:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-06 00:11:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-06 00:11:58,675 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2024-11-06 00:11:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 00:11:58,675 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-06 00:11:58,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 00:11:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-06 00:11:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 00:11:58,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 00:11:58,676 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 00:11:58,690 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 (8)] Ended with exit code 0 [2024-11-06 00:11:58,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 00:11:58,878 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 00:11:58,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 00:11:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1907904535, now seen corresponding path program 5 times [2024-11-06 00:11:58,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 00:11:58,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943999139] [2024-11-06 00:11:58,879 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-06 00:11:58,880 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 00:11:58,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 00:11:58,883 INFO L229 MonitoredProcess]: Starting monitored process 9 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 00:11:58,885 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 (9)] Waiting until timeout for monitored process [2024-11-06 00:11:59,175 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-11-06 00:11:59,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 00:11:59,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 00:11:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 00:11:59,401 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-06 00:11:59,402 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 00:11:59,403 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 00:11:59,414 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 (9)] Ended with exit code 0 [2024-11-06 00:11:59,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 00:11:59,611 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1] [2024-11-06 00:11:59,640 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 00:11:59,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:11:59 BoogieIcfgContainer [2024-11-06 00:11:59,643 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 00:11:59,646 INFO L158 Benchmark]: Toolchain (without parser) took 31651.34ms. Allocated memory is still 393.2MB. Free memory was 340.1MB in the beginning and 277.5MB in the end (delta: 62.6MB). Peak memory consumption was 64.2MB. Max. memory is 8.0GB. [2024-11-06 00:11:59,646 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 220.2MB. Free memory is still 170.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 00:11:59,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.04ms. Allocated memory is still 393.2MB. Free memory was 340.1MB in the beginning and 327.2MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-06 00:11:59,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.45ms. Allocated memory is still 393.2MB. Free memory was 327.2MB in the beginning and 325.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-06 00:11:59,647 INFO L158 Benchmark]: Boogie Preprocessor took 45.36ms. Allocated memory is still 393.2MB. Free memory was 325.7MB in the beginning and 323.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-06 00:11:59,647 INFO L158 Benchmark]: RCFGBuilder took 305.22ms. Allocated memory is still 393.2MB. Free memory was 323.6MB in the beginning and 311.8MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-11-06 00:11:59,647 INFO L158 Benchmark]: TraceAbstraction took 30990.97ms. Allocated memory is still 393.2MB. Free memory was 311.1MB in the beginning and 277.5MB in the end (delta: 33.6MB). Peak memory consumption was 34.8MB. Max. memory is 8.0GB. [2024-11-06 00:11:59,648 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.34ms. Allocated memory is still 220.2MB. Free memory is still 170.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.04ms. Allocated memory is still 393.2MB. Free memory was 340.1MB in the beginning and 327.2MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.45ms. Allocated memory is still 393.2MB. Free memory was 327.2MB in the beginning and 325.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.36ms. Allocated memory is still 393.2MB. Free memory was 325.7MB in the beginning and 323.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 305.22ms. Allocated memory is still 393.2MB. Free memory was 323.6MB in the beginning and 311.8MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 30990.97ms. Allocated memory is still 393.2MB. Free memory was 311.1MB in the beginning and 277.5MB in the end (delta: 33.6MB). Peak memory consumption was 34.8MB. 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 - CounterExampleResult [Line: 9]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] char in[11]; [L17] char *s; [L18] unsigned char c; [L19] int i, j; [L20] int idx_in; [L21] i = 0 VAL [i=0, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=1, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=2, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=3, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=4, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=5, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=6, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=7, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=8, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=9, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=10, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=11, in={5:0}] [L21] COND FALSE !(i < 11) VAL [in={5:0}] [L23] in[10] = 0 [L24] idx_in = 0 [L25] s = in [L26] i = 0 [L27] EXPR in[idx_in] [L27] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND FALSE !(('0' <= c) && (c <= '9')) VAL [i=-390241792, idx_in=10, in={5:0}] [L36] CALL __VERIFIER_assert (i >= 0) [L8] COND TRUE !(cond) [L9] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.8s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 533 IncrementalHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 51 mSDtfsCounter, 533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=7, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 185 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 254 ConstructedInterpolants, 12 QuantifiedInterpolants, 842 SizeOfPredicates, 5 NumberOfNonLiveVariables, 422 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 504/760 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 proved your program to be incorrect! [2024-11-06 00:11:59,858 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...