/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-16 16:24:51,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:24:51,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:24:51,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:24:51,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:24:51,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:24:51,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:24:51,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:24:51,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:24:51,245 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:24:51,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:24:51,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:24:51,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:24:51,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:24:51,247 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:24:51,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:24:51,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:24:51,248 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:24:51,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:24:51,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:24:51,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:24:51,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:24:51,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:24:51,250 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:24:51,250 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:24:51,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:24:51,250 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:24:51,250 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:24:51,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:24:51,251 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:24:51,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:24:51,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:24:51,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:24:51,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:24:51,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:24:51,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:24:51,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:24:51,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:24:51,253 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:24:51,253 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:24:51,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:24:51,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:24:51,253 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:24:51,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:24:51,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:24:51,254 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:24:51,254 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 16:24:51,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:24:51,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:24:51,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:24:51,447 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:24:51,447 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:24:51,448 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-16 16:24:52,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:24:52,714 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:24:52,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2023-12-16 16:24:52,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb0454de/adc6b7eb86294299beb606fef026ba94/FLAG901fd9549 [2023-12-16 16:24:52,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb0454de/adc6b7eb86294299beb606fef026ba94 [2023-12-16 16:24:52,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:24:52,741 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:24:52,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:24:52,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:24:52,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:24:52,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:52,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53da721d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52, skipping insertion in model container [2023-12-16 16:24:52,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:52,767 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:24:52,899 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-16 16:24:52,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:24:52,927 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:24:52,934 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-16 16:24:52,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:24:52,951 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:24:52,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52 WrapperNode [2023-12-16 16:24:52,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:24:52,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:24:52,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:24:52,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:24:52,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:52,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:52,982 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 56 [2023-12-16 16:24:52,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:24:52,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:24:52,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:24:52,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:24:52,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:52,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:53,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:53,016 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-16 16:24:53,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:53,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:53,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:53,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:53,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:53,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:53,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:24:53,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:24:53,038 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:24:53,038 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:24:53,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (1/1) ... [2023-12-16 16:24:53,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:24:53,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:24:53,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:24:53,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:24:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:24:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:24:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:24:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:24:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:24:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:24:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:24:53,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:24:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:24:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:24:53,150 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:24:53,151 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:24:53,329 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:24:53,360 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:24:53,360 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 16:24:53,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:24:53 BoogieIcfgContainer [2023-12-16 16:24:53,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:24:53,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:24:53,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:24:53,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:24:53,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:24:52" (1/3) ... [2023-12-16 16:24:53,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39df9aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:24:53, skipping insertion in model container [2023-12-16 16:24:53,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:52" (2/3) ... [2023-12-16 16:24:53,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39df9aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:24:53, skipping insertion in model container [2023-12-16 16:24:53,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:24:53" (3/3) ... [2023-12-16 16:24:53,373 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search.c [2023-12-16 16:24:53,385 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:24:53,386 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:24:53,417 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:24:53,422 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;@63b9678f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:24:53,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:24:53,426 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-16 16:24:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 16:24:53,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:53,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:53,432 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:53,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:53,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1564981187, now seen corresponding path program 1 times [2023-12-16 16:24:53,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:53,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661875738] [2023-12-16 16:24:53,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:24:53,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:53,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:53,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:53,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:24:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:24:53,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:24:53,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:53,555 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:24:53,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:53,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661875738] [2023-12-16 16:24:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661875738] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:24:53,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:24:53,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:24:53,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898541740] [2023-12-16 16:24:53,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:24:53,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:24:53,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:53,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:24:53,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:24:53,583 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-16 16:24:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:53,603 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2023-12-16 16:24:53,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:24:53,605 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-16 16:24:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:53,610 INFO L225 Difference]: With dead ends: 22 [2023-12-16 16:24:53,611 INFO L226 Difference]: Without dead ends: 11 [2023-12-16 16:24:53,613 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-16 16:24:53,616 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-16 16:24:53,616 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-16 16:24:53,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-16 16:24:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-16 16:24:53,649 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-16 16:24:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2023-12-16 16:24:53,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 7 [2023-12-16 16:24:53,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:53,651 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2023-12-16 16:24:53,651 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-16 16:24:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2023-12-16 16:24:53,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 16:24:53,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:53,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:53,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 16:24:53,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:53,855 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:53,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:53,855 INFO L85 PathProgramCache]: Analyzing trace with hash 493506260, now seen corresponding path program 1 times [2023-12-16 16:24:53,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:53,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110921078] [2023-12-16 16:24:53,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:24:53,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:53,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:53,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:53,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:24:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:24:53,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:24:53,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:53,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:24:53,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110921078] [2023-12-16 16:24:53,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110921078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:24:53,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:24:53,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:24:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724915464] [2023-12-16 16:24:53,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:24:53,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:24:53,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:53,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:24:53,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:24:53,975 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-16 16:24:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:54,005 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-12-16 16:24:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:24:54,005 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-16 16:24:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:54,006 INFO L225 Difference]: With dead ends: 15 [2023-12-16 16:24:54,006 INFO L226 Difference]: Without dead ends: 11 [2023-12-16 16:24:54,006 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-16 16:24:54,007 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-16 16:24:54,008 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-16 16:24:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-16 16:24:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-16 16:24:54,010 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-16 16:24:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-16 16:24:54,010 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2023-12-16 16:24:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:54,010 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-16 16:24:54,010 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-16 16:24:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-16 16:24:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 16:24:54,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:54,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:54,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:24:54,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:54,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:54,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:54,213 INFO L85 PathProgramCache]: Analyzing trace with hash 493565842, now seen corresponding path program 1 times [2023-12-16 16:24:54,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:54,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636366665] [2023-12-16 16:24:54,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:24:54,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:54,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:54,215 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:54,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:24:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:24:54,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:24:54,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:54,347 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:24:54,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636366665] [2023-12-16 16:24:54,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636366665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:24:54,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:24:54,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:24:54,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178539720] [2023-12-16 16:24:54,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:24:54,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:24:54,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:54,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:24:54,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:24:54,352 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-16 16:24:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:54,386 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2023-12-16 16:24:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:24:54,387 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-16 16:24:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:54,387 INFO L225 Difference]: With dead ends: 19 [2023-12-16 16:24:54,387 INFO L226 Difference]: Without dead ends: 14 [2023-12-16 16:24:54,387 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-16 16:24:54,389 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-16 16:24:54,389 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-16 16:24:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-16 16:24:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-16 16:24:54,392 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-16 16:24:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2023-12-16 16:24:54,393 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2023-12-16 16:24:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:54,393 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2023-12-16 16:24:54,393 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-16 16:24:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2023-12-16 16:24:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 16:24:54,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:54,394 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:54,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:24:54,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:54,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:54,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:54,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1891169386, now seen corresponding path program 1 times [2023-12-16 16:24:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:54,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299410202] [2023-12-16 16:24:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:24:54,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:54,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:54,599 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:54,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:24:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:24:54,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:24:54,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:54,651 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-16 16:24:54,651 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:24:54,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:54,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299410202] [2023-12-16 16:24:54,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299410202] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:24:54,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:24:54,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:24:54,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365621155] [2023-12-16 16:24:54,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:24:54,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:24:54,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:54,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:24:54,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:24:54,655 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-16 16:24:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:54,673 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2023-12-16 16:24:54,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:24:54,674 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-16 16:24:54,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:54,677 INFO L225 Difference]: With dead ends: 25 [2023-12-16 16:24:54,677 INFO L226 Difference]: Without dead ends: 15 [2023-12-16 16:24:54,678 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-16 16:24:54,682 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-16 16:24:54,688 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-16 16:24:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-16 16:24:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-16 16:24:54,691 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-16 16:24:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-12-16 16:24:54,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2023-12-16 16:24:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:54,691 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-12-16 16:24:54,692 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-16 16:24:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-12-16 16:24:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 16:24:54,692 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:54,692 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:54,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:24:54,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:54,899 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:54,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:54,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2010770900, now seen corresponding path program 1 times [2023-12-16 16:24:54,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:54,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630788600] [2023-12-16 16:24:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:24:54,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:54,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:54,901 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:54,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:24:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:24:54,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:24:54,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:54,962 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-16 16:24:54,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:24:54,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:54,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630788600] [2023-12-16 16:24:54,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630788600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:24:54,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:24:54,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:24:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811687213] [2023-12-16 16:24:54,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:24:54,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:24:54,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:54,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:24:54,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:24:54,964 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-16 16:24:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:55,003 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2023-12-16 16:24:55,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:24:55,004 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-16 16:24:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:55,005 INFO L225 Difference]: With dead ends: 32 [2023-12-16 16:24:55,005 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 16:24:55,007 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-16 16:24:55,008 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-16 16:24:55,009 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-16 16:24:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 16:24:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2023-12-16 16:24:55,014 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-16 16:24:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-12-16 16:24:55,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2023-12-16 16:24:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:55,022 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-12-16 16:24:55,022 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-16 16:24:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-12-16 16:24:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 16:24:55,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:55,023 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:55,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:24:55,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:55,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:55,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:55,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1474849770, now seen corresponding path program 1 times [2023-12-16 16:24:55,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:55,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221831809] [2023-12-16 16:24:55,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:24:55,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:55,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:55,229 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:55,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:24:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:24:55,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:24:55,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:55,387 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-16 16:24:55,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:24:55,457 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-16 16:24:55,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:55,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221831809] [2023-12-16 16:24:55,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221831809] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:24:55,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:24:55,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 16:24:55,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327065064] [2023-12-16 16:24:55,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:24:55,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 16:24:55,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:55,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 16:24:55,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:24:55,460 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-16 16:24:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:55,535 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-12-16 16:24:55,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:24:55,536 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-16 16:24:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:55,536 INFO L225 Difference]: With dead ends: 25 [2023-12-16 16:24:55,536 INFO L226 Difference]: Without dead ends: 19 [2023-12-16 16:24:55,537 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-16 16:24:55,537 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-16 16:24:55,538 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-16 16:24:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-16 16:24:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-16 16:24:55,542 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-16 16:24:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-12-16 16:24:55,544 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2023-12-16 16:24:55,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:55,545 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-12-16 16:24:55,545 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-16 16:24:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-12-16 16:24:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 16:24:55,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:55,546 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:55,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:24:55,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:55,748 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:55,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash 499210884, now seen corresponding path program 1 times [2023-12-16 16:24:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:55,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513398356] [2023-12-16 16:24:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:24:55,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:55,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:55,750 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:55,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 16:24:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:24:55,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:24:55,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:55,823 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-16 16:24:55,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:24:55,858 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-16 16:24:55,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:55,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513398356] [2023-12-16 16:24:55,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513398356] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:24:55,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:24:55,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 16:24:55,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071623594] [2023-12-16 16:24:55,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:24:55,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:24:55,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:24:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:24:55,860 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-16 16:24:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:55,969 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2023-12-16 16:24:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:24:55,970 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-16 16:24:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:55,972 INFO L225 Difference]: With dead ends: 51 [2023-12-16 16:24:55,972 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 16:24:55,972 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-16 16:24:55,973 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 40 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-16 16:24:55,974 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-16 16:24:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 16:24:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2023-12-16 16:24:55,985 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-16 16:24:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-12-16 16:24:55,986 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2023-12-16 16:24:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:55,987 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-12-16 16:24:55,987 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-16 16:24:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-12-16 16:24:55,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 16:24:55,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:55,988 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:55,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 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:24:56,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:56,191 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:56,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:56,191 INFO L85 PathProgramCache]: Analyzing trace with hash -310135742, now seen corresponding path program 2 times [2023-12-16 16:24:56,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:56,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472642961] [2023-12-16 16:24:56,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:24:56,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:56,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:56,193 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:56,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 16:24:56,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:24:56,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:24:56,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 16:24:56,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:56,371 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-16 16:24:56,371 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-16 16:24:56,383 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-16 16:24:56,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:24:56,418 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-16 16:24:56,475 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-16 16:24:56,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:24:56,650 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-16 16:24:56,755 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-16 16:24:56,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:24:56,940 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-16 16:24:56,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:24:56,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:24:56,949 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-16 16:24:56,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:56,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472642961] [2023-12-16 16:24:56,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472642961] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:24:56,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:24:56,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 16:24:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827575952] [2023-12-16 16:24:56,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:24:56,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 16:24:56,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:56,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 16:24:56,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:24:56,951 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-16 16:24:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:57,231 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2023-12-16 16:24:57,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 16:24:57,232 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-16 16:24:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:57,232 INFO L225 Difference]: With dead ends: 43 [2023-12-16 16:24:57,233 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 16:24:57,233 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-16 16:24:57,234 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-16 16:24:57,234 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-16 16:24:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 16:24:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-16 16:24:57,239 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-16 16:24:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-12-16 16:24:57,239 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2023-12-16 16:24:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:57,239 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-12-16 16:24:57,240 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-16 16:24:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-12-16 16:24:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 16:24:57,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:57,240 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:57,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:24:57,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:57,441 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:57,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:57,441 INFO L85 PathProgramCache]: Analyzing trace with hash 980189426, now seen corresponding path program 3 times [2023-12-16 16:24:57,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:57,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617662358] [2023-12-16 16:24:57,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:24:57,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:57,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:57,443 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:57,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:24:57,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-16 16:24:57,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:24:57,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 16:24:57,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:57,583 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-16 16:24:57,583 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-16 16:24:57,597 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-16 16:24:57,611 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-16 16:24:57,680 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-16 16:24:57,684 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-16 16:24:58,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:24:58,055 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-16 16:24:58,356 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-16 16:24:58,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:24:59,514 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-16 16:24:59,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:24:59,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:24:59,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-16 16:24:59,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:59,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617662358] [2023-12-16 16:24:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617662358] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:24:59,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:24:59,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2023-12-16 16:24:59,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169151950] [2023-12-16 16:24:59,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:24:59,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 16:24:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:59,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 16:24:59,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2023-12-16 16:24:59,531 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-16 16:25:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:01,616 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2023-12-16 16:25:01,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-16 16:25:01,617 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-16 16:25:01,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:01,618 INFO L225 Difference]: With dead ends: 66 [2023-12-16 16:25:01,618 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 16:25:01,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=465, Invalid=1887, Unknown=0, NotChecked=0, Total=2352 [2023-12-16 16:25:01,619 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-16 16:25:01,620 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-16 16:25:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 16:25:01,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2023-12-16 16:25:01,626 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-16 16:25:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-12-16 16:25:01,626 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2023-12-16 16:25:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:01,627 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-12-16 16:25:01,627 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-16 16:25:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-12-16 16:25:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 16:25:01,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:01,628 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:01,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:25:01,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:25:01,833 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:01,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash -955038748, now seen corresponding path program 2 times [2023-12-16 16:25:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:01,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276078732] [2023-12-16 16:25:01,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:25:01,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:25:01,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:01,839 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:25:01,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 16:25:01,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:25:01,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:25:01,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 16:25:01,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:02,010 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-16 16:25:02,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:25:02,118 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-16 16:25:02,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:02,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276078732] [2023-12-16 16:25:02,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276078732] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:25:02,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:25:02,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-16 16:25:02,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798177338] [2023-12-16 16:25:02,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:25:02,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 16:25:02,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:02,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 16:25:02,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:25:02,120 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-16 16:25:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:02,367 INFO L93 Difference]: Finished difference Result 115 states and 147 transitions. [2023-12-16 16:25:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 16:25:02,368 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-16 16:25:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:02,368 INFO L225 Difference]: With dead ends: 115 [2023-12-16 16:25:02,369 INFO L226 Difference]: Without dead ends: 95 [2023-12-16 16:25:02,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:25:02,369 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:02,370 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.1s Time] [2023-12-16 16:25:02,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-16 16:25:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2023-12-16 16:25:02,378 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-16 16:25:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2023-12-16 16:25:02,378 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 33 [2023-12-16 16:25:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:02,379 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2023-12-16 16:25:02,379 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-16 16:25:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2023-12-16 16:25:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 16:25:02,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:02,379 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:02,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 16:25:02,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:25:02,582 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:02,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1764385374, now seen corresponding path program 4 times [2023-12-16 16:25:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:02,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50932125] [2023-12-16 16:25:02,583 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:25:02,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:25:02,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:02,584 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-16 16:25:02,585 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-16 16:25:02,637 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 16:25:02,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:25:02,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 16:25:02,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:02,712 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-16 16:25:02,712 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-16 16:25:02,723 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-16 16:25:02,733 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-16 16:25:03,886 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-16 16:25:04,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:25:04,264 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-16 16:25:04,603 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-16 16:25:04,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:25:05,730 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-16 16:25:05,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:25:05,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:25:05,737 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-16 16:25:05,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:05,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50932125] [2023-12-16 16:25:05,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50932125] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:25:05,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:25:05,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-12-16 16:25:05,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565340387] [2023-12-16 16:25:05,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:25:05,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-16 16:25:05,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-16 16:25:05,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2023-12-16 16:25:05,740 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-16 16:25:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:07,746 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2023-12-16 16:25:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-16 16:25:07,746 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-16 16:25:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:07,746 INFO L225 Difference]: With dead ends: 89 [2023-12-16 16:25:07,747 INFO L226 Difference]: Without dead ends: 80 [2023-12-16 16:25:07,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=410, Invalid=2040, Unknown=0, NotChecked=0, Total=2450 [2023-12-16 16:25:07,748 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-16 16:25:07,748 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-16 16:25:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-16 16:25:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2023-12-16 16:25:07,756 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-16 16:25:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2023-12-16 16:25:07,756 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 33 [2023-12-16 16:25:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:07,756 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2023-12-16 16:25:07,757 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-16 16:25:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2023-12-16 16:25:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 16:25:07,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:07,757 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:07,798 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-16 16:25:07,959 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-16 16:25:07,959 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:07,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:07,960 INFO L85 PathProgramCache]: Analyzing trace with hash -445707694, now seen corresponding path program 5 times [2023-12-16 16:25:07,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:07,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533677565] [2023-12-16 16:25:07,960 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 16:25:07,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:25:07,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:07,961 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-16 16:25:07,962 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-16 16:25:08,023 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-12-16 16:25:08,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:25:08,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-16 16:25:08,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:08,072 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-16 16:25:08,072 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-16 16:25:08,080 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-16 16:25:08,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:25:08,097 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-16 16:25:08,115 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-16 16:25:08,123 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-16 16:25:08,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:25:08,446 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-16 16:25:08,801 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-16 16:25:08,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:25:10,603 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-16 16:25:10,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:25:10,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:25:10,610 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-16 16:25:10,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:10,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533677565] [2023-12-16 16:25:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533677565] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:25:10,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:25:10,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-12-16 16:25:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869621830] [2023-12-16 16:25:10,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:25:10,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-16 16:25:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-16 16:25:10,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 16:25:10,612 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-16 16:25:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:14,468 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2023-12-16 16:25:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-16 16:25:14,469 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-16 16:25:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:14,469 INFO L225 Difference]: With dead ends: 103 [2023-12-16 16:25:14,469 INFO L226 Difference]: Without dead ends: 97 [2023-12-16 16:25:14,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=603, Invalid=4509, Unknown=0, NotChecked=0, Total=5112 [2023-12-16 16:25:14,472 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 133 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:14,472 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.4s Time] [2023-12-16 16:25:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-16 16:25:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2023-12-16 16:25:14,481 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-16 16:25:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2023-12-16 16:25:14,481 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 41 [2023-12-16 16:25:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:14,482 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2023-12-16 16:25:14,482 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-16 16:25:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2023-12-16 16:25:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 16:25:14,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:14,483 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:14,492 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-16 16:25:14,685 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-16 16:25:14,686 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:14,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash -502965996, now seen corresponding path program 1 times [2023-12-16 16:25:14,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823267969] [2023-12-16 16:25:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:25:14,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:25:14,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:14,688 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-16 16:25:14,722 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-16 16:25:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:25:14,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 16:25:14,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:15,327 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-16 16:25:15,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:25:18,553 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-16 16:25:18,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:18,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823267969] [2023-12-16 16:25:18,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823267969] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:25:18,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:25:18,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2023-12-16 16:25:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489285428] [2023-12-16 16:25:18,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:25:18,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-16 16:25:18,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:18,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-16 16:25:18,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2023-12-16 16:25:18,555 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-16 16:25:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:45,984 INFO L93 Difference]: Finished difference Result 151 states and 181 transitions. [2023-12-16 16:25:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-12-16 16:25:45,985 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-16 16:25:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:45,985 INFO L225 Difference]: With dead ends: 151 [2023-12-16 16:25:45,985 INFO L226 Difference]: Without dead ends: 136 [2023-12-16 16:25:45,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3999 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=2973, Invalid=9459, Unknown=0, NotChecked=0, Total=12432 [2023-12-16 16:25:45,989 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 495 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s 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.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:45,989 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.8s Time] [2023-12-16 16:25:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-16 16:25:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 107. [2023-12-16 16:25:46,018 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-16 16:25:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2023-12-16 16:25:46,019 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 41 [2023-12-16 16:25:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:46,019 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2023-12-16 16:25:46,019 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-16 16:25:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2023-12-16 16:25:46,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-16 16:25:46,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:46,020 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:46,025 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 (14)] Ended with exit code 0 [2023-12-16 16:25:46,223 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-16 16:25:46,223 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:46,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1491650306, now seen corresponding path program 6 times [2023-12-16 16:25:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:46,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598260406] [2023-12-16 16:25:46,224 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 16:25:46,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:25:46,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:46,226 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-16 16:25:46,227 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-16 16:25:46,349 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-12-16 16:25:46,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:25:46,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-16 16:25:46,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:46,416 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-12-16 16:25:46,417 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-16 16:25:46,426 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-16 16:25:46,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-16 16:25:46,488 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-16 16:25:46,492 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-16 16:25:47,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:25:47,267 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-16 16:25:47,771 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-16 16:25:47,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:25:51,331 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-16 16:25:51,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:25:51,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:25:51,345 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-16 16:25:51,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:51,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598260406] [2023-12-16 16:25:51,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598260406] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:25:51,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:25:51,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2023-12-16 16:25:51,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008637875] [2023-12-16 16:25:51,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:25:51,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-16 16:25:51,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:51,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-16 16:25:51,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2026, Unknown=0, NotChecked=0, Total=2256 [2023-12-16 16:25:51,347 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-16 16:26:00,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 16:26:02,595 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 [] Received shutdown request... [2023-12-16 16:26:05,012 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:26:05,012 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:26:05,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 16:26:05,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-16 16:26:05,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=595, Invalid=5411, Unknown=0, NotChecked=0, Total=6006 [2023-12-16 16:26:05,117 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 95 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:05,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 73 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2023-12-16 16:26:05,118 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:26:05,121 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-16 16:26:05,318 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-16 16:26:05,319 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (107states) and FLOYD_HOARE automaton (currently 33 states, 48 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. [2023-12-16 16:26:05,322 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:05,325 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:26:05,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:26:05 BoogieIcfgContainer [2023-12-16 16:26:05,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:26:05,327 INFO L158 Benchmark]: Toolchain (without parser) took 72586.61ms. Allocated memory was 282.1MB in the beginning and 338.7MB in the end (delta: 56.6MB). Free memory was 234.5MB in the beginning and 239.8MB in the end (delta: -5.3MB). Peak memory consumption was 52.5MB. Max. memory is 8.0GB. [2023-12-16 16:26:05,327 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 182.5MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:26:05,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.75ms. Allocated memory is still 282.1MB. Free memory was 234.2MB in the beginning and 223.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 16:26:05,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.70ms. Allocated memory is still 282.1MB. Free memory was 223.0MB in the beginning and 221.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:26:05,328 INFO L158 Benchmark]: Boogie Preprocessor took 53.43ms. Allocated memory is still 282.1MB. Free memory was 221.2MB in the beginning and 219.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:26:05,328 INFO L158 Benchmark]: RCFGBuilder took 323.51ms. Allocated memory is still 282.1MB. Free memory was 219.1MB in the beginning and 204.8MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 16:26:05,328 INFO L158 Benchmark]: TraceAbstraction took 71963.99ms. Allocated memory was 282.1MB in the beginning and 338.7MB in the end (delta: 56.6MB). Free memory was 204.1MB in the beginning and 239.8MB in the end (delta: -35.7MB). Peak memory consumption was 22.1MB. Max. memory is 8.0GB. [2023-12-16 16:26:05,329 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.42ms. Allocated memory is still 182.5MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.75ms. Allocated memory is still 282.1MB. Free memory was 234.2MB in the beginning and 223.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.70ms. Allocated memory is still 282.1MB. Free memory was 223.0MB in the beginning and 221.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.43ms. Allocated memory is still 282.1MB. Free memory was 221.2MB in the beginning and 219.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 323.51ms. Allocated memory is still 282.1MB. Free memory was 219.1MB in the beginning and 204.8MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 71963.99ms. Allocated memory was 282.1MB in the beginning and 338.7MB in the end (delta: 56.6MB). Free memory was 204.1MB in the beginning and 239.8MB in the end (delta: -35.7MB). Peak memory consumption was 22.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 8). Cancelled while NwaCegarLoop was constructing difference of abstraction (107states) and FLOYD_HOARE automaton (currently 33 states, 48 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.9s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 50.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1175 SdHoareTripleChecker+Valid, 18.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1175 mSDsluCounter, 515 SdHoareTripleChecker+Invalid, 17.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4258 IncrementalHoareTripleChecker+Invalid, 4498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 240 mSolverCounterUnsat, 111 mSDtfsCounter, 4258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 773 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7306 ImplicationChecksByTransitivity, 40.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=13, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 95 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 566 ConstructedInterpolants, 0 QuantifiedInterpolants, 8206 SizeOfPredicates, 102 NumberOfNonLiveVariables, 1031 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 84/1400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown