/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/array-examples/data_structures_set_multi_proc_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 15:27:24,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 15:27:24,547 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-21 15:27:24,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 15:27:24,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 15:27:24,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 15:27:24,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 15:27:24,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 15:27:24,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 15:27:24,581 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 15:27:24,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 15:27:24,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 15:27:24,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 15:27:24,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 15:27:24,584 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 15:27:24,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 15:27:24,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 15:27:24,584 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 15:27:24,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 15:27:24,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 15:27:24,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 15:27:24,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 15:27:24,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 15:27:24,586 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 15:27:24,586 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 15:27:24,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 15:27:24,586 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 15:27:24,587 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 15:27:24,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 15:27:24,587 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 15:27:24,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 15:27:24,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 15:27:24,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 15:27:24,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 15:27:24,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 15:27:24,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 15:27:24,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 15:27:24,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 15:27:24,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 15:27:24,589 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 15:27:24,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 15:27:24,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 15:27:24,590 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 15:27:24,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 15:27:24,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 15:27:24,590 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 15:27:24,591 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-21 15:27:24,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 15:27:24,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 15:27:24,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 15:27:24,845 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 15:27:24,846 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 15:27:24,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_ground-1.i [2023-12-21 15:27:26,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 15:27:26,200 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 15:27:26,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_ground-1.i [2023-12-21 15:27:26,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1bed959/39f95ab3e94d40e99619c85d3da7c0ca/FLAGa57e6fdea [2023-12-21 15:27:26,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1bed959/39f95ab3e94d40e99619c85d3da7c0ca [2023-12-21 15:27:26,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 15:27:26,223 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 15:27:26,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 15:27:26,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 15:27:26,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 15:27:26,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c24f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26, skipping insertion in model container [2023-12-21 15:27:26,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,259 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 15:27:26,377 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_ground-1.i[832,845] [2023-12-21 15:27:26,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 15:27:26,409 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 15:27:26,419 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_ground-1.i[832,845] [2023-12-21 15:27:26,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 15:27:26,441 INFO L206 MainTranslator]: Completed translation [2023-12-21 15:27:26,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26 WrapperNode [2023-12-21 15:27:26,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 15:27:26,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 15:27:26,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 15:27:26,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 15:27:26,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,473 INFO L138 Inliner]: procedures = 20, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2023-12-21 15:27:26,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 15:27:26,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 15:27:26,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 15:27:26,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 15:27:26,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,495 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 3, 7]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2023-12-21 15:27:26,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 15:27:26,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 15:27:26,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 15:27:26,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 15:27:26,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (1/1) ... [2023-12-21 15:27:26,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 15:27:26,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 15:27:26,564 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-21 15:27:26,590 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-21 15:27:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 15:27:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 15:27:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 15:27:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 15:27:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 15:27:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 15:27:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 15:27:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-21 15:27:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 15:27:26,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 15:27:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-21 15:27:26,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-21 15:27:26,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 15:27:26,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 15:27:26,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 15:27:26,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-21 15:27:26,708 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 15:27:26,710 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 15:27:27,000 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 15:27:27,053 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 15:27:27,053 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-21 15:27:27,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:27:27 BoogieIcfgContainer [2023-12-21 15:27:27,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 15:27:27,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 15:27:27,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 15:27:27,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 15:27:27,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:27:26" (1/3) ... [2023-12-21 15:27:27,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad9ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:27:27, skipping insertion in model container [2023-12-21 15:27:27,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:27:26" (2/3) ... [2023-12-21 15:27:27,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad9ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:27:27, skipping insertion in model container [2023-12-21 15:27:27,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:27:27" (3/3) ... [2023-12-21 15:27:27,063 INFO L112 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_ground-1.i [2023-12-21 15:27:27,078 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 15:27:27,079 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 15:27:27,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 15:27:27,132 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;@b17d61b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 15:27:27,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 15:27:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 15:27:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 15:27:27,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:27,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:27,145 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:27,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:27,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1234641983, now seen corresponding path program 1 times [2023-12-21 15:27:27,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:27,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713216499] [2023-12-21 15:27:27,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:27:27,183 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-21 15:27:27,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:27,185 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-21 15:27:27,188 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-21 15:27:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:27:27,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 15:27:27,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:27,290 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-21 15:27:27,290 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 15:27:27,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:27,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713216499] [2023-12-21 15:27:27,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713216499] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 15:27:27,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 15:27:27,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 15:27:27,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734706815] [2023-12-21 15:27:27,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 15:27:27,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 15:27:27,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 15:27:27,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 15:27:27,332 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:27,433 INFO L93 Difference]: Finished difference Result 85 states and 145 transitions. [2023-12-21 15:27:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 15:27:27,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-21 15:27:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:27,443 INFO L225 Difference]: With dead ends: 85 [2023-12-21 15:27:27,443 INFO L226 Difference]: Without dead ends: 52 [2023-12-21 15:27:27,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 15:27:27,450 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:27,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 50 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 15:27:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-21 15:27:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 31. [2023-12-21 15:27:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 15:27:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2023-12-21 15:27:27,482 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 9 [2023-12-21 15:27:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:27,483 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2023-12-21 15:27:27,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2023-12-21 15:27:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 15:27:27,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:27,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:27,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-21 15:27:27,687 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-21 15:27:27,687 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:27,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:27,688 INFO L85 PathProgramCache]: Analyzing trace with hash 312467306, now seen corresponding path program 1 times [2023-12-21 15:27:27,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:27,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047052267] [2023-12-21 15:27:27,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:27:27,689 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-21 15:27:27,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:27,690 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-21 15:27:27,692 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-21 15:27:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:27:27,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 15:27:27,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 15:27:27,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:27:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 15:27:27,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:27,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047052267] [2023-12-21 15:27:27,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047052267] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:27:27,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:27:27,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-21 15:27:27,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237623176] [2023-12-21 15:27:27,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:27:27,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 15:27:27,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:27,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 15:27:27,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 15:27:27,809 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:28,109 INFO L93 Difference]: Finished difference Result 146 states and 208 transitions. [2023-12-21 15:27:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 15:27:28,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-21 15:27:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:28,111 INFO L225 Difference]: With dead ends: 146 [2023-12-21 15:27:28,112 INFO L226 Difference]: Without dead ends: 118 [2023-12-21 15:27:28,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-21 15:27:28,113 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 211 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:28,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 125 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 15:27:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-21 15:27:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 34. [2023-12-21 15:27:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 15:27:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2023-12-21 15:27:28,131 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 10 [2023-12-21 15:27:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:28,131 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2023-12-21 15:27:28,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2023-12-21 15:27:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 15:27:28,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:28,132 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:28,137 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-21 15:27:28,334 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-21 15:27:28,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:28,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:28,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1551755521, now seen corresponding path program 2 times [2023-12-21 15:27:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:28,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001994636] [2023-12-21 15:27:28,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 15:27:28,336 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-21 15:27:28,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:28,338 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-21 15:27:28,356 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-21 15:27:28,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 15:27:28,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:27:28,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 15:27:28,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 15:27:28,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 15:27:28,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:28,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001994636] [2023-12-21 15:27:28,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001994636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 15:27:28,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 15:27:28,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 15:27:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287542080] [2023-12-21 15:27:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 15:27:28,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 15:27:28,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:28,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 15:27:28,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 15:27:28,435 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:28,486 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2023-12-21 15:27:28,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 15:27:28,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-21 15:27:28,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:28,490 INFO L225 Difference]: With dead ends: 66 [2023-12-21 15:27:28,490 INFO L226 Difference]: Without dead ends: 37 [2023-12-21 15:27:28,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 15:27:28,494 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:28,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 43 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 15:27:28,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-21 15:27:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-21 15:27:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 15:27:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2023-12-21 15:27:28,507 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 13 [2023-12-21 15:27:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:28,507 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2023-12-21 15:27:28,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2023-12-21 15:27:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 15:27:28,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:28,508 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:28,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-21 15:27:28,720 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-21 15:27:28,721 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:28,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:28,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1817742572, now seen corresponding path program 1 times [2023-12-21 15:27:28,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:28,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521166665] [2023-12-21 15:27:28,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:27:28,722 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-21 15:27:28,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:28,723 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-21 15:27:28,728 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-21 15:27:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:27:28,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 15:27:28,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 15:27:28,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:27:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 15:27:28,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:28,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521166665] [2023-12-21 15:27:28,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521166665] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:27:28,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:27:28,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-21 15:27:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118566235] [2023-12-21 15:27:28,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:27:28,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 15:27:28,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:28,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 15:27:28,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-21 15:27:28,941 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:29,347 INFO L93 Difference]: Finished difference Result 124 states and 169 transitions. [2023-12-21 15:27:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 15:27:29,348 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-21 15:27:29,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:29,349 INFO L225 Difference]: With dead ends: 124 [2023-12-21 15:27:29,349 INFO L226 Difference]: Without dead ends: 93 [2023-12-21 15:27:29,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-21 15:27:29,350 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 181 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:29,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 182 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 15:27:29,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-21 15:27:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 43. [2023-12-21 15:27:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 15:27:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2023-12-21 15:27:29,367 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 25 [2023-12-21 15:27:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:29,368 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2023-12-21 15:27:29,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2023-12-21 15:27:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 15:27:29,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:29,371 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:29,377 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-21 15:27:29,571 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-21 15:27:29,572 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:29,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1364993228, now seen corresponding path program 2 times [2023-12-21 15:27:29,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:29,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594984463] [2023-12-21 15:27:29,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 15:27:29,573 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-21 15:27:29,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:29,574 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-21 15:27:29,576 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-21 15:27:29,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 15:27:29,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:27:29,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 15:27:29,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-21 15:27:29,654 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 15:27:29,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:29,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594984463] [2023-12-21 15:27:29,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594984463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 15:27:29,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 15:27:29,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 15:27:29,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919150586] [2023-12-21 15:27:29,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 15:27:29,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 15:27:29,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:29,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 15:27:29,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 15:27:29,657 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:29,698 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2023-12-21 15:27:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 15:27:29,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-21 15:27:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:29,708 INFO L225 Difference]: With dead ends: 79 [2023-12-21 15:27:29,708 INFO L226 Difference]: Without dead ends: 52 [2023-12-21 15:27:29,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 15:27:29,709 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:29,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 46 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 15:27:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-21 15:27:29,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2023-12-21 15:27:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 15:27:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2023-12-21 15:27:29,724 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 31 [2023-12-21 15:27:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:29,724 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2023-12-21 15:27:29,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2023-12-21 15:27:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 15:27:29,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:29,725 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:29,732 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-21 15:27:29,928 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-21 15:27:29,928 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:29,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1359639454, now seen corresponding path program 1 times [2023-12-21 15:27:29,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:29,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848518189] [2023-12-21 15:27:29,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:27:29,931 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-21 15:27:29,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:29,932 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-21 15:27:29,937 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-21 15:27:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:27:30,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 15:27:30,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 15:27:30,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:27:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 15:27:30,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:30,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848518189] [2023-12-21 15:27:30,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848518189] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:27:30,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:27:30,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-21 15:27:30,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622893964] [2023-12-21 15:27:30,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:27:30,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 15:27:30,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:30,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 15:27:30,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-21 15:27:30,537 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:32,188 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2023-12-21 15:27:32,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 15:27:32,189 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-21 15:27:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:32,190 INFO L225 Difference]: With dead ends: 198 [2023-12-21 15:27:32,190 INFO L226 Difference]: Without dead ends: 166 [2023-12-21 15:27:32,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 15:27:32,192 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 474 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:32,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 492 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 15:27:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-21 15:27:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 56. [2023-12-21 15:27:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 15:27:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2023-12-21 15:27:32,205 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 32 [2023-12-21 15:27:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:32,205 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2023-12-21 15:27:32,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2023-12-21 15:27:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-21 15:27:32,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:32,206 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:32,215 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-21 15:27:32,410 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-21 15:27:32,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:32,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1928039586, now seen corresponding path program 2 times [2023-12-21 15:27:32,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:32,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272257404] [2023-12-21 15:27:32,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 15:27:32,411 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-21 15:27:32,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:32,412 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-21 15:27:32,413 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-21 15:27:32,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 15:27:32,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:27:32,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 15:27:32,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 15:27:32,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:27:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 15:27:34,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:34,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272257404] [2023-12-21 15:27:34,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272257404] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:27:34,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:27:34,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-12-21 15:27:34,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331012544] [2023-12-21 15:27:34,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:27:34,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 15:27:34,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:34,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 15:27:34,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 15:27:34,159 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 47 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:42,185 INFO L93 Difference]: Finished difference Result 342 states and 477 transitions. [2023-12-21 15:27:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-21 15:27:42,186 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 47 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-12-21 15:27:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:42,188 INFO L225 Difference]: With dead ends: 342 [2023-12-21 15:27:42,188 INFO L226 Difference]: Without dead ends: 310 [2023-12-21 15:27:42,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 15:27:42,191 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 1993 mSDsluCounter, 1443 mSDsCounter, 0 mSdLazyCounter, 3561 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 3561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:42,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 1532 Invalid, 4235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 3561 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-21 15:27:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-12-21 15:27:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 80. [2023-12-21 15:27:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 77 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 15:27:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2023-12-21 15:27:42,214 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 44 [2023-12-21 15:27:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:42,215 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2023-12-21 15:27:42,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 47 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2023-12-21 15:27:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-21 15:27:42,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:42,243 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:42,251 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-21 15:27:42,448 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-21 15:27:42,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:42,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1689021730, now seen corresponding path program 3 times [2023-12-21 15:27:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295245311] [2023-12-21 15:27:42,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 15:27:42,450 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-21 15:27:42,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:42,451 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-21 15:27:42,455 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-21 15:27:42,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 15:27:42,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:27:42,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 15:27:42,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2023-12-21 15:27:42,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:27:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2023-12-21 15:27:42,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:42,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295245311] [2023-12-21 15:27:42,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295245311] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:27:42,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:27:42,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-21 15:27:42,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737766637] [2023-12-21 15:27:42,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:27:42,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 15:27:42,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:42,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 15:27:42,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 15:27:42,590 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:42,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:27:42,681 INFO L93 Difference]: Finished difference Result 148 states and 187 transitions. [2023-12-21 15:27:42,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 15:27:42,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-12-21 15:27:42,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:27:42,683 INFO L225 Difference]: With dead ends: 148 [2023-12-21 15:27:42,683 INFO L226 Difference]: Without dead ends: 121 [2023-12-21 15:27:42,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-21 15:27:42,684 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 15:27:42,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 94 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 15:27:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-21 15:27:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2023-12-21 15:27:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 116 states have (on average 1.2241379310344827) internal successors, (142), 116 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 15:27:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2023-12-21 15:27:42,698 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 68 [2023-12-21 15:27:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:27:42,699 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2023-12-21 15:27:42,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:27:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2023-12-21 15:27:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-21 15:27:42,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:27:42,700 INFO L195 NwaCegarLoop]: trace histogram [46, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:27:42,706 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-21 15:27:42,905 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-21 15:27:42,906 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:27:42,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:27:42,906 INFO L85 PathProgramCache]: Analyzing trace with hash 929729075, now seen corresponding path program 4 times [2023-12-21 15:27:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:27:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484498932] [2023-12-21 15:27:42,907 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 15:27:42,907 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-21 15:27:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:27:42,908 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-21 15:27:42,910 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-21 15:27:43,129 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 15:27:43,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:27:43,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-21 15:27:43,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:27:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-21 15:27:44,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:27:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-21 15:27:49,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:27:49,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484498932] [2023-12-21 15:27:49,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484498932] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:27:49,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:27:49,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2023-12-21 15:27:49,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713580207] [2023-12-21 15:27:49,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:27:49,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-12-21 15:27:49,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:27:49,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-12-21 15:27:49,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2023-12-21 15:27:49,129 INFO L87 Difference]: Start difference. First operand 119 states and 144 transitions. Second operand has 96 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 95 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:28:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:28:41,741 INFO L93 Difference]: Finished difference Result 708 states and 993 transitions. [2023-12-21 15:28:41,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-12-21 15:28:41,743 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 95 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-12-21 15:28:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:28:41,746 INFO L225 Difference]: With dead ends: 708 [2023-12-21 15:28:41,746 INFO L226 Difference]: Without dead ends: 637 [2023-12-21 15:28:41,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 49.4s TimeCoverageRelationStatistics Valid=6814, Invalid=13208, Unknown=0, NotChecked=0, Total=20022 [2023-12-21 15:28:41,751 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 7017 mSDsluCounter, 5466 mSDsCounter, 0 mSdLazyCounter, 14079 mSolverCounterSat, 2397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7065 SdHoareTripleChecker+Valid, 5627 SdHoareTripleChecker+Invalid, 16476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2397 IncrementalHoareTripleChecker+Valid, 14079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-12-21 15:28:41,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7065 Valid, 5627 Invalid, 16476 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2397 Valid, 14079 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-12-21 15:28:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2023-12-21 15:28:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 167. [2023-12-21 15:28:41,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 164 states have (on average 1.1585365853658536) internal successors, (190), 164 states have internal predecessors, (190), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 15:28:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 192 transitions. [2023-12-21 15:28:41,780 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 192 transitions. Word has length 89 [2023-12-21 15:28:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:28:41,781 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 192 transitions. [2023-12-21 15:28:41,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 95 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:28:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2023-12-21 15:28:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-21 15:28:41,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:28:41,782 INFO L195 NwaCegarLoop]: trace histogram [94, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:28:41,792 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-21 15:28:41,988 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-21 15:28:41,988 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:28:41,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:28:41,989 INFO L85 PathProgramCache]: Analyzing trace with hash 243084083, now seen corresponding path program 5 times [2023-12-21 15:28:41,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:28:41,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670033387] [2023-12-21 15:28:41,990 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 15:28:41,990 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-21 15:28:41,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:28:41,991 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-21 15:28:41,993 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-21 15:28:45,200 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2023-12-21 15:28:45,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:28:45,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 15:28:45,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:28:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4515 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 4480 trivial. 0 not checked. [2023-12-21 15:28:45,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:28:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4515 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 4480 trivial. 0 not checked. [2023-12-21 15:28:45,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:28:45,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670033387] [2023-12-21 15:28:45,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670033387] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:28:45,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:28:45,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-21 15:28:45,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143694038] [2023-12-21 15:28:45,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:28:45,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 15:28:45,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:28:45,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 15:28:45,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-21 15:28:45,645 INFO L87 Difference]: Start difference. First operand 167 states and 192 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:28:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:28:45,952 INFO L93 Difference]: Finished difference Result 301 states and 380 transitions. [2023-12-21 15:28:45,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 15:28:45,952 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2023-12-21 15:28:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:28:45,954 INFO L225 Difference]: With dead ends: 301 [2023-12-21 15:28:45,954 INFO L226 Difference]: Without dead ends: 270 [2023-12-21 15:28:45,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2023-12-21 15:28:45,955 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 161 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 15:28:45,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 226 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 15:28:45,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-21 15:28:45,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2023-12-21 15:28:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 222 states have (on average 1.2297297297297298) internal successors, (273), 222 states have internal predecessors, (273), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 15:28:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 275 transitions. [2023-12-21 15:28:45,983 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 275 transitions. Word has length 137 [2023-12-21 15:28:45,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:28:45,985 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 275 transitions. [2023-12-21 15:28:45,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:28:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 275 transitions. [2023-12-21 15:28:45,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-21 15:28:45,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:28:45,986 INFO L195 NwaCegarLoop]: trace histogram [94, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:28:46,002 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-21 15:28:46,199 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-21 15:28:46,200 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:28:46,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:28:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1292886737, now seen corresponding path program 1 times [2023-12-21 15:28:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:28:46,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618389323] [2023-12-21 15:28:46,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 15:28:46,201 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-21 15:28:46,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:28:46,202 INFO L229 MonitoredProcess]: Starting monitored process 12 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-21 15:28:46,216 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 (12)] Waiting until timeout for monitored process [2023-12-21 15:28:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 15:28:46,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 96 conjunts are in the unsatisfiable core [2023-12-21 15:28:46,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:28:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-21 15:28:50,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:29:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-21 15:29:09,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:29:09,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618389323] [2023-12-21 15:29:09,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618389323] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:29:09,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:29:09,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 191 [2023-12-21 15:29:09,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415095532] [2023-12-21 15:29:09,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:29:09,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2023-12-21 15:29:09,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:29:09,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2023-12-21 15:29:09,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9406, Invalid=27266, Unknown=0, NotChecked=0, Total=36672 [2023-12-21 15:29:09,327 INFO L87 Difference]: Start difference. First operand 225 states and 275 transitions. Second operand has 192 states, 192 states have (on average 1.109375) internal successors, (213), 191 states have internal predecessors, (213), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:37:23,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 15:37:23,728 INFO L93 Difference]: Finished difference Result 1400 states and 1975 transitions. [2023-12-21 15:37:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2023-12-21 15:37:23,729 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 192 states have (on average 1.109375) internal successors, (213), 191 states have internal predecessors, (213), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2023-12-21 15:37:23,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 15:37:23,735 INFO L225 Difference]: With dead ends: 1400 [2023-12-21 15:37:23,735 INFO L226 Difference]: Without dead ends: 1271 [2023-12-21 15:37:23,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 479.9s TimeCoverageRelationStatistics Valid=27454, Invalid=54056, Unknown=0, NotChecked=0, Total=81510 [2023-12-21 15:37:23,743 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 28045 mSDsluCounter, 19757 mSDsCounter, 0 mSdLazyCounter, 55872 mSolverCounterSat, 9636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28141 SdHoareTripleChecker+Valid, 20062 SdHoareTripleChecker+Invalid, 65508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 9636 IncrementalHoareTripleChecker+Valid, 55872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2023-12-21 15:37:23,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28141 Valid, 20062 Invalid, 65508 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [9636 Valid, 55872 Invalid, 0 Unknown, 0 Unchecked, 32.3s Time] [2023-12-21 15:37:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2023-12-21 15:37:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 321. [2023-12-21 15:37:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 318 states have (on average 1.1603773584905661) internal successors, (369), 318 states have internal predecessors, (369), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 15:37:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 371 transitions. [2023-12-21 15:37:23,798 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 371 transitions. Word has length 137 [2023-12-21 15:37:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 15:37:23,798 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 371 transitions. [2023-12-21 15:37:23,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 192 states have (on average 1.109375) internal successors, (213), 191 states have internal predecessors, (213), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:37:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 371 transitions. [2023-12-21 15:37:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-12-21 15:37:23,801 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 15:37:23,801 INFO L195 NwaCegarLoop]: trace histogram [190, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 15:37:23,819 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 (12)] Forceful destruction successful, exit code 0 [2023-12-21 15:37:24,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-21 15:37:24,019 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 15:37:24,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 15:37:24,019 INFO L85 PathProgramCache]: Analyzing trace with hash 952313041, now seen corresponding path program 2 times [2023-12-21 15:37:24,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 15:37:24,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161365466] [2023-12-21 15:37:24,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 15:37:24,020 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-21 15:37:24,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 15:37:24,021 INFO L229 MonitoredProcess]: Starting monitored process 13 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-21 15:37:24,022 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 (13)] Waiting until timeout for monitored process [2023-12-21 15:37:24,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 15:37:24,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 15:37:24,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 1107 conjuncts, 192 conjunts are in the unsatisfiable core [2023-12-21 15:37:24,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 15:37:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18192 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-21 15:37:38,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 15:38:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18192 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-21 15:38:59,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 15:38:59,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161365466] [2023-12-21 15:38:59,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161365466] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 15:38:59,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 15:38:59,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192] total 383 [2023-12-21 15:38:59,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178498612] [2023-12-21 15:38:59,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 15:38:59,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2023-12-21 15:38:59,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 15:38:59,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2023-12-21 15:38:59,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37246, Invalid=109826, Unknown=0, NotChecked=0, Total=147072 [2023-12-21 15:38:59,099 INFO L87 Difference]: Start difference. First operand 321 states and 371 transitions. Second operand has 384 states, 384 states have (on average 1.0546875) internal successors, (405), 383 states have internal predecessors, (405), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 15:39:44,152 WARN L293 SmtUtils]: Spent 8.92s on a formula simplification. DAG size of input: 574 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 15:40:09,571 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification. DAG size of input: 571 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 15:40:34,877 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 568 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 15:41:00,857 WARN L293 SmtUtils]: Spent 7.63s on a formula simplification. DAG size of input: 565 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 15:41:27,712 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification. DAG size of input: 562 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-21 15:41:41,969 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 15:41:41,969 WARN L340 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 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 15:41:42,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2023-12-21 15:41:42,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 220.8s TimeCoverageRelationStatistics Valid=39166, Invalid=111766, Unknown=0, NotChecked=0, Total=150932 [2023-12-21 15:41:42,014 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36678 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2023-12-21 15:41:42,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 36679 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 36678 Invalid, 0 Unknown, 0 Unchecked, 19.1s Time] [2023-12-21 15:41:42,015 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 15:41:42,028 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 (13)] Forceful destruction successful, exit code 0 [2023-12-21 15:41:42,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-21 15:41:42,216 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (321states) and FLOYD_HOARE automaton (currently 198 states, 384 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 389 known predicates. [2023-12-21 15:41:42,220 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1] [2023-12-21 15:41:42,222 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 15:41:42,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:41:42 BoogieIcfgContainer [2023-12-21 15:41:42,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 15:41:42,224 INFO L158 Benchmark]: Toolchain (without parser) took 856001.33ms. Allocated memory was 180.4MB in the beginning and 233.8MB in the end (delta: 53.5MB). Free memory was 137.2MB in the beginning and 29.0MB in the end (delta: 108.2MB). Peak memory consumption was 164.1MB. Max. memory is 8.0GB. [2023-12-21 15:41:42,224 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 180.4MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 15:41:42,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.66ms. Allocated memory is still 180.4MB. Free memory was 137.2MB in the beginning and 125.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 15:41:42,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.53ms. Allocated memory is still 180.4MB. Free memory was 125.0MB in the beginning and 123.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 15:41:42,225 INFO L158 Benchmark]: Boogie Preprocessor took 51.12ms. Allocated memory is still 180.4MB. Free memory was 123.3MB in the beginning and 120.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 15:41:42,225 INFO L158 Benchmark]: RCFGBuilder took 520.57ms. Allocated memory is still 180.4MB. Free memory was 120.8MB in the beginning and 102.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-21 15:41:42,225 INFO L158 Benchmark]: TraceAbstraction took 855167.19ms. Allocated memory was 180.4MB in the beginning and 233.8MB in the end (delta: 53.5MB). Free memory was 101.2MB in the beginning and 29.0MB in the end (delta: 72.2MB). Peak memory consumption was 127.4MB. Max. memory is 8.0GB. [2023-12-21 15:41:42,226 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.20ms. Allocated memory is still 180.4MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.66ms. Allocated memory is still 180.4MB. Free memory was 137.2MB in the beginning and 125.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.53ms. Allocated memory is still 180.4MB. Free memory was 125.0MB in the beginning and 123.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.12ms. Allocated memory is still 180.4MB. Free memory was 123.3MB in the beginning and 120.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 520.57ms. Allocated memory is still 180.4MB. Free memory was 120.8MB in the beginning and 102.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 855167.19ms. Allocated memory was 180.4MB in the beginning and 233.8MB in the end (delta: 53.5MB). Free memory was 101.2MB in the beginning and 29.0MB in the end (delta: 72.2MB). Peak memory consumption was 127.4MB. 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 - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13). Cancelled while NwaCegarLoop was constructing difference of abstraction (321states) and FLOYD_HOARE automaton (currently 198 states, 384 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 389 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 855.1s, OverallIterations: 12, TraceHistogramMax: 190, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 721.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38398 SdHoareTripleChecker+Valid, 64.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38201 mSDsluCounter, 28479 SdHoareTripleChecker+Invalid, 54.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27631 mSDsCounter, 13002 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111680 IncrementalHoareTripleChecker+Invalid, 124682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13002 mSolverCounterUnsat, 848 mSDtfsCounter, 111680 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1775 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 956 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5742 ImplicationChecksByTransitivity, 758.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred in iteration=11, InterpolantAutomatonStates: 410, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1970 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 126.3s InterpolantComputationTime, 828 NumberOfCodeBlocks, 764 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 1582 ConstructedInterpolants, 0 QuantifiedInterpolants, 4550 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3364 ConjunctsInSsa, 400 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 11538/59580 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown