/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/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 22:07:36,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 22:07:36,958 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-24 22:07:36,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 22:07:36,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 22:07:36,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 22:07:36,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 22:07:36,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 22:07:36,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 22:07:36,995 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 22:07:36,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 22:07:36,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 22:07:36,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 22:07:36,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 22:07:36,997 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 22:07:36,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 22:07:36,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 22:07:36,998 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 22:07:36,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 22:07:36,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 22:07:36,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 22:07:36,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 22:07:36,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 22:07:36,999 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 22:07:36,999 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 22:07:37,000 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 22:07:37,000 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 22:07:37,000 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 22:07:37,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 22:07:37,001 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 22:07:37,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 22:07:37,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 22:07:37,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 22:07:37,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 22:07:37,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:07:37,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 22:07:37,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 22:07:37,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 22:07:37,002 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 22:07:37,002 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 22:07:37,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 22:07:37,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 22:07:37,003 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 22:07:37,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 22:07:37,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 22:07:37,003 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 22:07:37,004 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-24 22:07:37,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 22:07:37,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 22:07:37,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 22:07:37,209 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 22:07:37,209 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 22:07:37,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2023-12-24 22:07:38,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 22:07:38,420 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 22:07:38,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2023-12-24 22:07:38,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7397f8e9f/39ed9287c5ee4642a89cb88dc427d6a5/FLAGa88755576 [2023-12-24 22:07:38,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7397f8e9f/39ed9287c5ee4642a89cb88dc427d6a5 [2023-12-24 22:07:38,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 22:07:38,443 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 22:07:38,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 22:07:38,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 22:07:38,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 22:07:38,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4894c506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38, skipping insertion in model container [2023-12-24 22:07:38,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,466 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 22:07:38,600 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[383,396] [2023-12-24 22:07:38,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:07:38,629 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 22:07:38,637 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[383,396] [2023-12-24 22:07:38,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:07:38,651 INFO L206 MainTranslator]: Completed translation [2023-12-24 22:07:38,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38 WrapperNode [2023-12-24 22:07:38,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 22:07:38,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 22:07:38,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 22:07:38,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 22:07:38,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,678 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 56 [2023-12-24 22:07:38,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 22:07:38,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 22:07:38,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 22:07:38,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 22:07:38,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,699 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 2 writes are split as follows [0, 2]. [2023-12-24 22:07:38,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 22:07:38,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 22:07:38,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 22:07:38,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 22:07:38,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (1/1) ... [2023-12-24 22:07:38,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:07:38,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 22:07:38,734 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-24 22:07:38,752 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-24 22:07:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 22:07:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 22:07:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 22:07:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 22:07:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 22:07:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 22:07:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 22:07:38,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 22:07:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 22:07:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 22:07:38,818 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 22:07:38,819 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 22:07:38,952 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 22:07:38,978 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 22:07:38,978 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 22:07:38,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:07:38 BoogieIcfgContainer [2023-12-24 22:07:38,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 22:07:38,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 22:07:38,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 22:07:38,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 22:07:38,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 10:07:38" (1/3) ... [2023-12-24 22:07:38,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b476ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:07:38, skipping insertion in model container [2023-12-24 22:07:38,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:38" (2/3) ... [2023-12-24 22:07:38,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b476ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:07:38, skipping insertion in model container [2023-12-24 22:07:38,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:07:38" (3/3) ... [2023-12-24 22:07:38,993 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search.c [2023-12-24 22:07:39,005 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 22:07:39,005 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 22:07:39,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 22:07:39,055 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;@50017fe7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 22:07:39,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 22:07:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 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-24 22:07:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-24 22:07:39,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:39,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:39,063 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:39,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1564981187, now seen corresponding path program 1 times [2023-12-24 22:07:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:39,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412415794] [2023-12-24 22:07:39,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:39,074 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-24 22:07:39,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:39,076 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-24 22:07:39,076 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-24 22:07:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:39,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 22:07:39,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:39,176 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-24 22:07:39,176 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:07:39,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412415794] [2023-12-24 22:07:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412415794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:07:39,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:07:39,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 22:07:39,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836638640] [2023-12-24 22:07:39,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:07:39,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 22:07:39,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:39,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 22:07:39,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 22:07:39,219 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-24 22:07:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:39,237 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2023-12-24 22:07:39,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 22:07:39,239 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2023-12-24 22:07:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:39,243 INFO L225 Difference]: With dead ends: 22 [2023-12-24 22:07:39,243 INFO L226 Difference]: Without dead ends: 11 [2023-12-24 22:07:39,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-24 22:07:39,247 INFO L413 NwaCegarLoop]: 15 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, 15 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-24 22:07:39,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-24 22:07:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-24 22:07:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2023-12-24 22:07:39,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 7 [2023-12-24 22:07:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:39,267 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2023-12-24 22:07:39,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-24 22:07:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2023-12-24 22:07:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 22:07:39,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:39,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:39,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 22:07:39,469 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-24 22:07:39,470 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:39,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash 493506260, now seen corresponding path program 1 times [2023-12-24 22:07:39,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:39,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511364378] [2023-12-24 22:07:39,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:39,471 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-24 22:07:39,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:39,472 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-24 22:07:39,504 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-24 22:07:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:39,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:07:39,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:39,571 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-24 22:07:39,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:07:39,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511364378] [2023-12-24 22:07:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511364378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:07:39,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:07:39,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 22:07:39,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959009439] [2023-12-24 22:07:39,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:07:39,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 22:07:39,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:39,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 22:07:39,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 22:07:39,576 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-24 22:07:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:39,598 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-12-24 22:07:39,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 22:07:39,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-24 22:07:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:39,599 INFO L225 Difference]: With dead ends: 15 [2023-12-24 22:07:39,599 INFO L226 Difference]: Without dead ends: 11 [2023-12-24 22:07:39,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 22:07:39,600 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:39,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-24 22:07:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-24 22:07:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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-24 22:07:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-24 22:07:39,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2023-12-24 22:07:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:39,603 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-24 22:07:39,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-24 22:07:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-24 22:07:39,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 22:07:39,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:39,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:39,608 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-24 22:07:39,808 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-24 22:07:39,810 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:39,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:39,810 INFO L85 PathProgramCache]: Analyzing trace with hash 493565842, now seen corresponding path program 1 times [2023-12-24 22:07:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:39,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935997872] [2023-12-24 22:07:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:39,818 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-24 22:07:39,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:39,819 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-24 22:07:39,823 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-24 22:07:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:39,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:07:39,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:39,930 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-24 22:07:39,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:07:39,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935997872] [2023-12-24 22:07:39,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935997872] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:07:39,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:07:39,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 22:07:39,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151295762] [2023-12-24 22:07:39,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:07:39,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 22:07:39,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:39,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 22:07:39,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 22:07:39,932 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-24 22:07:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:39,973 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2023-12-24 22:07:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 22:07:39,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-24 22:07:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:39,975 INFO L225 Difference]: With dead ends: 19 [2023-12-24 22:07:39,975 INFO L226 Difference]: Without dead ends: 14 [2023-12-24 22:07:39,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 22:07:39,977 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:39,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 12 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-24 22:07:39,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-24 22:07:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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-24 22:07:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2023-12-24 22:07:39,988 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2023-12-24 22:07:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:39,988 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2023-12-24 22:07:39,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-24 22:07:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2023-12-24 22:07:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-24 22:07:39,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:39,989 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:39,993 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-24 22:07:40,192 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-24 22:07:40,192 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:40,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:40,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1891169386, now seen corresponding path program 1 times [2023-12-24 22:07:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268645165] [2023-12-24 22:07:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:40,193 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-24 22:07:40,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:40,194 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-24 22:07:40,196 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-24 22:07:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:40,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 22:07:40,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:40,258 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:07:40,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:40,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268645165] [2023-12-24 22:07:40,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268645165] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:07:40,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:07:40,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 22:07:40,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034640670] [2023-12-24 22:07:40,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:07:40,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 22:07:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:40,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 22:07:40,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:07:40,260 INFO L87 Difference]: Start difference. First operand 14 states and 17 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-24 22:07:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:40,275 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2023-12-24 22:07:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 22:07:40,277 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 13 [2023-12-24 22:07:40,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:40,277 INFO L225 Difference]: With dead ends: 25 [2023-12-24 22:07:40,277 INFO L226 Difference]: Without dead ends: 15 [2023-12-24 22:07:40,277 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-24 22:07:40,278 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:40,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-24 22:07:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-24 22:07:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-24 22:07:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-12-24 22:07:40,280 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2023-12-24 22:07:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:40,281 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-12-24 22:07:40,281 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-24 22:07:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-12-24 22:07:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-24 22:07:40,281 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:40,281 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:40,288 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-24 22:07:40,485 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-24 22:07:40,486 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:40,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2010770900, now seen corresponding path program 1 times [2023-12-24 22:07:40,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:40,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600227202] [2023-12-24 22:07:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:40,487 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-24 22:07:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:40,488 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-24 22:07:40,489 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-24 22:07:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:40,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 22:07:40,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:40,561 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:07:40,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:40,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600227202] [2023-12-24 22:07:40,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600227202] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:07:40,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:07:40,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 22:07:40,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388818622] [2023-12-24 22:07:40,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:07:40,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 22:07:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:40,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 22:07:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 22:07:40,563 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-24 22:07:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:40,596 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2023-12-24 22:07:40,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 22:07:40,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 13 [2023-12-24 22:07:40,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:40,598 INFO L225 Difference]: With dead ends: 32 [2023-12-24 22:07:40,598 INFO L226 Difference]: Without dead ends: 22 [2023-12-24 22:07:40,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 22:07:40,600 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:40,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:40,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-24 22:07:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2023-12-24 22:07:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 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-24 22:07:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-12-24 22:07:40,608 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2023-12-24 22:07:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:40,608 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-12-24 22:07:40,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-24 22:07:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-12-24 22:07:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-24 22:07:40,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:40,609 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:40,613 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 (6)] Ended with exit code 0 [2023-12-24 22:07:40,811 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-24 22:07:40,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:40,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1474849770, now seen corresponding path program 1 times [2023-12-24 22:07:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:40,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071872295] [2023-12-24 22:07:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:40,812 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-24 22:07:40,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:40,813 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-24 22:07:40,814 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-24 22:07:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:40,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 22:07:40,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:40,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:40,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:40,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071872295] [2023-12-24 22:07:40,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071872295] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:40,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:40,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-24 22:07:40,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587561747] [2023-12-24 22:07:40,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:40,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 22:07:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:40,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 22:07:40,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-24 22:07:40,996 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-24 22:07:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:41,057 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-12-24 22:07:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 22:07:41,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) Word has length 13 [2023-12-24 22:07:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:41,058 INFO L225 Difference]: With dead ends: 25 [2023-12-24 22:07:41,058 INFO L226 Difference]: Without dead ends: 19 [2023-12-24 22:07:41,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-24 22:07:41,060 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:41,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 15 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-24 22:07:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-24 22:07:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-24 22:07:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-12-24 22:07:41,067 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2023-12-24 22:07:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:41,067 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-12-24 22:07:41,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-24 22:07:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-12-24 22:07:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 22:07:41,068 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:41,068 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:41,074 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-24 22:07:41,270 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-24 22:07:41,270 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:41,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash 499210884, now seen corresponding path program 1 times [2023-12-24 22:07:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:41,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116001643] [2023-12-24 22:07:41,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:41,271 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-24 22:07:41,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:41,272 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-24 22:07:41,280 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-24 22:07:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:41,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 22:07:41,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:41,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:41,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:41,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116001643] [2023-12-24 22:07:41,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116001643] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:41,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:41,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-24 22:07:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394990553] [2023-12-24 22:07:41,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:41,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 22:07:41,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:41,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 22:07:41,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 22:07:41,366 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-24 22:07:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:41,455 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2023-12-24 22:07:41,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 22:07:41,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-24 22:07:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:41,458 INFO L225 Difference]: With dead ends: 51 [2023-12-24 22:07:41,458 INFO L226 Difference]: Without dead ends: 41 [2023-12-24 22:07:41,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-24 22:07:41,458 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 40 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:41,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 26 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:07:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-24 22:07:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2023-12-24 22:07:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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-24 22:07:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-12-24 22:07:41,468 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2023-12-24 22:07:41,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:41,468 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-12-24 22:07:41,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-24 22:07:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-12-24 22:07:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 22:07:41,469 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:41,469 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:41,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 22:07:41,671 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-24 22:07:41,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:41,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash -310135742, now seen corresponding path program 2 times [2023-12-24 22:07:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:41,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616853731] [2023-12-24 22:07:41,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:07:41,674 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-24 22:07:41,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:41,675 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-24 22:07:41,676 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-24 22:07:41,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:07:41,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:41,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 22:07:41,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:41,825 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-24 22:07:41,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 72 [2023-12-24 22:07:41,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:07:41,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:07:41,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-12-24 22:07:41,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2023-12-24 22:07:42,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:42,061 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 33 treesize of output 29 [2023-12-24 22:07:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:42,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:42,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-24 22:07:42,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:07:42,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:07:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:42,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:42,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616853731] [2023-12-24 22:07:42,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616853731] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:42,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:42,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 22:07:42,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354627480] [2023-12-24 22:07:42,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:42,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 22:07:42,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:42,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 22:07:42,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-24 22:07:42,323 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:42,554 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2023-12-24 22:07:42,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 22:07:42,554 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-24 22:07:42,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:42,555 INFO L225 Difference]: With dead ends: 43 [2023-12-24 22:07:42,555 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 22:07:42,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2023-12-24 22:07:42,555 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:42,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 23 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:07:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 22:07:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-24 22:07:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 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-24 22:07:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-12-24 22:07:42,559 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2023-12-24 22:07:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:42,559 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-12-24 22:07:42,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-12-24 22:07:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 22:07:42,560 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:42,560 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:42,564 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-24 22:07:42,762 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-24 22:07:42,763 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:42,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 980189426, now seen corresponding path program 3 times [2023-12-24 22:07:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:42,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712831636] [2023-12-24 22:07:42,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:07:42,763 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-24 22:07:42,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:42,764 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-24 22:07:42,765 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-24 22:07:42,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-24 22:07:42,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:42,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-24 22:07:42,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:42,867 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-24 22:07:42,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 72 [2023-12-24 22:07:42,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:07:42,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:07:42,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2023-12-24 22:07:42,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-24 22:07:43,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:43,313 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 33 treesize of output 29 [2023-12-24 22:07:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:43,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:44,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-24 22:07:44,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:07:44,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:07:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:44,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:44,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712831636] [2023-12-24 22:07:44,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712831636] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:44,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:44,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2023-12-24 22:07:44,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966318657] [2023-12-24 22:07:44,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:44,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 22:07:44,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:44,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 22:07:44,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2023-12-24 22:07:44,528 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 24 states have internal predecessors, (47), 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-24 22:07:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:46,401 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2023-12-24 22:07:46,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-24 22:07:46,401 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 24 states have internal predecessors, (47), 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 25 [2023-12-24 22:07:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:46,402 INFO L225 Difference]: With dead ends: 66 [2023-12-24 22:07:46,402 INFO L226 Difference]: Without dead ends: 55 [2023-12-24 22:07:46,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=465, Invalid=1887, Unknown=0, NotChecked=0, Total=2352 [2023-12-24 22:07:46,403 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:46,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 35 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 22:07:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-24 22:07:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2023-12-24 22:07:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 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-24 22:07:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-12-24 22:07:46,408 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2023-12-24 22:07:46,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:46,408 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-12-24 22:07:46,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 24 states have internal predecessors, (47), 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-24 22:07:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-12-24 22:07:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-24 22:07:46,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:46,408 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:46,413 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-24 22:07:46,611 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-24 22:07:46,611 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:46,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:46,611 INFO L85 PathProgramCache]: Analyzing trace with hash -955038748, now seen corresponding path program 2 times [2023-12-24 22:07:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:46,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042406902] [2023-12-24 22:07:46,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:07:46,612 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-24 22:07:46,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:46,613 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-24 22:07:46,619 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-24 22:07:46,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:07:46,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:46,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 22:07:46,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:46,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:46,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042406902] [2023-12-24 22:07:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042406902] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:46,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:46,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-24 22:07:46,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360141285] [2023-12-24 22:07:46,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:46,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 22:07:46,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:46,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 22:07:46,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-12-24 22:07:46,785 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 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-24 22:07:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:47,053 INFO L93 Difference]: Finished difference Result 115 states and 147 transitions. [2023-12-24 22:07:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 22:07:47,054 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 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 33 [2023-12-24 22:07:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:47,054 INFO L225 Difference]: With dead ends: 115 [2023-12-24 22:07:47,055 INFO L226 Difference]: Without dead ends: 95 [2023-12-24 22:07:47,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2023-12-24 22:07:47,055 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 137 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:47,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 48 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 22:07:47,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-24 22:07:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2023-12-24 22:07:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 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-24 22:07:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2023-12-24 22:07:47,062 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 33 [2023-12-24 22:07:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:47,062 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2023-12-24 22:07:47,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 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-24 22:07:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2023-12-24 22:07:47,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-24 22:07:47,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:47,062 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:47,067 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-24 22:07:47,265 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-24 22:07:47,265 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:47,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1764385374, now seen corresponding path program 4 times [2023-12-24 22:07:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:47,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601375603] [2023-12-24 22:07:47,266 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 22:07:47,266 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-24 22:07:47,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:47,267 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-24 22:07:47,267 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-24 22:07:47,311 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 22:07:47,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:47,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-24 22:07:47,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:47,370 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-24 22:07:47,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 72 [2023-12-24 22:07:47,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:07:47,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:07:48,489 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-24 22:07:48,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:48,807 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 33 treesize of output 29 [2023-12-24 22:07:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:49,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:50,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-24 22:07:50,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:07:50,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:07:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:50,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:50,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601375603] [2023-12-24 22:07:50,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601375603] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:50,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:50,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-12-24 22:07:50,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192609903] [2023-12-24 22:07:50,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:50,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-24 22:07:50,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:50,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-24 22:07:50,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2023-12-24 22:07:50,243 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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-24 22:07:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:52,088 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2023-12-24 22:07:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-24 22:07:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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 33 [2023-12-24 22:07:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:52,089 INFO L225 Difference]: With dead ends: 89 [2023-12-24 22:07:52,089 INFO L226 Difference]: Without dead ends: 80 [2023-12-24 22:07:52,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=410, Invalid=2040, Unknown=0, NotChecked=0, Total=2450 [2023-12-24 22:07:52,090 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 88 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:52,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 74 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 22:07:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-24 22:07:52,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2023-12-24 22:07:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 74 states have internal predecessors, (89), 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-24 22:07:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2023-12-24 22:07:52,096 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 33 [2023-12-24 22:07:52,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:52,096 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2023-12-24 22:07:52,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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-24 22:07:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2023-12-24 22:07:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-24 22:07:52,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:52,097 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:52,100 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-24 22:07:52,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:52,300 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:52,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:52,300 INFO L85 PathProgramCache]: Analyzing trace with hash -445707694, now seen corresponding path program 5 times [2023-12-24 22:07:52,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:52,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402633236] [2023-12-24 22:07:52,300 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-24 22:07:52,301 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-24 22:07:52,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:52,302 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:07:52,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 22:07:52,357 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-12-24 22:07:52,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:52,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-24 22:07:52,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:52,427 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-24 22:07:52,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 72 [2023-12-24 22:07:52,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:07:52,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:07:52,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-12-24 22:07:52,465 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-24 22:07:52,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-24 22:07:52,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:52,775 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 33 treesize of output 29 [2023-12-24 22:07:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 8 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:53,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:54,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-24 22:07:54,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:07:54,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:07:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 8 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:54,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:54,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402633236] [2023-12-24 22:07:54,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402633236] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:54,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:54,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-12-24 22:07:54,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245814485] [2023-12-24 22:07:54,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:54,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-24 22:07:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:54,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-24 22:07:54,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2023-12-24 22:07:54,854 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 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-24 22:07:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:58,366 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2023-12-24 22:07:58,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-24 22:07:58,367 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 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 41 [2023-12-24 22:07:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:58,367 INFO L225 Difference]: With dead ends: 103 [2023-12-24 22:07:58,367 INFO L226 Difference]: Without dead ends: 97 [2023-12-24 22:07:58,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=603, Invalid=4509, Unknown=0, NotChecked=0, Total=5112 [2023-12-24 22:07:58,369 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 133 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:58,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 78 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-24 22:07:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-24 22:07:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2023-12-24 22:07:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 81 states have internal predecessors, (96), 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-24 22:07:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2023-12-24 22:07:58,376 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 41 [2023-12-24 22:07:58,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:58,376 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2023-12-24 22:07:58,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 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-24 22:07:58,376 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2023-12-24 22:07:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-24 22:07:58,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:58,377 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:58,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 22:07:58,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:58,579 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:58,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:58,579 INFO L85 PathProgramCache]: Analyzing trace with hash -502965996, now seen corresponding path program 1 times [2023-12-24 22:07:58,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:58,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510766971] [2023-12-24 22:07:58,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:58,580 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-24 22:07:58,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:58,581 INFO L229 MonitoredProcess]: Starting monitored process 14 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-24 22:07:58,581 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 (14)] Waiting until timeout for monitored process [2023-12-24 22:07:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:58,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 22:07:58,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:59,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:08:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:08:02,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:08:02,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510766971] [2023-12-24 22:08:02,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510766971] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:08:02,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:08:02,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2023-12-24 22:08:02,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507184592] [2023-12-24 22:08:02,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:08:02,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-24 22:08:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:08:02,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-24 22:08:02,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2023-12-24 22:08:02,365 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 41 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 41 states have internal predecessors, (79), 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-24 22:08:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:08:28,861 INFO L93 Difference]: Finished difference Result 151 states and 181 transitions. [2023-12-24 22:08:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-12-24 22:08:28,862 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 41 states have internal predecessors, (79), 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 41 [2023-12-24 22:08:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:08:28,862 INFO L225 Difference]: With dead ends: 151 [2023-12-24 22:08:28,863 INFO L226 Difference]: Without dead ends: 136 [2023-12-24 22:08:28,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3999 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=2973, Invalid=9459, Unknown=0, NotChecked=0, Total=12432 [2023-12-24 22:08:28,865 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 495 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-24 22:08:28,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 57 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-12-24 22:08:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-24 22:08:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 107. [2023-12-24 22:08:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.169811320754717) internal successors, (124), 106 states have internal predecessors, (124), 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-24 22:08:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2023-12-24 22:08:28,874 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 41 [2023-12-24 22:08:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:08:28,874 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2023-12-24 22:08:28,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 41 states have internal predecessors, (79), 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-24 22:08:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2023-12-24 22:08:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-24 22:08:28,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:08:28,875 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:08:28,880 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 (14)] Forceful destruction successful, exit code 0 [2023-12-24 22:08:29,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-24 22:08:29,077 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:08:29,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:08:29,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1491650306, now seen corresponding path program 6 times [2023-12-24 22:08:29,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:08:29,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547678367] [2023-12-24 22:08:29,078 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-24 22:08:29,078 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-24 22:08:29,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:08:29,079 INFO L229 MonitoredProcess]: Starting monitored process 15 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-24 22:08:29,080 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 (15)] Waiting until timeout for monitored process [2023-12-24 22:08:29,167 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-12-24 22:08:29,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:08:29,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 22:08:29,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:08:29,227 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-24 22:08:29,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 72 [2023-12-24 22:08:29,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:08:29,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:08:29,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2023-12-24 22:08:29,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-24 22:08:29,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:08:29,978 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 33 treesize of output 29 [2023-12-24 22:08:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 10 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:08:30,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:08:33,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-24 22:08:33,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:08:33,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:08:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:08:33,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:08:33,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547678367] [2023-12-24 22:08:33,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547678367] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:08:33,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:08:33,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2023-12-24 22:08:33,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781573537] [2023-12-24 22:08:33,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:08:33,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-24 22:08:33,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:08:33,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-24 22:08:33,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2026, Unknown=0, NotChecked=0, Total=2256 [2023-12-24 22:08:33,648 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 48 states have internal predecessors, (95), 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-24 22:08:41,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:43,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:46,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:51,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:54,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:57,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:09:10,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:09:13,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:09:22,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:09:32,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:09:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:09:36,588 INFO L93 Difference]: Finished difference Result 189 states and 222 transitions. [2023-12-24 22:09:36,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-12-24 22:09:36,589 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 48 states have internal predecessors, (95), 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 49 [2023-12-24 22:09:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:09:36,590 INFO L225 Difference]: With dead ends: 189 [2023-12-24 22:09:36,590 INFO L226 Difference]: Without dead ends: 169 [2023-12-24 22:09:36,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=1972, Invalid=15850, Unknown=0, NotChecked=0, Total=17822 [2023-12-24 22:09:36,593 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 212 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2023-12-24 22:09:36,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 110 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2250 Invalid, 1 Unknown, 0 Unchecked, 32.9s Time] [2023-12-24 22:09:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-12-24 22:09:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 149. [2023-12-24 22:09:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.162162162162162) internal successors, (172), 148 states have internal predecessors, (172), 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-24 22:09:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2023-12-24 22:09:36,619 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 49 [2023-12-24 22:09:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:09:36,619 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2023-12-24 22:09:36,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 48 states have internal predecessors, (95), 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-24 22:09:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2023-12-24 22:09:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-24 22:09:36,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:09:36,619 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:09:36,625 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 (15)] Forceful destruction successful, exit code 0 [2023-12-24 22:09:36,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-24 22:09:36,825 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:09:36,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:09:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1945293746, now seen corresponding path program 7 times [2023-12-24 22:09:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:09:36,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312595822] [2023-12-24 22:09:36,825 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-24 22:09:36,826 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-24 22:09:36,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:09:36,826 INFO L229 MonitoredProcess]: Starting monitored process 16 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-24 22:09:36,828 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 (16)] Waiting until timeout for monitored process [2023-12-24 22:09:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:09:36,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-24 22:09:36,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:09:36,939 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-24 22:09:36,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 72 [2023-12-24 22:09:36,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:09:36,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:09:36,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-12-24 22:09:36,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2023-12-24 22:09:37,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:09:37,738 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 33 treesize of output 29 [2023-12-24 22:09:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 12 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:09:38,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:09:44,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-24 22:09:44,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:09:44,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:09:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:09:44,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:09:44,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312595822] [2023-12-24 22:09:44,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312595822] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:09:44,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:09:44,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 66 [2023-12-24 22:09:44,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666694214] [2023-12-24 22:09:44,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:09:44,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-24 22:09:44,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:09:44,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-24 22:09:44,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=3939, Unknown=0, NotChecked=0, Total=4290 [2023-12-24 22:09:44,192 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand has 66 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 66 states have internal predecessors, (111), 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-24 22:09:56,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:09:59,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:10:05,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:10:24,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:10:37,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:10:49,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:11:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:11:23,446 INFO L93 Difference]: Finished difference Result 250 states and 295 transitions. [2023-12-24 22:11:23,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2023-12-24 22:11:23,446 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 66 states have internal predecessors, (111), 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 57 [2023-12-24 22:11:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:11:23,447 INFO L225 Difference]: With dead ends: 250 [2023-12-24 22:11:23,447 INFO L226 Difference]: Without dead ends: 232 [2023-12-24 22:11:23,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7931 ImplicationChecksByTransitivity, 77.4s TimeCoverageRelationStatistics Valid=3607, Invalid=23783, Unknown=0, NotChecked=0, Total=27390 [2023-12-24 22:11:23,452 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 448 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2687 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2023-12-24 22:11:23,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 161 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2687 Invalid, 0 Unknown, 0 Unchecked, 26.7s Time] [2023-12-24 22:11:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-12-24 22:11:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 157. [2023-12-24 22:11:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.1602564102564104) internal successors, (181), 156 states have internal predecessors, (181), 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-24 22:11:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2023-12-24 22:11:23,466 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 57 [2023-12-24 22:11:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:11:23,466 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2023-12-24 22:11:23,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 66 states have internal predecessors, (111), 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-24 22:11:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2023-12-24 22:11:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 22:11:23,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:11:23,467 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:11:23,470 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 (16)] Forceful destruction successful, exit code 0 [2023-12-24 22:11:23,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-24 22:11:23,670 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:11:23,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:11:23,671 INFO L85 PathProgramCache]: Analyzing trace with hash 964351652, now seen corresponding path program 3 times [2023-12-24 22:11:23,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:11:23,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994603934] [2023-12-24 22:11:23,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:11:23,671 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-24 22:11:23,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:11:23,672 INFO L229 MonitoredProcess]: Starting monitored process 17 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-24 22:11:23,672 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 (17)] Waiting until timeout for monitored process [2023-12-24 22:11:23,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-12-24 22:11:23,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:11:23,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 22:11:23,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:11:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 42 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:11:23,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:11:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 42 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:11:24,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:11:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994603934] [2023-12-24 22:11:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994603934] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:11:24,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:11:24,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-12-24 22:11:24,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436082921] [2023-12-24 22:11:24,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:11:24,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-24 22:11:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:11:24,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-24 22:11:24,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=715, Unknown=0, NotChecked=0, Total=992 [2023-12-24 22:11:24,265 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand has 32 states, 32 states have (on average 3.8125) internal successors, (122), 32 states have internal predecessors, (122), 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-24 22:11:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:11:25,413 INFO L93 Difference]: Finished difference Result 298 states and 365 transitions. [2023-12-24 22:11:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-24 22:11:25,413 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.8125) internal successors, (122), 32 states have internal predecessors, (122), 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 65 [2023-12-24 22:11:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:11:25,414 INFO L225 Difference]: With dead ends: 298 [2023-12-24 22:11:25,414 INFO L226 Difference]: Without dead ends: 214 [2023-12-24 22:11:25,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=843, Invalid=1809, Unknown=0, NotChecked=0, Total=2652 [2023-12-24 22:11:25,415 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 402 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 22:11:25,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 145 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 22:11:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-12-24 22:11:25,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 166. [2023-12-24 22:11:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.206060606060606) internal successors, (199), 165 states have internal predecessors, (199), 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-24 22:11:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 199 transitions. [2023-12-24 22:11:25,428 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 199 transitions. Word has length 65 [2023-12-24 22:11:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:11:25,428 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 199 transitions. [2023-12-24 22:11:25,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.8125) internal successors, (122), 32 states have internal predecessors, (122), 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-24 22:11:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2023-12-24 22:11:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 22:11:25,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:11:25,429 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:11:25,434 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 (17)] Forceful destruction successful, exit code 0 [2023-12-24 22:11:25,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-24 22:11:25,633 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:11:25,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:11:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash 155005026, now seen corresponding path program 8 times [2023-12-24 22:11:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:11:25,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140585263] [2023-12-24 22:11:25,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:11:25,633 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-24 22:11:25,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:11:25,634 INFO L229 MonitoredProcess]: Starting monitored process 18 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-24 22:11:25,635 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 (18)] Waiting until timeout for monitored process [2023-12-24 22:11:25,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:11:25,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:11:25,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-24 22:11:25,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:11:25,790 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-24 22:11:25,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 72 [2023-12-24 22:11:25,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:11:25,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:11:25,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-12-24 22:11:25,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2023-12-24 22:11:26,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:11:26,979 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 33 treesize of output 29 [2023-12-24 22:11:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 14 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:11:27,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:11:35,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-24 22:11:35,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:11:35,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:11:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:11:35,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:11:35,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140585263] [2023-12-24 22:11:35,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140585263] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:11:35,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:11:35,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 72 [2023-12-24 22:11:35,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208664753] [2023-12-24 22:11:35,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:11:35,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-12-24 22:11:35,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:11:35,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-12-24 22:11:35,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=4742, Unknown=0, NotChecked=0, Total=5112 [2023-12-24 22:11:35,749 INFO L87 Difference]: Start difference. First operand 166 states and 199 transitions. Second operand has 72 states, 72 states have (on average 1.7638888888888888) internal successors, (127), 72 states have internal predecessors, (127), 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-24 22:11:54,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:11:58,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:01,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:05,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:14,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:18,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:22,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:28,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:30,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:33,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:37,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:43,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:46,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:49,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:57,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:13:10,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:13:10,483 INFO L93 Difference]: Finished difference Result 209 states and 248 transitions. [2023-12-24 22:13:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-12-24 22:13:10,483 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.7638888888888888) internal successors, (127), 72 states have internal predecessors, (127), 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 65 [2023-12-24 22:13:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:13:10,484 INFO L225 Difference]: With dead ends: 209 [2023-12-24 22:13:10,484 INFO L226 Difference]: Without dead ends: 199 [2023-12-24 22:13:10,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6097 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=1996, Invalid=20956, Unknown=0, NotChecked=0, Total=22952 [2023-12-24 22:13:10,486 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 423 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 139 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.3s IncrementalHoareTripleChecker+Time [2023-12-24 22:13:10,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 162 Invalid, 2898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2758 Invalid, 1 Unknown, 0 Unchecked, 60.3s Time] [2023-12-24 22:13:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-12-24 22:13:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 178. [2023-12-24 22:13:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.2033898305084745) internal successors, (213), 177 states have internal predecessors, (213), 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-24 22:13:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 213 transitions. [2023-12-24 22:13:10,503 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 213 transitions. Word has length 65 [2023-12-24 22:13:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:13:10,504 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 213 transitions. [2023-12-24 22:13:10,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.7638888888888888) internal successors, (127), 72 states have internal predecessors, (127), 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-24 22:13:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2023-12-24 22:13:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-24 22:13:10,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:13:10,507 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:13:10,510 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 (18)] Forceful destruction successful, exit code 0 [2023-12-24 22:13:10,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-24 22:13:10,708 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:13:10,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:13:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash 997711122, now seen corresponding path program 9 times [2023-12-24 22:13:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:13:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989478642] [2023-12-24 22:13:10,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:13:10,708 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-24 22:13:10,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:13:10,710 INFO L229 MonitoredProcess]: Starting monitored process 19 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-24 22:13:10,710 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 (19)] Waiting until timeout for monitored process [2023-12-24 22:13:10,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2023-12-24 22:13:10,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:13:10,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 22:13:10,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:13:10,935 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-24 22:13:10,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 72 [2023-12-24 22:13:10,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:13:10,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:13:11,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2023-12-24 22:13:11,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-24 22:13:11,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:13:11,792 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 33 treesize of output 29 [2023-12-24 22:13:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 16 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:13:12,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:13:16,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-24 22:13:16,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:13:16,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:13:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:13:16,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:13:16,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989478642] [2023-12-24 22:13:16,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989478642] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:13:16,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:13:16,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2023-12-24 22:13:16,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691444685] [2023-12-24 22:13:16,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:13:16,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-24 22:13:16,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:13:16,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-24 22:13:16,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2082, Unknown=0, NotChecked=0, Total=2256 [2023-12-24 22:13:16,588 INFO L87 Difference]: Start difference. First operand 178 states and 213 transitions. Second operand has 48 states, 48 states have (on average 2.9791666666666665) internal successors, (143), 48 states have internal predecessors, (143), 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-24 22:13:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:13:22,909 INFO L93 Difference]: Finished difference Result 195 states and 229 transitions. [2023-12-24 22:13:22,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-24 22:13:22,910 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.9791666666666665) internal successors, (143), 48 states have internal predecessors, (143), 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 73 [2023-12-24 22:13:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:13:22,911 INFO L225 Difference]: With dead ends: 195 [2023-12-24 22:13:22,911 INFO L226 Difference]: Without dead ends: 187 [2023-12-24 22:13:22,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=607, Invalid=7765, Unknown=0, NotChecked=0, Total=8372 [2023-12-24 22:13:22,912 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 125 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-24 22:13:22,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 136 Invalid, 2445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-24 22:13:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-24 22:13:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 178. [2023-12-24 22:13:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.192090395480226) internal successors, (211), 177 states have internal predecessors, (211), 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-24 22:13:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 211 transitions. [2023-12-24 22:13:22,934 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 211 transitions. Word has length 73 [2023-12-24 22:13:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:13:22,934 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 211 transitions. [2023-12-24 22:13:22,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.9791666666666665) internal successors, (143), 48 states have internal predecessors, (143), 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-24 22:13:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 211 transitions. [2023-12-24 22:13:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-24 22:13:22,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:13:22,935 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:13:22,942 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 (19)] Forceful destruction successful, exit code 0 [2023-12-24 22:13:23,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-24 22:13:23,136 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:13:23,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:13:23,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2102581698, now seen corresponding path program 10 times [2023-12-24 22:13:23,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:13:23,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82080783] [2023-12-24 22:13:23,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 22:13:23,136 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-24 22:13:23,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:13:23,137 INFO L229 MonitoredProcess]: Starting monitored process 20 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-24 22:13:23,139 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 (20)] Waiting until timeout for monitored process [2023-12-24 22:13:23,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 22:13:23,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:13:23,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-24 22:13:23,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:13:23,268 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-24 22:13:23,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 72 [2023-12-24 22:13:23,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:13:23,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-24 22:13:23,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-12-24 22:13:23,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-24 22:13:24,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:13:24,138 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 33 treesize of output 29 [2023-12-24 22:13:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 18 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:13:25,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:13:31,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-24 22:13:31,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:13:31,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:13:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:13:31,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:13:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82080783] [2023-12-24 22:13:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82080783] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:13:31,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:13:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 58 [2023-12-24 22:13:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954085697] [2023-12-24 22:13:31,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:13:31,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-24 22:13:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:13:31,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-24 22:13:31,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3085, Unknown=0, NotChecked=0, Total=3306 [2023-12-24 22:13:31,342 INFO L87 Difference]: Start difference. First operand 178 states and 211 transitions. Second operand has 58 states, 58 states have (on average 2.7413793103448274) internal successors, (159), 58 states have internal predecessors, (159), 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-24 22:13:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:13:42,575 INFO L93 Difference]: Finished difference Result 200 states and 232 transitions. [2023-12-24 22:13:42,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-24 22:13:42,576 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.7413793103448274) internal successors, (159), 58 states have internal predecessors, (159), 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 81 [2023-12-24 22:13:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:13:42,577 INFO L225 Difference]: With dead ends: 200 [2023-12-24 22:13:42,577 INFO L226 Difference]: Without dead ends: 191 [2023-12-24 22:13:42,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2311 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=811, Invalid=11399, Unknown=0, NotChecked=0, Total=12210 [2023-12-24 22:13:42,578 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 185 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 3286 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-24 22:13:42,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 214 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3286 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-24 22:13:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-24 22:13:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2023-12-24 22:13:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.1638418079096045) internal successors, (206), 177 states have internal predecessors, (206), 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-24 22:13:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2023-12-24 22:13:42,593 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 81 [2023-12-24 22:13:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:13:42,593 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2023-12-24 22:13:42,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.7413793103448274) internal successors, (159), 58 states have internal predecessors, (159), 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-24 22:13:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2023-12-24 22:13:42,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 22:13:42,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:13:42,594 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:13:42,597 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 (20)] Forceful destruction successful, exit code 0 [2023-12-24 22:13:42,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-24 22:13:42,797 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:13:42,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:13:42,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1044656972, now seen corresponding path program 4 times [2023-12-24 22:13:42,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:13:42,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356571964] [2023-12-24 22:13:42,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 22:13:42,798 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-24 22:13:42,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:13:42,798 INFO L229 MonitoredProcess]: Starting monitored process 21 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-24 22:13:42,799 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 (21)] Waiting until timeout for monitored process [2023-12-24 22:13:42,896 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 22:13:42,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-24 22:13:42,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-24 22:13:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-24 22:13:43,015 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-24 22:13:43,015 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-24 22:13:43,015 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:13:43,024 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 (21)] Forceful destruction successful, exit code 0 [2023-12-24 22:13:43,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-24 22:13:43,223 INFO L445 BasicCegarLoop]: Path program histogram: [10, 4, 1, 1, 1, 1, 1, 1] [2023-12-24 22:13:43,227 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:13:43,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:13:43 BoogieIcfgContainer [2023-12-24 22:13:43,302 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:13:43,302 INFO L158 Benchmark]: Toolchain (without parser) took 364859.63ms. Allocated memory was 244.3MB in the beginning and 293.6MB in the end (delta: 49.3MB). Free memory was 194.2MB in the beginning and 92.2MB in the end (delta: 102.0MB). Peak memory consumption was 152.1MB. Max. memory is 8.0GB. [2023-12-24 22:13:43,302 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 203.4MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:13:43,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.64ms. Allocated memory is still 244.3MB. Free memory was 193.9MB in the beginning and 182.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 22:13:43,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.02ms. Allocated memory is still 244.3MB. Free memory was 182.6MB in the beginning and 180.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 22:13:43,303 INFO L158 Benchmark]: Boogie Preprocessor took 29.26ms. Allocated memory is still 244.3MB. Free memory was 180.9MB in the beginning and 178.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:13:43,303 INFO L158 Benchmark]: RCFGBuilder took 269.96ms. Allocated memory is still 244.3MB. Free memory was 178.9MB in the beginning and 164.5MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-24 22:13:43,303 INFO L158 Benchmark]: TraceAbstraction took 364321.77ms. Allocated memory was 244.3MB in the beginning and 293.6MB in the end (delta: 49.3MB). Free memory was 163.8MB in the beginning and 92.2MB in the end (delta: 71.6MB). Peak memory consumption was 121.7MB. Max. memory is 8.0GB. [2023-12-24 22:13:43,303 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.14ms. Allocated memory is still 203.4MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.64ms. Allocated memory is still 244.3MB. Free memory was 193.9MB in the beginning and 182.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.02ms. Allocated memory is still 244.3MB. Free memory was 182.6MB in the beginning and 180.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.26ms. Allocated memory is still 244.3MB. Free memory was 180.9MB in the beginning and 178.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 269.96ms. Allocated memory is still 244.3MB. Free memory was 178.9MB in the beginning and 164.5MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 364321.77ms. Allocated memory was 244.3MB in the beginning and 293.6MB in the end (delta: 49.3MB). Free memory was 163.8MB in the beginning and 92.2MB in the end (delta: 71.6MB). Peak memory consumption was 121.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L13] unsigned int SIZE; [L14] const unsigned int MAX = 100000; [L25] SIZE=(__VERIFIER_nondet_uint()/2)+1 [L27] COND TRUE SIZE > 1 && SIZE < MAX [L28] EXPR, FCALL calloc(SIZE,sizeof(int)) [L28] int *a = calloc(SIZE,sizeof(int)); [L29] a[SIZE/2]=3 [L30] CALL, EXPR linear_search(a,SIZE,3) [L16] unsigned int j=0; VAL [MAX=100000, SIZE=65537, \old(n)=65537, \old(q)=3, a={6:0}, a={6:0}, j=0, n=65537, q=3] [L17] j