/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:15:13,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:15:13,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:15:13,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:15:13,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:15:13,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:15:13,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:15:13,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:15:13,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:15:13,654 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:15:13,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:15:13,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:15:13,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:15:13,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:15:13,657 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:15:13,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:15:13,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:15:13,658 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:15:13,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:15:13,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:15:13,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:15:13,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:15:13,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:15:13,661 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:15:13,661 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:15:13,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:15:13,661 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:15:13,662 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:15:13,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:15:13,662 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:15:13,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:15:13,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:15:13,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:15:13,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:15:13,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:15:13,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:15:13,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:15:13,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:15:13,664 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:15:13,665 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:15:13,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:15:13,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:15:13,665 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:15:13,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:15:13,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:15:13,666 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:15:13,666 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 [2023-12-16 16:15:13,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:15:13,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:15:13,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:15:13,897 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:15:13,899 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:15:13,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i [2023-12-16 16:15:15,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:15:15,287 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:15:15,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i [2023-12-16 16:15:15,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a984233b3/e65c3db914524840ae6c65115ecfad92/FLAG1d7242db6 [2023-12-16 16:15:15,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a984233b3/e65c3db914524840ae6c65115ecfad92 [2023-12-16 16:15:15,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:15:15,318 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:15:15,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:15:15,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:15:15,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:15:15,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70fb4ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15, skipping insertion in model container [2023-12-16 16:15:15,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,372 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:15:15,501 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i[296,309] [2023-12-16 16:15:15,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:15:15,639 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:15:15,647 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i[296,309] [2023-12-16 16:15:15,683 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:15:15,733 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:15:15,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15 WrapperNode [2023-12-16 16:15:15,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:15:15,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:15:15,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:15:15,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:15:15,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,787 INFO L138 Inliner]: procedures = 127, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2023-12-16 16:15:15,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:15:15,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:15:15,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:15:15,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:15:15,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,820 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 2, 0]. 50 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2, 0]. The 0 writes are split as follows [0, 0, 0]. [2023-12-16 16:15:15,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:15:15,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:15:15,840 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:15:15,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:15:15,841 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (1/1) ... [2023-12-16 16:15:15,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:15:15,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:15:15,885 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) [2023-12-16 16:15:15,909 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 [2023-12-16 16:15:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2023-12-16 16:15:15,916 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2023-12-16 16:15:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:15:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-12-16 16:15:15,918 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-12-16 16:15:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 16:15:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 16:15:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-16 16:15:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2023-12-16 16:15:15,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2023-12-16 16:15:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:15:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:15:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 16:15:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:15:15,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:15:16,061 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:15:16,063 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:15:16,245 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:15:16,290 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:15:16,290 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 16:15:16,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:15:16 BoogieIcfgContainer [2023-12-16 16:15:16,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:15:16,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:15:16,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:15:16,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:15:16,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:15:15" (1/3) ... [2023-12-16 16:15:16,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261c3b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:15:16, skipping insertion in model container [2023-12-16 16:15:16,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:15" (2/3) ... [2023-12-16 16:15:16,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261c3b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:15:16, skipping insertion in model container [2023-12-16 16:15:16,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:15:16" (3/3) ... [2023-12-16 16:15:16,302 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2023-12-16 16:15:16,319 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:15:16,319 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:15:16,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:15:16,382 INFO L357 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, mHoare=true, 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;@19f804b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:15:16,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:15:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 states have internal predecessors, (26), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 16:15:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 16:15:16,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:16,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 16:15:16,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:16,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:16,404 INFO L85 PathProgramCache]: Analyzing trace with hash -938885129, now seen corresponding path program 1 times [2023-12-16 16:15:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:16,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131313268] [2023-12-16 16:15:16,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:16,417 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 [2023-12-16 16:15:16,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:16,422 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) [2023-12-16 16:15:16,457 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 [2023-12-16 16:15:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:16,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:15:16,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:16,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:15:16,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:16,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131313268] [2023-12-16 16:15:16,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131313268] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:15:16,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:15:16,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:15:16,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108125339] [2023-12-16 16:15:16,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:15:16,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:15:16,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:16,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:15:16,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:15:16,642 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 states have internal predecessors, (26), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:15:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:16,707 INFO L93 Difference]: Finished difference Result 60 states and 85 transitions. [2023-12-16 16:15:16,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:15:16,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-16 16:15:16,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:16,715 INFO L225 Difference]: With dead ends: 60 [2023-12-16 16:15:16,715 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 16:15:16,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:15:16,721 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:16,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:15:16,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 16:15:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-16 16:15:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 16:15:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-16 16:15:16,752 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 6 [2023-12-16 16:15:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:16,752 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-16 16:15:16,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:15:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-16 16:15:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:15:16,754 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:16,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:16,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:16,957 WARN L477 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 [2023-12-16 16:15:16,958 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:16,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:16,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1815646752, now seen corresponding path program 1 times [2023-12-16 16:15:16,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:16,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576696342] [2023-12-16 16:15:16,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:16,960 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 [2023-12-16 16:15:16,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:16,961 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) [2023-12-16 16:15:16,964 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 [2023-12-16 16:15:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:17,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 16:15:17,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:15:17,099 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:15:17,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:17,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576696342] [2023-12-16 16:15:17,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576696342] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:15:17,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:15:17,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:15:17,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409181471] [2023-12-16 16:15:17,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:15:17,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:15:17,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:17,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:15:17,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:15:17,103 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:15:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:17,162 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2023-12-16 16:15:17,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:15:17,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-12-16 16:15:17,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:17,165 INFO L225 Difference]: With dead ends: 48 [2023-12-16 16:15:17,165 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 16:15:17,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:15:17,168 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:17,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 150 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:15:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 16:15:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-16 16:15:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-16 16:15:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-12-16 16:15:17,185 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 23 [2023-12-16 16:15:17,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:17,185 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-12-16 16:15:17,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:15:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-12-16 16:15:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:15:17,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:17,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:17,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:17,390 WARN L477 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 [2023-12-16 16:15:17,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:17,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:17,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1422619742, now seen corresponding path program 1 times [2023-12-16 16:15:17,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:17,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627386214] [2023-12-16 16:15:17,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:17,393 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 [2023-12-16 16:15:17,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:17,409 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) [2023-12-16 16:15:17,436 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 [2023-12-16 16:15:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:17,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 16:15:17,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:15:17,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:15:17,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:17,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627386214] [2023-12-16 16:15:17,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627386214] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:17,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:17,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-12-16 16:15:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775783140] [2023-12-16 16:15:17,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:17,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:15:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:17,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:15:17,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:15:17,655 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:15:17,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:17,688 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2023-12-16 16:15:17,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:15:17,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-12-16 16:15:17,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:17,689 INFO L225 Difference]: With dead ends: 50 [2023-12-16 16:15:17,689 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 16:15:17,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:15:17,691 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:17,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 159 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:15:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 16:15:17,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-16 16:15:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 16:15:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-12-16 16:15:17,696 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 23 [2023-12-16 16:15:17,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:17,696 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-12-16 16:15:17,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:15:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-12-16 16:15:17,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:15:17,697 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:17,697 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:17,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:17,900 WARN L477 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 [2023-12-16 16:15:17,901 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:17,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -571524964, now seen corresponding path program 1 times [2023-12-16 16:15:17,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:17,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495087073] [2023-12-16 16:15:17,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:17,902 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 [2023-12-16 16:15:17,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:17,903 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) [2023-12-16 16:15:17,906 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 [2023-12-16 16:15:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:17,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 16:15:17,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:15:18,248 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:15:18,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495087073] [2023-12-16 16:15:18,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495087073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:15:18,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:15:18,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 16:15:18,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391486884] [2023-12-16 16:15:18,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:15:18,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:15:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:18,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:15:18,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:15:18,254 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:15:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:18,721 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2023-12-16 16:15:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 16:15:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-12-16 16:15:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:18,723 INFO L225 Difference]: With dead ends: 58 [2023-12-16 16:15:18,723 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 16:15:18,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-12-16 16:15:18,724 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:18,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 120 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:15:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 16:15:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2023-12-16 16:15:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 37 states have internal predecessors, (43), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-12-16 16:15:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2023-12-16 16:15:18,739 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 23 [2023-12-16 16:15:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:18,739 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2023-12-16 16:15:18,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:15:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2023-12-16 16:15:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 16:15:18,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:18,741 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:18,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:18,944 WARN L477 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 [2023-12-16 16:15:18,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:18,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash -767744731, now seen corresponding path program 1 times [2023-12-16 16:15:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:18,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668513289] [2023-12-16 16:15:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:18,946 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 [2023-12-16 16:15:18,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:18,948 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) [2023-12-16 16:15:18,949 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 [2023-12-16 16:15:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:19,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 16:15:19,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 16:15:19,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:19,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:19,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668513289] [2023-12-16 16:15:19,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668513289] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:19,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:19,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2023-12-16 16:15:19,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33416024] [2023-12-16 16:15:19,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:19,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-16 16:15:19,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:19,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-16 16:15:19,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2023-12-16 16:15:19,821 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 16:15:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:20,857 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2023-12-16 16:15:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 16:15:20,858 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 30 [2023-12-16 16:15:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:20,859 INFO L225 Difference]: With dead ends: 76 [2023-12-16 16:15:20,859 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 16:15:20,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 16:15:20,861 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 65 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:20,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 117 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 16:15:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 16:15:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2023-12-16 16:15:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2023-12-16 16:15:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2023-12-16 16:15:20,873 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 30 [2023-12-16 16:15:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:20,873 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2023-12-16 16:15:20,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 16:15:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2023-12-16 16:15:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 16:15:20,874 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:20,875 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:20,881 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 [2023-12-16 16:15:21,079 WARN L477 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 [2023-12-16 16:15:21,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:21,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:21,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1577091357, now seen corresponding path program 1 times [2023-12-16 16:15:21,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:21,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215259486] [2023-12-16 16:15:21,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:21,080 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 [2023-12-16 16:15:21,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:21,081 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) [2023-12-16 16:15:21,082 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 [2023-12-16 16:15:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:21,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 16:15:21,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:21,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:21,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:21,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215259486] [2023-12-16 16:15:21,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215259486] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:21,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:21,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-12-16 16:15:21,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030787082] [2023-12-16 16:15:21,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:21,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 16:15:21,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 16:15:21,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:15:21,707 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 22 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 5 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 16:15:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:22,606 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2023-12-16 16:15:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:15:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 5 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-12-16 16:15:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:22,608 INFO L225 Difference]: With dead ends: 81 [2023-12-16 16:15:22,608 INFO L226 Difference]: Without dead ends: 71 [2023-12-16 16:15:22,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2023-12-16 16:15:22,610 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 80 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:22,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 85 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 16:15:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-16 16:15:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2023-12-16 16:15:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 16:15:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-12-16 16:15:22,622 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 30 [2023-12-16 16:15:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:22,622 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-12-16 16:15:22,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 5 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 16:15:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-12-16 16:15:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 16:15:22,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:22,626 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:22,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:22,829 WARN L477 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 [2023-12-16 16:15:22,830 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:22,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1743982480, now seen corresponding path program 1 times [2023-12-16 16:15:22,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:22,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141824352] [2023-12-16 16:15:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:22,831 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 [2023-12-16 16:15:22,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:22,832 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) [2023-12-16 16:15:22,837 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 [2023-12-16 16:15:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:22,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 16:15:22,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:15:23,185 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:15:23,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141824352] [2023-12-16 16:15:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141824352] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:15:23,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:15:23,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-16 16:15:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441136098] [2023-12-16 16:15:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:15:23,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 16:15:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:23,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 16:15:23,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-12-16 16:15:23,187 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 15 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 16:15:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:23,514 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2023-12-16 16:15:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 16:15:23,515 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2023-12-16 16:15:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:23,515 INFO L225 Difference]: With dead ends: 75 [2023-12-16 16:15:23,516 INFO L226 Difference]: Without dead ends: 61 [2023-12-16 16:15:23,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2023-12-16 16:15:23,517 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:23,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 109 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:15:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-16 16:15:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2023-12-16 16:15:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 16:15:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2023-12-16 16:15:23,526 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 40 [2023-12-16 16:15:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:23,527 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2023-12-16 16:15:23,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 16:15:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2023-12-16 16:15:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 16:15:23,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:23,528 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:23,535 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 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:23,732 WARN L477 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 [2023-12-16 16:15:23,732 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:23,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:23,733 INFO L85 PathProgramCache]: Analyzing trace with hash -775977454, now seen corresponding path program 1 times [2023-12-16 16:15:23,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:23,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779375371] [2023-12-16 16:15:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:23,733 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 [2023-12-16 16:15:23,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:23,735 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) [2023-12-16 16:15:23,738 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 [2023-12-16 16:15:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:23,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 16:15:23,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:15:24,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:15:24,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:24,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779375371] [2023-12-16 16:15:24,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779375371] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:24,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:24,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2023-12-16 16:15:24,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587034087] [2023-12-16 16:15:24,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:24,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-16 16:15:24,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:24,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-16 16:15:24,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2023-12-16 16:15:24,551 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 27 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 9 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 16:15:25,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:25,548 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2023-12-16 16:15:25,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 16:15:25,552 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 9 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 40 [2023-12-16 16:15:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:25,553 INFO L225 Difference]: With dead ends: 83 [2023-12-16 16:15:25,553 INFO L226 Difference]: Without dead ends: 72 [2023-12-16 16:15:25,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=1412, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 16:15:25,555 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 59 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:25,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 150 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 16:15:25,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-16 16:15:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2023-12-16 16:15:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 16:15:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2023-12-16 16:15:25,566 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 40 [2023-12-16 16:15:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:25,567 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2023-12-16 16:15:25,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 9 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 16:15:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2023-12-16 16:15:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 16:15:25,568 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:25,568 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:25,578 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 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:25,773 WARN L477 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 [2023-12-16 16:15:25,774 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:25,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:25,774 INFO L85 PathProgramCache]: Analyzing trace with hash -74912876, now seen corresponding path program 1 times [2023-12-16 16:15:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:25,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748833215] [2023-12-16 16:15:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:25,775 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 [2023-12-16 16:15:25,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:25,776 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2023-12-16 16:15:25,777 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 (10)] Waiting until timeout for monitored process [2023-12-16 16:15:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:25,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-16 16:15:25,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:15:26,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 16:15:26,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:26,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748833215] [2023-12-16 16:15:26,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748833215] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:26,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:26,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 17 [2023-12-16 16:15:26,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141087060] [2023-12-16 16:15:26,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:26,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 16:15:26,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:26,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 16:15:26,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2023-12-16 16:15:26,547 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 16:15:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:27,206 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2023-12-16 16:15:27,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:15:27,206 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 40 [2023-12-16 16:15:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:27,207 INFO L225 Difference]: With dead ends: 64 [2023-12-16 16:15:27,207 INFO L226 Difference]: Without dead ends: 57 [2023-12-16 16:15:27,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2023-12-16 16:15:27,208 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 42 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:27,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 71 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:15:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-16 16:15:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-12-16 16:15:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 16:15:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-12-16 16:15:27,217 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 40 [2023-12-16 16:15:27,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:27,218 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-12-16 16:15:27,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 16:15:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-12-16 16:15:27,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 16:15:27,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:27,219 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:27,228 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 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:27,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 [2023-12-16 16:15:27,423 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:27,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:27,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1736769837, now seen corresponding path program 1 times [2023-12-16 16:15:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:27,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246097434] [2023-12-16 16:15:27,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:27,424 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 [2023-12-16 16:15:27,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:27,425 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2023-12-16 16:15:27,464 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 (11)] Waiting until timeout for monitored process [2023-12-16 16:15:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:15:27,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 16:15:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:15:27,613 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 16:15:27,613 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 16:15:27,614 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:15:27,624 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:27,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 [2023-12-16 16:15:27,823 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:27,826 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:15:27,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:15:27 BoogieIcfgContainer [2023-12-16 16:15:27,881 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:15:27,881 INFO L158 Benchmark]: Toolchain (without parser) took 12563.27ms. Allocated memory was 363.9MB in the beginning and 437.3MB in the end (delta: 73.4MB). Free memory was 313.5MB in the beginning and 271.0MB in the end (delta: 42.5MB). Peak memory consumption was 116.9MB. Max. memory is 8.0GB. [2023-12-16 16:15:27,881 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 206.6MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:15:27,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.59ms. Allocated memory is still 363.9MB. Free memory was 313.5MB in the beginning and 295.1MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 16:15:27,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.26ms. Allocated memory is still 363.9MB. Free memory was 294.6MB in the beginning and 293.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:15:27,882 INFO L158 Benchmark]: Boogie Preprocessor took 51.32ms. Allocated memory is still 363.9MB. Free memory was 293.0MB in the beginning and 290.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:15:27,883 INFO L158 Benchmark]: RCFGBuilder took 450.78ms. Allocated memory is still 363.9MB. Free memory was 290.4MB in the beginning and 274.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 16:15:27,883 INFO L158 Benchmark]: TraceAbstraction took 11585.12ms. Allocated memory was 363.9MB in the beginning and 437.3MB in the end (delta: 73.4MB). Free memory was 273.6MB in the beginning and 271.0MB in the end (delta: 2.6MB). Peak memory consumption was 77.1MB. Max. memory is 8.0GB. [2023-12-16 16:15:27,885 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.18ms. Allocated memory is still 206.6MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 416.59ms. Allocated memory is still 363.9MB. Free memory was 313.5MB in the beginning and 295.1MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.26ms. Allocated memory is still 363.9MB. Free memory was 294.6MB in the beginning and 293.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.32ms. Allocated memory is still 363.9MB. Free memory was 293.0MB in the beginning and 290.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 450.78ms. Allocated memory is still 363.9MB. Free memory was 290.4MB in the beginning and 274.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 11585.12ms. Allocated memory was 363.9MB in the beginning and 437.3MB in the end (delta: 73.4MB). Free memory was 273.6MB in the beginning and 271.0MB in the end (delta: 2.6MB). Peak memory consumption was 77.1MB. 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: 6]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L519] void * guard_malloc_counter = 0; [L534] struct list_head *elem = ((void *)0); [L544] static struct list_head head; [L544] static struct list_head head; [L544] static struct list_head head; [L546] struct list_head *dev1, *dev2; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L547] CALL, EXPR my_malloc(sizeof(*dev1)) VAL [\old(guard_malloc_counter)={0:0}, elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L529] CALL, EXPR __getMemory(size) [L522] (size > 0) ? (0) : __blast_assert () VAL [\old(guard_malloc_counter)={0:0}, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={4:0}, size=8] [L523] guard_malloc_counter++ [L524] COND FALSE !(!__VERIFIER_nondet_int()) [L526] return (void *) guard_malloc_counter; VAL [\old(guard_malloc_counter)={0:0}, \old(size)=8, \result={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={4:0}, size=8] [L529] RET, EXPR __getMemory(size) [L529] return __getMemory(size); [L547] RET, EXPR my_malloc(sizeof(*dev1)) VAL [elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L547] dev1 = my_malloc(sizeof(*dev1)) [L548] CALL, EXPR my_malloc(sizeof(*dev2)) VAL [\old(guard_malloc_counter)={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L529] CALL, EXPR __getMemory(size) [L522] (size > 0) ? (0) : __blast_assert () VAL [\old(guard_malloc_counter)={0:1}, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={4:0}, size=8] [L523] guard_malloc_counter++ [L524] COND FALSE !(!__VERIFIER_nondet_int()) [L526] return (void *) guard_malloc_counter; VAL [\old(guard_malloc_counter)={0:1}, \old(size)=8, \result={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}, size=8] [L529] RET, EXPR __getMemory(size) [L529] return __getMemory(size); [L548] RET, EXPR my_malloc(sizeof(*dev2)) VAL [dev1={0:1}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L548] dev2 = my_malloc(sizeof(*dev2)) [L549] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) VAL [dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L550] CALL list_add(dev2, &head) VAL [\old(elem)={0:0}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}, head={4:0}, new={0:2}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)={0:0}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}, head={4:0}, head={4:0}, new={0:2}, new={0:2}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] elem = new VAL [\old(elem)={0:0}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}, head={4:0}, head={4:0}, new={0:2}, new={0:2}] [L550] RET list_add(dev2, &head) VAL [dev1={0:1}, dev2={0:2}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}] [L551] CALL list_add(dev1, &head) VAL [\old(elem)={0:2}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}, head={4:0}, new={0:1}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)={0:2}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}, head={4:0}, head={4:0}, new={0:1}, new={0:1}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] elem = new VAL [\old(elem)={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}, head={4:0}, head={4:0}, new={0:1}, new={0:1}] [L551] RET list_add(dev1, &head) VAL [dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L552] CALL list_del(dev2) [L541] COND FALSE !(entry==elem) VAL [elem={0:1}, entry={0:2}, entry={0:2}, guard_malloc_counter={0:2}, head={4:0}] [L552] RET list_del(dev2) [L553] CALL list_add(dev2, &head) VAL [\old(elem)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}, head={4:0}, new={0:2}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}, head={4:0}, head={4:0}, new={0:2}, new={0:2}] [L537] COND FALSE !(__VERIFIER_nondet_int()) [L553] RET list_add(dev2, &head) VAL [dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L554] CALL list_add(dev1, &head) VAL [\old(elem)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}, head={4:0}, new={0:1}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}, head={4:0}, head={4:0}, new={0:1}, new={0:1}] [L536] CALL __blast_assert () VAL [\old(elem)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L6] reach_error() VAL [\old(elem)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 324 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 319 mSDsluCounter, 1043 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 863 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3366 IncrementalHoareTripleChecker+Invalid, 3501 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 180 mSDtfsCounter, 3366 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=5, InterpolantAutomatonStates: 129, 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, 9 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 1691 SizeOfPredicates, 46 NumberOfNonLiveVariables, 887 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 98/136 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! [2023-12-16 16:15:27,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...