/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-industry-pattern/array_of_struct_ptr_flag_init.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 16:56:00,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 16:56:01,034 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 16:56:01,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 16:56:01,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 16:56:01,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 16:56:01,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 16:56:01,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 16:56:01,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 16:56:01,064 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 16:56:01,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 16:56:01,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 16:56:01,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 16:56:01,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 16:56:01,065 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 16:56:01,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 16:56:01,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 16:56:01,066 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 16:56:01,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 16:56:01,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 16:56:01,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 16:56:01,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 16:56:01,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 16:56:01,068 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 16:56:01,068 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 16:56:01,069 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 16:56:01,069 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 16:56:01,069 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 16:56:01,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 16:56:01,069 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 16:56:01,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 16:56:01,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 16:56:01,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 16:56:01,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 16:56:01,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 16:56:01,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 16:56:01,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 16:56:01,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 16:56:01,071 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 16:56:01,071 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 16:56:01,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 16:56:01,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 16:56:01,071 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 16:56:01,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 16:56:01,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 16:56:01,072 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 16:56:01,072 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 16:56:01,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 16:56:01,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 16:56:01,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 16:56:01,240 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 16:56:01,240 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 16:56:01,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2023-12-21 16:56:02,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 16:56:02,452 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 16:56:02,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2023-12-21 16:56:02,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a40b1a31/f881ac03a3aa4d2f8faaf5453e01bdbb/FLAGf7346e0d3 [2023-12-21 16:56:02,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a40b1a31/f881ac03a3aa4d2f8faaf5453e01bdbb [2023-12-21 16:56:02,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 16:56:02,472 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 16:56:02,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 16:56:02,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 16:56:02,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 16:56:02,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3496e541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02, skipping insertion in model container [2023-12-21 16:56:02,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,493 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 16:56:02,619 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-industry-pattern/array_of_struct_ptr_flag_init.i[959,972] [2023-12-21 16:56:02,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 16:56:02,652 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-21 16:56:02,655 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 16:56:02,666 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-industry-pattern/array_of_struct_ptr_flag_init.i[959,972] [2023-12-21 16:56:02,681 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 16:56:02,682 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 16:56:02,693 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-industry-pattern/array_of_struct_ptr_flag_init.i[959,972] [2023-12-21 16:56:02,708 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 16:56:02,722 INFO L206 MainTranslator]: Completed translation [2023-12-21 16:56:02,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02 WrapperNode [2023-12-21 16:56:02,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 16:56:02,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 16:56:02,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 16:56:02,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 16:56:02,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,761 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2023-12-21 16:56:02,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 16:56:02,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 16:56:02,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 16:56:02,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 16:56:02,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,794 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2023-12-21 16:56:02,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 16:56:02,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 16:56:02,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 16:56:02,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 16:56:02,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (1/1) ... [2023-12-21 16:56:02,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 16:56:02,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 16:56:02,838 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 16:56:02,865 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 16:56:02,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 16:56:02,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 16:56:02,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 16:56:02,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 16:56:02,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 16:56:02,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 16:56:02,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 16:56:02,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 16:56:02,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 16:56:02,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 16:56:02,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 16:56:02,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 16:56:02,951 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 16:56:02,952 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 16:56:03,107 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 16:56:03,141 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 16:56:03,141 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 16:56:03,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 04:56:03 BoogieIcfgContainer [2023-12-21 16:56:03,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 16:56:03,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 16:56:03,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 16:56:03,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 16:56:03,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 04:56:02" (1/3) ... [2023-12-21 16:56:03,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 04:56:03, skipping insertion in model container [2023-12-21 16:56:03,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:56:02" (2/3) ... [2023-12-21 16:56:03,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 04:56:03, skipping insertion in model container [2023-12-21 16:56:03,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 04:56:03" (3/3) ... [2023-12-21 16:56:03,151 INFO L112 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2023-12-21 16:56:03,163 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 16:56:03,163 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 16:56:03,201 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 16:56:03,206 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;@493d668c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 16:56:03,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 16:56:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 16:56:03,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:56:03,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:56:03,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:56:03,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:56:03,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1186875476, now seen corresponding path program 1 times [2023-12-21 16:56:03,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:56:03,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574424117] [2023-12-21 16:56:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 16:56:03,231 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 16:56:03,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:56:03,268 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 16:56:03,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 16:56:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 16:56:03,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 16:56:03,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:56:03,354 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 16:56:03,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 16:56:03,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:56:03,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574424117] [2023-12-21 16:56:03,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574424117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 16:56:03,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 16:56:03,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 16:56:03,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422596961] [2023-12-21 16:56:03,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 16:56:03,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 16:56:03,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:56:03,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 16:56:03,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 16:56:03,384 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:56:03,409 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2023-12-21 16:56:03,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 16:56:03,411 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-21 16:56:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:56:03,416 INFO L225 Difference]: With dead ends: 30 [2023-12-21 16:56:03,416 INFO L226 Difference]: Without dead ends: 14 [2023-12-21 16:56:03,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 16:56:03,421 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 16:56:03,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 16:56:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-21 16:56:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-21 16:56:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2023-12-21 16:56:03,442 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 9 [2023-12-21 16:56:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:56:03,443 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2023-12-21 16:56:03,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2023-12-21 16:56:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 16:56:03,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:56:03,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:56:03,451 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 16:56:03,647 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 16:56:03,648 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:56:03,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:56:03,648 INFO L85 PathProgramCache]: Analyzing trace with hash 871954815, now seen corresponding path program 1 times [2023-12-21 16:56:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:56:03,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299391155] [2023-12-21 16:56:03,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 16:56:03,651 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 16:56:03,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:56:03,662 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 16:56:03,678 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 16:56:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 16:56:03,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 16:56:03,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:56:03,743 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 16:56:03,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 16:56:03,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:56:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299391155] [2023-12-21 16:56:03,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299391155] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 16:56:03,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 16:56:03,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 16:56:03,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406519495] [2023-12-21 16:56:03,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 16:56:03,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 16:56:03,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:56:03,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 16:56:03,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 16:56:03,745 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:56:03,780 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2023-12-21 16:56:03,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 16:56:03,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-21 16:56:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:56:03,781 INFO L225 Difference]: With dead ends: 27 [2023-12-21 16:56:03,781 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 16:56:03,781 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 16:56:03,782 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 16:56:03,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 16:56:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 16:56:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 16:56:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2023-12-21 16:56:03,785 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 9 [2023-12-21 16:56:03,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:56:03,785 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-12-21 16:56:03,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2023-12-21 16:56:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 16:56:03,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:56:03,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:56:03,793 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 16:56:03,992 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 16:56:03,993 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:56:03,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:56:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2015382425, now seen corresponding path program 1 times [2023-12-21 16:56:03,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:56:03,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111779401] [2023-12-21 16:56:03,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 16:56:03,994 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 16:56:03,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:56:03,998 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 16:56:04,014 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 16:56:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 16:56:04,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 16:56:04,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:56:04,101 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 16:56:04,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:56:04,135 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 16:56:04,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:56:04,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111779401] [2023-12-21 16:56:04,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111779401] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:56:04,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:56:04,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-21 16:56:04,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542224045] [2023-12-21 16:56:04,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:56:04,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 16:56:04,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:56:04,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 16:56:04,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 16:56:04,136 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:56:04,189 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2023-12-21 16:56:04,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 16:56:04,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-21 16:56:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:56:04,191 INFO L225 Difference]: With dead ends: 30 [2023-12-21 16:56:04,191 INFO L226 Difference]: Without dead ends: 18 [2023-12-21 16:56:04,191 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 16:56:04,192 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 16:56:04,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 16:56:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-21 16:56:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-21 16:56:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-12-21 16:56:04,196 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-12-21 16:56:04,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:56:04,196 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-12-21 16:56:04,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-12-21 16:56:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 16:56:04,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:56:04,197 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:56:04,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 16:56:04,399 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 16:56:04,400 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:56:04,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:56:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1404456961, now seen corresponding path program 2 times [2023-12-21 16:56:04,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:56:04,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753876851] [2023-12-21 16:56:04,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 16:56:04,401 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 16:56:04,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:56:04,403 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 16:56:04,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 16:56:04,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 16:56:04,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:56:04,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 16:56:04,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:56:04,490 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 16:56:04,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 16:56:04,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:56:04,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753876851] [2023-12-21 16:56:04,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753876851] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 16:56:04,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 16:56:04,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 16:56:04,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130650042] [2023-12-21 16:56:04,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 16:56:04,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 16:56:04,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:56:04,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 16:56:04,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 16:56:04,492 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:56:04,514 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-12-21 16:56:04,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 16:56:04,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-21 16:56:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:56:04,515 INFO L225 Difference]: With dead ends: 36 [2023-12-21 16:56:04,515 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 16:56:04,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 16:56:04,516 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 16:56:04,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 16:56:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 16:56:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2023-12-21 16:56:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-21 16:56:04,520 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2023-12-21 16:56:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:56:04,520 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-21 16:56:04,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-21 16:56:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 16:56:04,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:56:04,520 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:56:04,531 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 16:56:04,722 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 16:56:04,723 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:56:04,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:56:04,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1743780991, now seen corresponding path program 1 times [2023-12-21 16:56:04,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:56:04,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671279423] [2023-12-21 16:56:04,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 16:56:04,724 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 16:56:04,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:56:04,725 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 16:56:04,744 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 16:56:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 16:56:04,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 16:56:04,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:56:04,878 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 16:56:04,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:56:05,020 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 16:56:05,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:56:05,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671279423] [2023-12-21 16:56:05,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671279423] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:56:05,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:56:05,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-21 16:56:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521986956] [2023-12-21 16:56:05,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:56:05,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 16:56:05,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:56:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 16:56:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-21 16:56:05,023 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:56:05,280 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2023-12-21 16:56:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 16:56:05,280 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-21 16:56:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:56:05,281 INFO L225 Difference]: With dead ends: 38 [2023-12-21 16:56:05,281 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 16:56:05,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-21 16:56:05,282 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 16:56:05,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 16:56:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 16:56:05,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-21 16:56:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-21 16:56:05,286 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2023-12-21 16:56:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:56:05,286 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-21 16:56:05,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-21 16:56:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 16:56:05,287 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:56:05,287 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:56:05,292 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 16:56:05,492 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 16:56:05,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:56:05,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:56:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1144770111, now seen corresponding path program 2 times [2023-12-21 16:56:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:56:05,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362744607] [2023-12-21 16:56:05,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 16:56:05,493 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 16:56:05,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:56:05,494 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 16:56:05,495 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 16:56:05,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 16:56:05,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:56:05,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 16:56:05,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:56:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 16:56:05,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:56:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 16:56:06,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:56:06,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362744607] [2023-12-21 16:56:06,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362744607] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:56:06,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:56:06,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-21 16:56:06,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621257317] [2023-12-21 16:56:06,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:56:06,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 16:56:06,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:56:06,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 16:56:06,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-21 16:56:06,218 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:56:07,819 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2023-12-21 16:56:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 16:56:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-21 16:56:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:56:07,821 INFO L225 Difference]: With dead ends: 50 [2023-12-21 16:56:07,821 INFO L226 Difference]: Without dead ends: 37 [2023-12-21 16:56:07,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 16:56:07,822 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 16:56:07,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 16:56:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-21 16:56:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-21 16:56:07,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-12-21 16:56:07,829 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 22 [2023-12-21 16:56:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:56:07,829 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-12-21 16:56:07,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-12-21 16:56:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 16:56:07,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:56:07,830 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:56:07,838 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 16:56:08,036 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 16:56:08,036 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:56:08,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:56:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1112374849, now seen corresponding path program 3 times [2023-12-21 16:56:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:56:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614070389] [2023-12-21 16:56:08,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 16:56:08,037 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 16:56:08,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:56:08,038 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 16:56:08,040 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 16:56:08,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 16:56:08,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:56:08,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 16:56:08,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:56:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-21 16:56:08,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 16:56:08,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:56:08,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614070389] [2023-12-21 16:56:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614070389] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 16:56:08,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 16:56:08,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 16:56:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592271040] [2023-12-21 16:56:08,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 16:56:08,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 16:56:08,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:56:08,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 16:56:08,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 16:56:08,157 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:56:08,175 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2023-12-21 16:56:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 16:56:08,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-21 16:56:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:56:08,176 INFO L225 Difference]: With dead ends: 51 [2023-12-21 16:56:08,176 INFO L226 Difference]: Without dead ends: 37 [2023-12-21 16:56:08,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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 16:56:08,178 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 16:56:08,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 31 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 16:56:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-21 16:56:08,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-21 16:56:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2023-12-21 16:56:08,191 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2023-12-21 16:56:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:56:08,191 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2023-12-21 16:56:08,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2023-12-21 16:56:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 16:56:08,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:56:08,192 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:56:08,199 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 16:56:08,395 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 16:56:08,395 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:56:08,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:56:08,397 INFO L85 PathProgramCache]: Analyzing trace with hash 303028223, now seen corresponding path program 1 times [2023-12-21 16:56:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:56:08,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124925778] [2023-12-21 16:56:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 16:56:08,401 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 16:56:08,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:56:08,402 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 16:56:08,433 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 16:56:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 16:56:08,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-21 16:56:08,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:56:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 16:56:08,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:56:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 16:56:10,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:56:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124925778] [2023-12-21 16:56:10,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124925778] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:56:10,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:56:10,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-12-21 16:56:10,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952018314] [2023-12-21 16:56:10,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:56:10,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 16:56:10,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:56:10,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 16:56:10,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 16:56:10,746 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 48 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:56:22,945 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2023-12-21 16:56:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-21 16:56:22,946 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-21 16:56:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:56:22,946 INFO L225 Difference]: With dead ends: 74 [2023-12-21 16:56:22,946 INFO L226 Difference]: Without dead ends: 61 [2023-12-21 16:56:22,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 16:56:22,948 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 16:56:22,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 16:56:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-21 16:56:22,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-21 16:56:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2023-12-21 16:56:22,964 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 34 [2023-12-21 16:56:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:56:22,964 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2023-12-21 16:56:22,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:56:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2023-12-21 16:56:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 16:56:22,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:56:22,965 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:56:22,973 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 16:56:23,170 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 16:56:23,170 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:56:23,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:56:23,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1695953151, now seen corresponding path program 2 times [2023-12-21 16:56:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:56:23,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270298118] [2023-12-21 16:56:23,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 16:56:23,171 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 16:56:23,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:56:23,174 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 16:56:23,175 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 16:56:23,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 16:56:23,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:56:23,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-21 16:56:23,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:56:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 16:56:24,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:56:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 16:56:31,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:56:31,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270298118] [2023-12-21 16:56:31,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270298118] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:56:31,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:56:31,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2023-12-21 16:56:31,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412400891] [2023-12-21 16:56:31,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:56:31,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-12-21 16:56:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:56:31,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-12-21 16:56:31,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2023-12-21 16:56:31,396 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 96 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:58:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:58:03,621 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2023-12-21 16:58:03,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-12-21 16:58:03,622 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-21 16:58:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:58:03,622 INFO L225 Difference]: With dead ends: 122 [2023-12-21 16:58:03,622 INFO L226 Difference]: Without dead ends: 109 [2023-12-21 16:58:03,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 97.3s TimeCoverageRelationStatistics Valid=6814, Invalid=13208, Unknown=0, NotChecked=0, Total=20022 [2023-12-21 16:58:03,626 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 2403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-21 16:58:03,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 2403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-21 16:58:03,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-21 16:58:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-21 16:58:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:58:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2023-12-21 16:58:03,649 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 58 [2023-12-21 16:58:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:58:03,650 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2023-12-21 16:58:03,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:58:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2023-12-21 16:58:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-21 16:58:03,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:58:03,651 INFO L195 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:58:03,658 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 16:58:03,858 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 16:58:03,859 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:58:03,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:58:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash 376562431, now seen corresponding path program 3 times [2023-12-21 16:58:03,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:58:03,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40318972] [2023-12-21 16:58:03,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 16:58:03,860 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 16:58:03,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:58:03,861 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 16:58:03,892 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 16:58:04,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 16:58:04,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:58:04,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 16:58:04,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:58:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4466 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2023-12-21 16:58:04,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:58:04,847 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-12-21 16:58:04,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2023-12-21 16:58:04,859 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 16:58:04,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2023-12-21 16:58:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4466 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2023-12-21 16:58:04,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:58:04,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40318972] [2023-12-21 16:58:04,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40318972] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:58:04,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:58:04,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-21 16:58:04,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515513595] [2023-12-21 16:58:04,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:58:04,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 16:58:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:58:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 16:58:04,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-21 16:58:04,880 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:58:05,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:58:05,015 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2023-12-21 16:58:05,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 16:58:05,015 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2023-12-21 16:58:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:58:05,016 INFO L225 Difference]: With dead ends: 118 [2023-12-21 16:58:05,016 INFO L226 Difference]: Without dead ends: 116 [2023-12-21 16:58:05,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-21 16:58:05,016 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 16:58:05,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 42 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 16:58:05,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-21 16:58:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2023-12-21 16:58:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:58:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2023-12-21 16:58:05,045 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 106 [2023-12-21 16:58:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:58:05,046 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2023-12-21 16:58:05,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:58:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2023-12-21 16:58:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-21 16:58:05,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:58:05,050 INFO L195 NwaCegarLoop]: trace histogram [94, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:58:05,055 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 16:58:05,253 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 16:58:05,253 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:58:05,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:58:05,254 INFO L85 PathProgramCache]: Analyzing trace with hash 70320760, now seen corresponding path program 1 times [2023-12-21 16:58:05,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:58:05,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245491990] [2023-12-21 16:58:05,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 16:58:05,254 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 16:58:05,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:58:05,255 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 16:58:05,257 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 16:58:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 16:58:05,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 1739 conjuncts, 98 conjunts are in the unsatisfiable core [2023-12-21 16:58:05,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:58:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4468 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 16:58:09,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:58:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4468 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 16:58:36,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:58:36,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245491990] [2023-12-21 16:58:36,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245491990] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:58:36,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:58:36,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 191 [2023-12-21 16:58:36,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179555535] [2023-12-21 16:58:36,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:58:36,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2023-12-21 16:58:36,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:58:36,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2023-12-21 16:58:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9406, Invalid=27266, Unknown=0, NotChecked=0, Total=36672 [2023-12-21 16:58:36,661 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 192 states, 192 states have (on average 1.0625) internal successors, (204), 191 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:59:06,570 WARN L293 SmtUtils]: Spent 17.92s on a formula simplification that was a NOOP. DAG size: 286 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 16:59:28,734 WARN L293 SmtUtils]: Spent 17.28s on a formula simplification that was a NOOP. DAG size: 283 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 16:59:50,118 WARN L293 SmtUtils]: Spent 16.62s on a formula simplification that was a NOOP. DAG size: 280 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:00:11,594 WARN L293 SmtUtils]: Spent 16.66s on a formula simplification that was a NOOP. DAG size: 277 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:00:35,143 WARN L293 SmtUtils]: Spent 18.51s on a formula simplification that was a NOOP. DAG size: 274 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:00:55,358 WARN L293 SmtUtils]: Spent 15.32s on a formula simplification that was a NOOP. DAG size: 271 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:01:18,728 WARN L293 SmtUtils]: Spent 18.37s on a formula simplification that was a NOOP. DAG size: 268 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:01:42,433 WARN L293 SmtUtils]: Spent 18.02s on a formula simplification that was a NOOP. DAG size: 265 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:02:05,903 WARN L293 SmtUtils]: Spent 17.81s on a formula simplification that was a NOOP. DAG size: 262 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:02:27,573 WARN L293 SmtUtils]: Spent 16.32s on a formula simplification that was a NOOP. DAG size: 259 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:02:47,139 WARN L293 SmtUtils]: Spent 14.32s on a formula simplification that was a NOOP. DAG size: 256 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:03:07,298 WARN L293 SmtUtils]: Spent 15.09s on a formula simplification that was a NOOP. DAG size: 253 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:03:27,306 WARN L293 SmtUtils]: Spent 14.82s on a formula simplification that was a NOOP. DAG size: 250 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:03:46,663 WARN L293 SmtUtils]: Spent 14.37s on a formula simplification that was a NOOP. DAG size: 247 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:04:04,560 WARN L293 SmtUtils]: Spent 13.01s on a formula simplification that was a NOOP. DAG size: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:04:21,574 WARN L293 SmtUtils]: Spent 11.86s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:04:39,960 WARN L293 SmtUtils]: Spent 12.92s on a formula simplification that was a NOOP. DAG size: 238 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:04:58,580 WARN L293 SmtUtils]: Spent 13.29s on a formula simplification that was a NOOP. DAG size: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:05:17,199 WARN L293 SmtUtils]: Spent 13.21s on a formula simplification that was a NOOP. DAG size: 232 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:05:35,257 WARN L293 SmtUtils]: Spent 12.75s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:05:52,220 WARN L293 SmtUtils]: Spent 11.52s on a formula simplification that was a NOOP. DAG size: 226 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:06:09,786 WARN L293 SmtUtils]: Spent 12.24s on a formula simplification that was a NOOP. DAG size: 223 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:06:26,136 WARN L293 SmtUtils]: Spent 11.00s on a formula simplification that was a NOOP. DAG size: 220 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:06:40,747 WARN L293 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 217 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:06:55,078 WARN L293 SmtUtils]: Spent 9.62s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:07:10,270 WARN L293 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 211 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:07:25,520 WARN L293 SmtUtils]: Spent 9.89s on a formula simplification that was a NOOP. DAG size: 208 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:07:39,728 WARN L293 SmtUtils]: Spent 9.47s on a formula simplification that was a NOOP. DAG size: 205 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:07:54,883 WARN L293 SmtUtils]: Spent 9.92s on a formula simplification that was a NOOP. DAG size: 202 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:08:08,998 WARN L293 SmtUtils]: Spent 8.87s on a formula simplification that was a NOOP. DAG size: 199 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:08:23,109 WARN L293 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 196 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:08:37,516 WARN L293 SmtUtils]: Spent 9.30s on a formula simplification that was a NOOP. DAG size: 193 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:08:51,601 WARN L293 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:09:05,089 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 187 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:09:17,921 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 184 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:09:29,821 WARN L293 SmtUtils]: Spent 7.05s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:09:41,494 WARN L293 SmtUtils]: Spent 7.33s on a formula simplification that was a NOOP. DAG size: 178 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:09:53,098 WARN L293 SmtUtils]: Spent 6.95s on a formula simplification that was a NOOP. DAG size: 175 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:10:04,968 WARN L293 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 172 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:10:17,011 WARN L293 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 169 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:10:29,097 WARN L293 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:10:39,753 WARN L293 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-21 17:10:45,625 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 17:10:45,625 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 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 17:10:46,639 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 (12)] Ended with exit code 0 [2023-12-21 17:10:46,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2023-12-21 17:10:46,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 743.7s TimeCoverageRelationStatistics Valid=17470, Invalid=37052, Unknown=0, NotChecked=0, Total=54522 [2023-12-21 17:10:46,649 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:10:46,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 9164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9163 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2023-12-21 17:10:46,650 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 17:10:46,651 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (112states) and FLOYD_HOARE automaton (currently 139 states, 192 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-21 17:10:46,654 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1] [2023-12-21 17:10:46,658 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 17:10:46,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 05:10:46 BoogieIcfgContainer [2023-12-21 17:10:46,660 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 17:10:46,660 INFO L158 Benchmark]: Toolchain (without parser) took 884187.86ms. Allocated memory is still 218.1MB. Free memory was 173.8MB in the beginning and 153.9MB in the end (delta: 19.9MB). Peak memory consumption was 134.0MB. Max. memory is 8.0GB. [2023-12-21 17:10:46,660 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 17:10:46,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.03ms. Allocated memory is still 218.1MB. Free memory was 173.6MB in the beginning and 161.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 17:10:46,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.29ms. Allocated memory is still 218.1MB. Free memory was 161.0MB in the beginning and 159.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 17:10:46,677 INFO L158 Benchmark]: Boogie Preprocessor took 54.34ms. Allocated memory is still 218.1MB. Free memory was 159.2MB in the beginning and 157.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 17:10:46,677 INFO L158 Benchmark]: RCFGBuilder took 325.00ms. Allocated memory is still 218.1MB. Free memory was 157.2MB in the beginning and 143.2MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-21 17:10:46,677 INFO L158 Benchmark]: TraceAbstraction took 883516.54ms. Allocated memory is still 218.1MB. Free memory was 142.5MB in the beginning and 153.9MB in the end (delta: -11.4MB). Peak memory consumption was 102.5MB. Max. memory is 8.0GB. [2023-12-21 17:10:46,680 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.13ms. Allocated memory is still 181.4MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.03ms. Allocated memory is still 218.1MB. Free memory was 173.6MB in the beginning and 161.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.29ms. Allocated memory is still 218.1MB. Free memory was 161.0MB in the beginning and 159.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.34ms. Allocated memory is still 218.1MB. Free memory was 159.2MB in the beginning and 157.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 325.00ms. Allocated memory is still 218.1MB. Free memory was 157.2MB in the beginning and 143.2MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 883516.54ms. Allocated memory is still 218.1MB. Free memory was 142.5MB in the beginning and 153.9MB in the end (delta: -11.4MB). Peak memory consumption was 102.5MB. 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: 15]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15). Cancelled while NwaCegarLoop was constructing difference of abstraction (112states) and FLOYD_HOARE automaton (currently 139 states, 192 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 883.5s, OverallIterations: 11, TraceHistogramMax: 94, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 836.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 1488 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1339 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12509 IncrementalHoareTripleChecker+Invalid, 12519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 149 mSDtfsCounter, 12509 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 886 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2236 ImplicationChecksByTransitivity, 857.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=10, InterpolantAutomatonStates: 205, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 42.7s InterpolantComputationTime, 420 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 757 ConstructedInterpolants, 0 QuantifiedInterpolants, 2803 SizeOfPredicates, 22 NumberOfNonLiveVariables, 3721 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 9208/20940 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