/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-fpi/condn.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 20:18:46,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 20:18:46,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 20:18:46,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 20:18:46,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 20:18:46,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 20:18:46,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 20:18:46,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 20:18:46,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 20:18:46,965 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 20:18:46,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 20:18:46,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 20:18:46,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 20:18:46,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 20:18:46,966 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 20:18:46,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 20:18:46,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 20:18:46,967 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 20:18:46,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 20:18:46,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 20:18:46,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 20:18:46,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 20:18:46,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 20:18:46,969 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 20:18:46,969 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 20:18:46,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 20:18:46,969 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 20:18:46,970 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 20:18:46,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 20:18:46,970 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 20:18:46,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 20:18:46,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 20:18:46,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 20:18:46,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 20:18:46,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:18:46,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 20:18:46,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 20:18:46,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 20:18:46,971 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 20:18:46,972 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 20:18:46,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 20:18:46,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 20:18:46,973 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 20:18:46,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 20:18:46,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 20:18:46,973 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 20:18:46,973 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 20:18:47,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 20:18:47,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 20:18:47,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 20:18:47,163 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 20:18:47,163 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 20:18:47,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condn.c [2023-12-21 20:18:48,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 20:18:48,336 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 20:18:48,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condn.c [2023-12-21 20:18:48,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08784ef3e/f494fd1946404eef9d9f79a23e65ac33/FLAGadfe93548 [2023-12-21 20:18:48,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08784ef3e/f494fd1946404eef9d9f79a23e65ac33 [2023-12-21 20:18:48,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 20:18:48,354 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 20:18:48,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 20:18:48,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 20:18:48,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 20:18:48,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416cec19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48, skipping insertion in model container [2023-12-21 20:18:48,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,370 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 20:18:48,466 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condn.c[588,601] [2023-12-21 20:18:48,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:18:48,492 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 20:18:48,501 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condn.c[588,601] [2023-12-21 20:18:48,511 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:18:48,520 INFO L206 MainTranslator]: Completed translation [2023-12-21 20:18:48,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48 WrapperNode [2023-12-21 20:18:48,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 20:18:48,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 20:18:48,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 20:18:48,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 20:18:48,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,542 INFO L138 Inliner]: procedures = 18, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2023-12-21 20:18:48,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 20:18:48,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 20:18:48,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 20:18:48,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 20:18:48,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,560 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 8, 6]. 50 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 3 writes are split as follows [0, 0, 3]. [2023-12-21 20:18:48,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 20:18:48,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 20:18:48,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 20:18:48,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 20:18:48,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (1/1) ... [2023-12-21 20:18:48,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:18:48,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 20:18:48,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 20:18:48,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 20:18:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 20:18:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 20:18:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 20:18:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 20:18:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 20:18:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 20:18:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 20:18:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-21 20:18:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 20:18:48,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 20:18:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 20:18:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 20:18:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-21 20:18:48,679 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 20:18:48,681 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 20:18:48,795 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 20:18:48,816 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 20:18:48,816 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 20:18:48,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:18:48 BoogieIcfgContainer [2023-12-21 20:18:48,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 20:18:48,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 20:18:48,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 20:18:48,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 20:18:48,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:18:48" (1/3) ... [2023-12-21 20:18:48,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65352f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:18:48, skipping insertion in model container [2023-12-21 20:18:48,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:18:48" (2/3) ... [2023-12-21 20:18:48,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65352f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:18:48, skipping insertion in model container [2023-12-21 20:18:48,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:18:48" (3/3) ... [2023-12-21 20:18:48,822 INFO L112 eAbstractionObserver]: Analyzing ICFG condn.c [2023-12-21 20:18:48,833 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 20:18:48,834 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 20:18:48,861 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 20:18:48,865 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;@45773304, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 20:18:48,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 20:18:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:18:48,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 20:18:48,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:18:48,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:18:48,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:18:48,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:18:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1236320892, now seen corresponding path program 1 times [2023-12-21 20:18:48,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:18:48,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712284383] [2023-12-21 20:18:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:18:48,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:18:48,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:18:48,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:18:48,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 20:18:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:18:48,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 20:18:48,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:18:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:18:48,968 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:18:48,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:18:48,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712284383] [2023-12-21 20:18:48,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712284383] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:18:48,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:18:48,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 20:18:48,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160538045] [2023-12-21 20:18:48,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:18:48,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 20:18:48,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:18:49,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 20:18:49,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:18:49,003 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:18:49,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:18:49,041 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2023-12-21 20:18:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 20:18:49,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2023-12-21 20:18:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:18:49,048 INFO L225 Difference]: With dead ends: 33 [2023-12-21 20:18:49,048 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 20:18:49,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:18:49,052 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:18:49,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 20:18:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 20:18:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 20:18:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:18:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-21 20:18:49,071 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2023-12-21 20:18:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:18:49,071 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-21 20:18:49,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:18:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-21 20:18:49,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 20:18:49,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:18:49,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:18:49,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-21 20:18:49,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:18:49,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:18:49,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:18:49,278 INFO L85 PathProgramCache]: Analyzing trace with hash -556262522, now seen corresponding path program 1 times [2023-12-21 20:18:49,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:18:49,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605660163] [2023-12-21 20:18:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:18:49,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:18:49,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:18:49,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:18:49,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 20:18:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:18:49,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 20:18:49,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:18:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:18:49,407 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:18:49,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:18:49,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605660163] [2023-12-21 20:18:49,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605660163] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:18:49,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:18:49,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 20:18:49,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053231908] [2023-12-21 20:18:49,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:18:49,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 20:18:49,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:18:49,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 20:18:49,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 20:18:49,409 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:18:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:18:49,461 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-12-21 20:18:49,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 20:18:49,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2023-12-21 20:18:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:18:49,462 INFO L225 Difference]: With dead ends: 34 [2023-12-21 20:18:49,462 INFO L226 Difference]: Without dead ends: 24 [2023-12-21 20:18:49,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 20:18:49,463 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:18:49,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 14 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 20:18:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-21 20:18:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2023-12-21 20:18:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:18:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-12-21 20:18:49,467 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2023-12-21 20:18:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:18:49,467 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-12-21 20:18:49,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:18:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-12-21 20:18:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 20:18:49,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:18:49,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:18:49,481 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 (3)] Ended with exit code 0 [2023-12-21 20:18:49,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:18:49,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:18:49,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:18:49,671 INFO L85 PathProgramCache]: Analyzing trace with hash -157564324, now seen corresponding path program 1 times [2023-12-21 20:18:49,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:18:49,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211376941] [2023-12-21 20:18:49,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:18:49,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:18:49,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:18:49,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:18:49,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 20:18:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:18:49,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 20:18:49,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:18:49,885 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 23 treesize of output 11 [2023-12-21 20:18:49,962 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 32 treesize of output 20 [2023-12-21 20:18:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:18:49,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:18:50,090 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 35 treesize of output 29 [2023-12-21 20:18:50,103 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:18:50,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 24 [2023-12-21 20:18:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:18:50,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:18:50,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211376941] [2023-12-21 20:18:50,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211376941] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:18:50,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:18:50,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2023-12-21 20:18:50,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781916565] [2023-12-21 20:18:50,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:18:50,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 20:18:50,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:18:50,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 20:18:50,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2023-12-21 20:18:50,137 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:18:55,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:19:00,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:19:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:19:00,145 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2023-12-21 20:19:00,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 20:19:00,146 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 15 [2023-12-21 20:19:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:19:00,147 INFO L225 Difference]: With dead ends: 59 [2023-12-21 20:19:00,147 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 20:19:00,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 20:19:00,149 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 100 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-12-21 20:19:00,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 32 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 185 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2023-12-21 20:19:00,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 20:19:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2023-12-21 20:19:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:19:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-12-21 20:19:00,153 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2023-12-21 20:19:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:19:00,153 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-12-21 20:19:00,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:19:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-12-21 20:19:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 20:19:00,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:19:00,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:19:00,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 20:19:00,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:19:00,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:19:00,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:19:00,358 INFO L85 PathProgramCache]: Analyzing trace with hash -284437431, now seen corresponding path program 1 times [2023-12-21 20:19:00,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:19:00,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132045600] [2023-12-21 20:19:00,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:19:00,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:19:00,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:19:00,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:19:00,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 20:19:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:19:00,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-21 20:19:00,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:19:00,573 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 29 treesize of output 13 [2023-12-21 20:19:00,712 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 38 treesize of output 20 [2023-12-21 20:19:00,733 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-21 20:19:00,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:19:00,875 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 37 treesize of output 31 [2023-12-21 20:19:00,883 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:19:00,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 24 [2023-12-21 20:19:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 20:19:00,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:19:00,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132045600] [2023-12-21 20:19:00,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132045600] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:19:00,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:19:00,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2023-12-21 20:19:00,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727962301] [2023-12-21 20:19:00,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:19:00,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 20:19:00,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:19:00,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 20:19:00,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2023-12-21 20:19:00,980 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:19:06,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:19:10,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:19:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:19:10,183 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2023-12-21 20:19:10,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-21 20:19:10,183 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 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) Word has length 22 [2023-12-21 20:19:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:19:10,184 INFO L225 Difference]: With dead ends: 70 [2023-12-21 20:19:10,185 INFO L226 Difference]: Without dead ends: 32 [2023-12-21 20:19:10,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=1411, Unknown=0, NotChecked=0, Total=1722 [2023-12-21 20:19:10,186 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 100 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-12-21 20:19:10,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 38 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 280 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2023-12-21 20:19:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-21 20:19:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2023-12-21 20:19:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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-21 20:19:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-12-21 20:19:10,190 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 22 [2023-12-21 20:19:10,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:19:10,190 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-12-21 20:19:10,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:19:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-12-21 20:19:10,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 20:19:10,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:19:10,191 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:19:10,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 20:19:10,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:19:10,395 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:19:10,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:19:10,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1454654996, now seen corresponding path program 2 times [2023-12-21 20:19:10,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:19:10,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024931155] [2023-12-21 20:19:10,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:19:10,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:19:10,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:19:10,399 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:19:10,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 20:19:10,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:19:10,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:19:10,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 20:19:10,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:19:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:19:10,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:19:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 20:19:10,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:19:10,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024931155] [2023-12-21 20:19:10,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024931155] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:19:10,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:19:10,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 23 [2023-12-21 20:19:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551772121] [2023-12-21 20:19:10,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:19:10,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 20:19:10,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:19:10,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 20:19:10,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2023-12-21 20:19:10,933 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 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-21 20:19:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:19:11,318 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2023-12-21 20:19:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 20:19:11,318 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 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 26 [2023-12-21 20:19:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:19:11,319 INFO L225 Difference]: With dead ends: 84 [2023-12-21 20:19:11,319 INFO L226 Difference]: Without dead ends: 55 [2023-12-21 20:19:11,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2023-12-21 20:19:11,320 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 94 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:19:11,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 71 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 20:19:11,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-21 20:19:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2023-12-21 20:19:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:19:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2023-12-21 20:19:11,326 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 26 [2023-12-21 20:19:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:19:11,326 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2023-12-21 20:19:11,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 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-21 20:19:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2023-12-21 20:19:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 20:19:11,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:19:11,327 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:19:11,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-21 20:19:11,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:19:11,530 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:19:11,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:19:11,530 INFO L85 PathProgramCache]: Analyzing trace with hash 978595260, now seen corresponding path program 3 times [2023-12-21 20:19:11,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:19:11,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345689307] [2023-12-21 20:19:11,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:19:11,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:19:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:19:11,532 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:19:11,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-21 20:19:11,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 20:19:11,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:19:11,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 20:19:11,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:19:11,808 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 29 treesize of output 13 [2023-12-21 20:19:12,314 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:19:12,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:19:12,318 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 36 treesize of output 23 [2023-12-21 20:19:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 20:19:12,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:19:12,752 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 37 treesize of output 31 [2023-12-21 20:19:12,764 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:19:12,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 24 [2023-12-21 20:19:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 20:19:13,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:19:13,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345689307] [2023-12-21 20:19:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345689307] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:19:13,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:19:13,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2023-12-21 20:19:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135763143] [2023-12-21 20:19:13,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:19:13,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-21 20:19:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:19:13,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-21 20:19:13,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2023-12-21 20:19:13,556 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 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-21 20:19:19,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:19:24,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:19:28,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:19:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:19:32,559 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2023-12-21 20:19:32,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-12-21 20:19:32,560 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 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) Word has length 29 [2023-12-21 20:19:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:19:32,561 INFO L225 Difference]: With dead ends: 116 [2023-12-21 20:19:32,561 INFO L226 Difference]: Without dead ends: 73 [2023-12-21 20:19:32,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2467 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1804, Invalid=6386, Unknown=0, NotChecked=0, Total=8190 [2023-12-21 20:19:32,564 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 243 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 150 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:19:32,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 118 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 493 Invalid, 3 Unknown, 0 Unchecked, 13.6s Time] [2023-12-21 20:19:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-21 20:19:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 38. [2023-12-21 20:19:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:19:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2023-12-21 20:19:32,570 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 29 [2023-12-21 20:19:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:19:32,570 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2023-12-21 20:19:32,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 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-21 20:19:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2023-12-21 20:19:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-21 20:19:32,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:19:32,571 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:19:32,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-21 20:19:32,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:19:32,776 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:19:32,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:19:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash -61426454, now seen corresponding path program 4 times [2023-12-21 20:19:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:19:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703431552] [2023-12-21 20:19:32,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:19:32,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:19:32,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:19:32,785 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:19:32,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-21 20:19:32,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:19:32,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:19:32,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 20:19:32,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:19:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 20:19:33,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:19:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 20:19:33,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:19:33,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703431552] [2023-12-21 20:19:33,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703431552] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:19:33,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:19:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2023-12-21 20:19:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222679015] [2023-12-21 20:19:33,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:19:33,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 20:19:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:19:33,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 20:19:33,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2023-12-21 20:19:33,464 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:19:33,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:19:33,925 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2023-12-21 20:19:33,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 20:19:33,926 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 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 30 [2023-12-21 20:19:33,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:19:33,926 INFO L225 Difference]: With dead ends: 110 [2023-12-21 20:19:33,930 INFO L226 Difference]: Without dead ends: 90 [2023-12-21 20:19:33,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=802, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 20:19:33,932 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 392 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:19:33,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 122 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 20:19:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-21 20:19:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2023-12-21 20:19:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 63 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:19:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2023-12-21 20:19:33,941 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 30 [2023-12-21 20:19:33,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:19:33,941 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2023-12-21 20:19:33,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:19:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2023-12-21 20:19:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-21 20:19:33,942 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:19:33,942 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:19:33,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-21 20:19:34,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:19:34,149 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:19:34,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:19:34,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1272203046, now seen corresponding path program 5 times [2023-12-21 20:19:34,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:19:34,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964328567] [2023-12-21 20:19:34,149 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 20:19:34,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:19:34,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:19:34,150 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:19:34,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-21 20:19:34,275 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-12-21 20:19:34,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:19:34,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-21 20:19:34,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:19:34,487 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 29 treesize of output 13 [2023-12-21 20:19:34,564 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 29 treesize of output 13 [2023-12-21 20:19:34,789 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 38 treesize of output 20 [2023-12-21 20:19:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:19:34,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:19:35,588 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 45 treesize of output 39 [2023-12-21 20:19:35,607 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:19:35,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 152 treesize of output 126 [2023-12-21 20:19:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 20:19:35,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:19:35,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964328567] [2023-12-21 20:19:35,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964328567] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:19:35,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:19:35,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 35 [2023-12-21 20:19:35,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997493165] [2023-12-21 20:19:35,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:19:35,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-21 20:19:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:19:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-21 20:19:35,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2023-12-21 20:19:35,974 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:04,523 WARN L293 SmtUtils]: Spent 28.17s on a formula simplification. DAG size of input: 57 DAG size of output: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:20:12,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:20:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:20:13,444 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2023-12-21 20:20:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-21 20:20:13,445 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 states have internal predecessors, (61), 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-21 20:20:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:20:13,448 INFO L225 Difference]: With dead ends: 114 [2023-12-21 20:20:13,448 INFO L226 Difference]: Without dead ends: 112 [2023-12-21 20:20:13,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=715, Invalid=2945, Unknown=0, NotChecked=0, Total=3660 [2023-12-21 20:20:13,450 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 205 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 100 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:20:13,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 87 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 666 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2023-12-21 20:20:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-21 20:20:13,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 67. [2023-12-21 20:20:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2023-12-21 20:20:13,478 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 33 [2023-12-21 20:20:13,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:20:13,478 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2023-12-21 20:20:13,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2023-12-21 20:20:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 20:20:13,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:20:13,482 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:20:13,487 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 (9)] Ended with exit code 0 [2023-12-21 20:20:13,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:20:13,687 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:20:13,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:20:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1414642665, now seen corresponding path program 6 times [2023-12-21 20:20:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:20:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538092320] [2023-12-21 20:20:13,687 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 20:20:13,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:20:13,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:20:13,689 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:20:13,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-21 20:20:13,789 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-12-21 20:20:13,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:20:13,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-21 20:20:13,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:20:13,932 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 29 treesize of output 13 [2023-12-21 20:20:14,208 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 38 treesize of output 20 [2023-12-21 20:20:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 20:20:14,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:20:14,704 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 37 treesize of output 31 [2023-12-21 20:20:14,722 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:20:14,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 24 [2023-12-21 20:20:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 20:20:14,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:20:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538092320] [2023-12-21 20:20:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538092320] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:20:14,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:20:14,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2023-12-21 20:20:14,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116400412] [2023-12-21 20:20:14,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:20:14,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-21 20:20:14,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:20:14,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-21 20:20:14,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2023-12-21 20:20:14,981 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:21,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:20:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:20:21,724 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2023-12-21 20:20:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-21 20:20:21,725 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 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 36 [2023-12-21 20:20:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:20:21,726 INFO L225 Difference]: With dead ends: 99 [2023-12-21 20:20:21,726 INFO L226 Difference]: Without dead ends: 54 [2023-12-21 20:20:21,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=473, Invalid=2179, Unknown=0, NotChecked=0, Total=2652 [2023-12-21 20:20:21,727 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 97 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:20:21,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 83 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 659 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2023-12-21 20:20:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-21 20:20:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2023-12-21 20:20:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2023-12-21 20:20:21,733 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 36 [2023-12-21 20:20:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:20:21,733 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2023-12-21 20:20:21,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2023-12-21 20:20:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-21 20:20:21,734 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:20:21,734 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:20:21,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-21 20:20:21,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:20:21,934 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:20:21,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:20:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash -518999780, now seen corresponding path program 7 times [2023-12-21 20:20:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:20:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497394989] [2023-12-21 20:20:21,935 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 20:20:21,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:20:21,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:20:21,936 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:20:21,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-21 20:20:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:20:22,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-21 20:20:22,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:20:22,302 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 29 treesize of output 13 [2023-12-21 20:20:22,613 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 38 treesize of output 20 [2023-12-21 20:20:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:20:22,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:20:22,979 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 37 treesize of output 31 [2023-12-21 20:20:22,988 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:20:22,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 24 [2023-12-21 20:20:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 20:20:23,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:20:23,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497394989] [2023-12-21 20:20:23,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497394989] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:20:23,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:20:23,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 37 [2023-12-21 20:20:23,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579569982] [2023-12-21 20:20:23,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:20:23,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-21 20:20:23,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:20:23,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-21 20:20:23,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1172, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 20:20:23,213 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:31,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:20:35,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:20:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:20:35,717 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2023-12-21 20:20:35,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-12-21 20:20:35,717 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 states have internal predecessors, (80), 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 43 [2023-12-21 20:20:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:20:35,718 INFO L225 Difference]: With dead ends: 133 [2023-12-21 20:20:35,718 INFO L226 Difference]: Without dead ends: 56 [2023-12-21 20:20:35,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=644, Invalid=5362, Unknown=0, NotChecked=0, Total=6006 [2023-12-21 20:20:35,720 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 194 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 75 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:20:35,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 125 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1082 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2023-12-21 20:20:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-21 20:20:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2023-12-21 20:20:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2023-12-21 20:20:35,726 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 43 [2023-12-21 20:20:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:20:35,726 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2023-12-21 20:20:35,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2023-12-21 20:20:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-21 20:20:35,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:20:35,727 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:20:35,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-21 20:20:35,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:20:35,927 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:20:35,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:20:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1737260859, now seen corresponding path program 8 times [2023-12-21 20:20:35,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:20:35,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540551429] [2023-12-21 20:20:35,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:20:35,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:20:35,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:20:35,936 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:20:35,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-21 20:20:36,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:20:36,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:20:36,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-21 20:20:36,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:20:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 5 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:20:36,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:20:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 5 proven. 70 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-21 20:20:37,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:20:37,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540551429] [2023-12-21 20:20:37,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540551429] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:20:37,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:20:37,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15] total 38 [2023-12-21 20:20:37,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388962049] [2023-12-21 20:20:37,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:20:37,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-21 20:20:37,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:20:37,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-21 20:20:37,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1142, Unknown=0, NotChecked=0, Total=1406 [2023-12-21 20:20:37,054 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 38 states, 38 states have (on average 2.263157894736842) internal successors, (86), 38 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:20:37,878 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2023-12-21 20:20:37,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-21 20:20:37,879 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.263157894736842) internal successors, (86), 38 states have internal predecessors, (86), 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 47 [2023-12-21 20:20:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:20:37,880 INFO L225 Difference]: With dead ends: 150 [2023-12-21 20:20:37,880 INFO L226 Difference]: Without dead ends: 108 [2023-12-21 20:20:37,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=314, Invalid=1492, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 20:20:37,881 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 145 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 20:20:37,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 255 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 20:20:37,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-21 20:20:37,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2023-12-21 20:20:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.1956521739130435) internal successors, (110), 92 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2023-12-21 20:20:37,919 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 47 [2023-12-21 20:20:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:20:37,920 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2023-12-21 20:20:37,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.263157894736842) internal successors, (86), 38 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2023-12-21 20:20:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 20:20:37,920 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:20:37,920 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:20:37,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-21 20:20:38,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:20:38,124 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:20:38,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:20:38,125 INFO L85 PathProgramCache]: Analyzing trace with hash -157938807, now seen corresponding path program 9 times [2023-12-21 20:20:38,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:20:38,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814883830] [2023-12-21 20:20:38,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:20:38,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:20:38,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:20:38,126 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:20:38,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-21 20:20:38,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-21 20:20:38,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:20:38,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-21 20:20:38,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:20:38,525 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 29 treesize of output 13 [2023-12-21 20:20:39,528 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:20:39,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:20:39,532 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 36 treesize of output 23 [2023-12-21 20:20:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 61 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-21 20:20:39,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:20:40,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-12-21 20:20:40,324 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:20:40,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 24 [2023-12-21 20:20:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-21 20:20:41,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:20:41,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814883830] [2023-12-21 20:20:41,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814883830] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:20:41,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:20:41,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2023-12-21 20:20:41,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387387971] [2023-12-21 20:20:41,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:20:41,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-21 20:20:41,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:20:41,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-21 20:20:41,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1400, Unknown=0, NotChecked=0, Total=1722 [2023-12-21 20:20:41,650 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 42 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:20:49,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:20:55,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:20:59,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:21:04,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:21:08,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:21:14,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:21:18,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:21:24,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:21:28,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:21:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:21:36,443 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2023-12-21 20:21:36,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2023-12-21 20:21:36,443 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 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 50 [2023-12-21 20:21:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:21:36,444 INFO L225 Difference]: With dead ends: 197 [2023-12-21 20:21:36,444 INFO L226 Difference]: Without dead ends: 94 [2023-12-21 20:21:36,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7406 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=4453, Invalid=18197, Unknown=0, NotChecked=0, Total=22650 [2023-12-21 20:21:36,448 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 473 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 382 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:21:36,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 178 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 1071 Invalid, 9 Unknown, 0 Unchecked, 40.1s Time] [2023-12-21 20:21:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-21 20:21:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2023-12-21 20:21:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:21:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2023-12-21 20:21:36,459 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 50 [2023-12-21 20:21:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:21:36,459 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2023-12-21 20:21:36,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:21:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2023-12-21 20:21:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-21 20:21:36,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:21:36,460 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:21:36,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-21 20:21:36,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:21:36,664 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:21:36,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:21:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1689948901, now seen corresponding path program 10 times [2023-12-21 20:21:36,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:21:36,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286801068] [2023-12-21 20:21:36,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:21:36,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:21:36,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:21:36,668 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-21 20:21:36,684 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-21 20:21:36,785 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:21:36,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:21:36,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 20:21:36,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:21:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-21 20:21:37,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:21:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-21 20:21:38,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:21:38,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286801068] [2023-12-21 20:21:38,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286801068] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:21:38,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:21:38,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2023-12-21 20:21:38,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815099407] [2023-12-21 20:21:38,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:21:38,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-21 20:21:38,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:21:38,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-21 20:21:38,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=992, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 20:21:38,262 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:21:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:21:39,292 INFO L93 Difference]: Finished difference Result 172 states and 197 transitions. [2023-12-21 20:21:39,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-21 20:21:39,292 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 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 51 [2023-12-21 20:21:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:21:39,293 INFO L225 Difference]: With dead ends: 172 [2023-12-21 20:21:39,293 INFO L226 Difference]: Without dead ends: 129 [2023-12-21 20:21:39,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=485, Invalid=1771, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 20:21:39,296 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 605 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 20:21:39,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 281 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 20:21:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-21 20:21:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2023-12-21 20:21:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 102 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:21:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2023-12-21 20:21:39,320 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 51 [2023-12-21 20:21:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:21:39,320 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2023-12-21 20:21:39,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:21:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2023-12-21 20:21:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-21 20:21:39,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:21:39,320 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:21:39,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-21 20:21:39,525 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-21 20:21:39,525 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:21:39,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:21:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash 563328883, now seen corresponding path program 11 times [2023-12-21 20:21:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:21:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660605727] [2023-12-21 20:21:39,526 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 20:21:39,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:21:39,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:21:39,527 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-21 20:21:39,549 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-21 20:21:39,759 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-12-21 20:21:39,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:21:39,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-21 20:21:39,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:21:39,920 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 29 treesize of output 13 [2023-12-21 20:21:40,011 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 29 treesize of output 13 [2023-12-21 20:21:40,384 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 38 treesize of output 20 [2023-12-21 20:21:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 20:21:40,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:21:41,522 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 45 treesize of output 39 [2023-12-21 20:21:41,535 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:21:41,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 152 treesize of output 126 [2023-12-21 20:21:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-21 20:21:42,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:21:42,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660605727] [2023-12-21 20:21:42,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660605727] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:21:42,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:21:42,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2023-12-21 20:21:42,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061839578] [2023-12-21 20:21:42,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:21:42,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-21 20:21:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:21:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-21 20:21:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1577, Unknown=0, NotChecked=0, Total=1892 [2023-12-21 20:21:42,311 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 44 states, 44 states have (on average 2.25) internal successors, (99), 44 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:22:15,194 WARN L293 SmtUtils]: Spent 32.36s on a formula simplification. DAG size of input: 79 DAG size of output: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:22:24,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:22:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:22:25,746 INFO L93 Difference]: Finished difference Result 179 states and 207 transitions. [2023-12-21 20:22:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-12-21 20:22:25,746 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.25) internal successors, (99), 44 states have internal predecessors, (99), 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 54 [2023-12-21 20:22:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:22:25,747 INFO L225 Difference]: With dead ends: 179 [2023-12-21 20:22:25,747 INFO L226 Difference]: Without dead ends: 177 [2023-12-21 20:22:25,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1879 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=1171, Invalid=6139, Unknown=0, NotChecked=0, Total=7310 [2023-12-21 20:22:25,748 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 225 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:22:25,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 173 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1535 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2023-12-21 20:22:25,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-21 20:22:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 106. [2023-12-21 20:22:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 105 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:22:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2023-12-21 20:22:25,765 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 54 [2023-12-21 20:22:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:22:25,765 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2023-12-21 20:22:25,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.25) internal successors, (99), 44 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:22:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2023-12-21 20:22:25,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-21 20:22:25,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:22:25,765 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:22:25,771 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 (15)] Ended with exit code 0 [2023-12-21 20:22:25,970 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-21 20:22:25,971 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:22:25,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:22:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1698647164, now seen corresponding path program 12 times [2023-12-21 20:22:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:22:25,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020136944] [2023-12-21 20:22:25,972 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 20:22:25,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:22:25,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:22:25,973 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:22:25,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-21 20:22:26,181 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-12-21 20:22:26,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:22:26,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-21 20:22:26,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:22:26,570 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 29 treesize of output 13 [2023-12-21 20:22:27,030 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 38 treesize of output 20 [2023-12-21 20:22:27,058 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:22:27,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:22:27,818 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 37 treesize of output 31 [2023-12-21 20:22:27,827 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:22:27,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 24 [2023-12-21 20:22:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-21 20:22:28,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:22:28,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020136944] [2023-12-21 20:22:28,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020136944] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:22:28,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:22:28,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 21] total 50 [2023-12-21 20:22:28,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26776581] [2023-12-21 20:22:28,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:22:28,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-21 20:22:28,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:22:28,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-21 20:22:28,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=2050, Unknown=0, NotChecked=0, Total=2450 [2023-12-21 20:22:28,366 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 50 states, 50 states have (on average 2.12) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:22:39,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:22:43,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:22:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:22:43,893 INFO L93 Difference]: Finished difference Result 199 states and 223 transitions. [2023-12-21 20:22:43,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2023-12-21 20:22:43,893 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-12-21 20:22:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:22:43,894 INFO L225 Difference]: With dead ends: 199 [2023-12-21 20:22:43,894 INFO L226 Difference]: Without dead ends: 124 [2023-12-21 20:22:43,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4561 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1776, Invalid=12986, Unknown=0, NotChecked=0, Total=14762 [2023-12-21 20:22:43,896 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 248 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 136 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:22:43,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 411 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2144 Invalid, 2 Unknown, 0 Unchecked, 12.2s Time] [2023-12-21 20:22:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-21 20:22:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 71. [2023-12-21 20:22:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:22:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2023-12-21 20:22:43,907 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 57 [2023-12-21 20:22:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:22:43,907 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2023-12-21 20:22:43,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:22:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2023-12-21 20:22:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-21 20:22:43,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:22:43,908 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:22:43,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-21 20:22:44,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:22:44,113 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:22:44,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:22:44,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1653962778, now seen corresponding path program 13 times [2023-12-21 20:22:44,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:22:44,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937506454] [2023-12-21 20:22:44,113 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 20:22:44,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:22:44,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:22:44,114 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:22:44,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-21 20:22:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:22:44,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-21 20:22:44,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:22:44,770 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 29 treesize of output 13 [2023-12-21 20:22:44,867 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 29 treesize of output 13 [2023-12-21 20:22:45,268 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 38 treesize of output 20 [2023-12-21 20:22:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:22:45,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:22:46,480 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 45 treesize of output 39 [2023-12-21 20:22:46,489 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:22:46,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 74 treesize of output 58 [2023-12-21 20:22:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-21 20:22:46,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:22:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937506454] [2023-12-21 20:22:46,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937506454] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:22:46,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:22:46,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 21] total 51 [2023-12-21 20:22:46,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326192165] [2023-12-21 20:22:46,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:22:46,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-21 20:22:46,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:22:46,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-21 20:22:46,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=2311, Unknown=0, NotChecked=0, Total=2550 [2023-12-21 20:22:46,933 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 51 states, 51 states have (on average 2.215686274509804) internal successors, (113), 51 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:23:12,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:23:18,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:23:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:23:18,986 INFO L93 Difference]: Finished difference Result 255 states and 291 transitions. [2023-12-21 20:23:18,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-12-21 20:23:18,986 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.215686274509804) internal successors, (113), 51 states have internal predecessors, (113), 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 61 [2023-12-21 20:23:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:23:18,987 INFO L225 Difference]: With dead ends: 255 [2023-12-21 20:23:18,987 INFO L226 Difference]: Without dead ends: 218 [2023-12-21 20:23:18,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4170 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=1225, Invalid=12817, Unknown=0, NotChecked=0, Total=14042 [2023-12-21 20:23:18,988 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 301 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 145 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-12-21 20:23:18,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 268 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2273 Invalid, 1 Unknown, 0 Unchecked, 11.8s Time] [2023-12-21 20:23:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-12-21 20:23:19,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 116. [2023-12-21 20:23:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.173913043478261) internal successors, (135), 115 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:23:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2023-12-21 20:23:19,010 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 61 [2023-12-21 20:23:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:23:19,010 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2023-12-21 20:23:19,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.215686274509804) internal successors, (113), 51 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:23:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2023-12-21 20:23:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-21 20:23:19,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:23:19,011 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:23:19,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-21 20:23:19,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:23:19,215 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:23:19,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:23:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1335180503, now seen corresponding path program 14 times [2023-12-21 20:23:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:23:19,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122422746] [2023-12-21 20:23:19,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:23:19,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:23:19,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:23:19,217 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:23:19,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-21 20:23:19,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:23:19,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:23:19,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-21 20:23:19,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:23:19,756 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 29 treesize of output 13 [2023-12-21 20:23:20,427 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 38 treesize of output 20 [2023-12-21 20:23:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:23:20,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:23:21,565 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 37 treesize of output 31 [2023-12-21 20:23:21,580 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:23:21,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 24 [2023-12-21 20:23:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-21 20:23:22,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:23:22,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122422746] [2023-12-21 20:23:22,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122422746] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:23:22,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:23:22,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23] total 52 [2023-12-21 20:23:22,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856768298] [2023-12-21 20:23:22,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:23:22,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-21 20:23:22,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:23:22,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-21 20:23:22,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2247, Unknown=0, NotChecked=0, Total=2652 [2023-12-21 20:23:22,318 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand has 52 states, 52 states have (on average 2.2884615384615383) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:23:27,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:23:33,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:23:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:23:33,783 INFO L93 Difference]: Finished difference Result 199 states and 223 transitions. [2023-12-21 20:23:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-12-21 20:23:33,783 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.2884615384615383) internal successors, (119), 52 states have internal predecessors, (119), 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 64 [2023-12-21 20:23:33,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:23:33,784 INFO L225 Difference]: With dead ends: 199 [2023-12-21 20:23:33,784 INFO L226 Difference]: Without dead ends: 85 [2023-12-21 20:23:33,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1107, Invalid=6903, Unknown=0, NotChecked=0, Total=8010 [2023-12-21 20:23:33,785 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 155 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:23:33,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 227 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1891 Invalid, 1 Unknown, 0 Unchecked, 9.2s Time] [2023-12-21 20:23:33,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-21 20:23:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2023-12-21 20:23:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:23:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2023-12-21 20:23:33,821 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 64 [2023-12-21 20:23:33,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:23:33,821 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2023-12-21 20:23:33,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.2884615384615383) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:23:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2023-12-21 20:23:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-21 20:23:33,821 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:23:33,821 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:23:33,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-21 20:23:34,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:23:34,027 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:23:34,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:23:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash -750886346, now seen corresponding path program 1 times [2023-12-21 20:23:34,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:23:34,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300517745] [2023-12-21 20:23:34,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:23:34,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:23:34,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:23:34,029 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:23:34,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-21 20:23:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:23:34,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-21 20:23:34,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:23:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-21 20:23:34,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:23:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-21 20:23:36,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:23:36,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300517745] [2023-12-21 20:23:36,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300517745] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:23:36,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:23:36,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2023-12-21 20:23:36,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625414904] [2023-12-21 20:23:36,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:23:36,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-21 20:23:36,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:23:36,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-21 20:23:36,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=1509, Unknown=0, NotChecked=0, Total=1892 [2023-12-21 20:23:36,106 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 44 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:23:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:23:37,752 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2023-12-21 20:23:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-21 20:23:37,753 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 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 68 [2023-12-21 20:23:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:23:37,753 INFO L225 Difference]: With dead ends: 185 [2023-12-21 20:23:37,753 INFO L226 Difference]: Without dead ends: 151 [2023-12-21 20:23:37,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=679, Invalid=2627, Unknown=0, NotChecked=0, Total=3306 [2023-12-21 20:23:37,754 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 593 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:23:37,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 313 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 20:23:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-21 20:23:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 132. [2023-12-21 20:23:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.183206106870229) internal successors, (155), 131 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:23:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2023-12-21 20:23:37,779 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 68 [2023-12-21 20:23:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:23:37,780 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2023-12-21 20:23:37,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:23:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2023-12-21 20:23:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-21 20:23:37,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:23:37,780 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:23:37,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-21 20:23:37,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:23:37,986 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:23:37,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:23:37,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1966211108, now seen corresponding path program 15 times [2023-12-21 20:23:37,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:23:37,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081821350] [2023-12-21 20:23:37,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:23:37,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:23:37,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:23:37,988 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:23:37,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-21 20:23:38,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-12-21 20:23:38,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:23:38,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-21 20:23:38,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:23:38,688 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 29 treesize of output 13 [2023-12-21 20:23:40,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:23:40,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:23:40,081 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 36 treesize of output 23 [2023-12-21 20:23:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 25 proven. 145 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-21 20:23:40,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:23:41,039 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 37 treesize of output 31 [2023-12-21 20:23:41,056 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:23:41,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 24 [2023-12-21 20:23:43,354 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-21 20:23:43,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:23:43,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081821350] [2023-12-21 20:23:43,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081821350] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:23:43,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:23:43,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 54 [2023-12-21 20:23:43,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914926320] [2023-12-21 20:23:43,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:23:43,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-21 20:23:43,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:23:43,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-21 20:23:43,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=2464, Unknown=0, NotChecked=0, Total=2862 [2023-12-21 20:23:43,356 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand has 54 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:24:02,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:24:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:24:20,019 INFO L93 Difference]: Finished difference Result 277 states and 307 transitions. [2023-12-21 20:24:20,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2023-12-21 20:24:20,020 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 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 71 [2023-12-21 20:24:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:24:20,021 INFO L225 Difference]: With dead ends: 277 [2023-12-21 20:24:20,021 INFO L226 Difference]: Without dead ends: 123 [2023-12-21 20:24:20,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15279 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=7348, Invalid=38662, Unknown=0, NotChecked=0, Total=46010 [2023-12-21 20:24:20,023 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 508 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 331 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2023-12-21 20:24:20,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 382 Invalid, 2980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 2648 Invalid, 1 Unknown, 0 Unchecked, 10.8s Time] [2023-12-21 20:24:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-21 20:24:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2023-12-21 20:24:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.1346153846153846) internal successors, (118), 104 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:24:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2023-12-21 20:24:20,046 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 71 [2023-12-21 20:24:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:24:20,046 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2023-12-21 20:24:20,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:24:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2023-12-21 20:24:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 20:24:20,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:24:20,047 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:24:20,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-21 20:24:20,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:24:20,251 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:24:20,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:24:20,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1568255370, now seen corresponding path program 16 times [2023-12-21 20:24:20,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:24:20,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527570184] [2023-12-21 20:24:20,251 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:24:20,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:24:20,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:24:20,252 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:24:20,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-21 20:24:20,407 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:24:20,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:24:20,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-21 20:24:20,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:24:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-21 20:24:20,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:24:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-21 20:24:23,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:24:23,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527570184] [2023-12-21 20:24:23,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527570184] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:24:23,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:24:23,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2023-12-21 20:24:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586248905] [2023-12-21 20:24:23,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:24:23,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 20:24:23,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:24:23,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 20:24:23,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1808, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 20:24:23,088 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 48 states, 48 states have (on average 1.9375) internal successors, (93), 48 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-21 20:24:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:24:24,756 INFO L93 Difference]: Finished difference Result 229 states and 260 transitions. [2023-12-21 20:24:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-21 20:24:24,757 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9375) internal successors, (93), 48 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) Word has length 72 [2023-12-21 20:24:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:24:24,757 INFO L225 Difference]: With dead ends: 229 [2023-12-21 20:24:24,758 INFO L226 Difference]: Without dead ends: 168 [2023-12-21 20:24:24,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=788, Invalid=3118, Unknown=0, NotChecked=0, Total=3906 [2023-12-21 20:24:24,758 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 788 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:24:24,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 344 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 20:24:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-21 20:24:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 142. [2023-12-21 20:24:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.1914893617021276) internal successors, (168), 141 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:24:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 168 transitions. [2023-12-21 20:24:24,788 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 168 transitions. Word has length 72 [2023-12-21 20:24:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:24:24,788 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 168 transitions. [2023-12-21 20:24:24,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.9375) internal successors, (93), 48 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-21 20:24:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 168 transitions. [2023-12-21 20:24:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-21 20:24:24,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:24:24,789 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:24:24,794 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 (21)] Ended with exit code 0 [2023-12-21 20:24:24,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:24:24,993 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:24:24,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:24:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash 791710790, now seen corresponding path program 17 times [2023-12-21 20:24:24,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:24:24,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368787005] [2023-12-21 20:24:24,994 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 20:24:24,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:24:24,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:24:24,995 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:24:24,997 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 (22)] Waiting until timeout for monitored process [2023-12-21 20:24:25,587 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2023-12-21 20:24:25,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:24:25,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-21 20:24:25,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:24:26,162 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 29 treesize of output 13 [2023-12-21 20:24:26,272 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 29 treesize of output 13 [2023-12-21 20:24:26,942 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 38 treesize of output 20 [2023-12-21 20:24:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:24:26,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:24:28,693 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 45 treesize of output 39 [2023-12-21 20:24:28,706 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:24:28,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 152 treesize of output 126 [2023-12-21 20:24:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-21 20:24:29,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:24:29,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368787005] [2023-12-21 20:24:29,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368787005] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:24:29,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:24:29,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 25] total 61 [2023-12-21 20:24:29,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288984921] [2023-12-21 20:24:29,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:24:29,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-12-21 20:24:29,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:24:29,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-12-21 20:24:29,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=3296, Unknown=0, NotChecked=0, Total=3660 [2023-12-21 20:24:29,580 INFO L87 Difference]: Start difference. First operand 142 states and 168 transitions. Second operand has 61 states, 61 states have (on average 2.278688524590164) internal successors, (139), 61 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:24:47,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:24:51,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:24:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:24:52,374 INFO L93 Difference]: Finished difference Result 260 states and 290 transitions. [2023-12-21 20:24:52,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2023-12-21 20:24:52,374 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.278688524590164) internal successors, (139), 61 states have internal predecessors, (139), 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 75 [2023-12-21 20:24:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:24:52,375 INFO L225 Difference]: With dead ends: 260 [2023-12-21 20:24:52,375 INFO L226 Difference]: Without dead ends: 258 [2023-12-21 20:24:52,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6492 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1784, Invalid=19386, Unknown=0, NotChecked=0, Total=21170 [2023-12-21 20:24:52,377 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 603 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 3198 mSolverCounterSat, 242 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 3442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 3198 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:24:52,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 384 Invalid, 3442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 3198 Invalid, 2 Unknown, 0 Unchecked, 16.1s Time] [2023-12-21 20:24:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-12-21 20:24:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 145. [2023-12-21 20:24:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 144 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:24:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2023-12-21 20:24:52,409 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 75 [2023-12-21 20:24:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:24:52,409 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2023-12-21 20:24:52,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.278688524590164) internal successors, (139), 61 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:24:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2023-12-21 20:24:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-21 20:24:52,409 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:24:52,409 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:24:52,416 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 (22)] Forceful destruction successful, exit code 0 [2023-12-21 20:24:52,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:24:52,616 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:24:52,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:24:52,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2099125559, now seen corresponding path program 18 times [2023-12-21 20:24:52,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:24:52,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083678111] [2023-12-21 20:24:52,617 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 20:24:52,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:24:52,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:24:52,618 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:24:52,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-21 20:24:53,016 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-12-21 20:24:53,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:24:53,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-21 20:24:53,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:24:53,673 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 29 treesize of output 13 [2023-12-21 20:24:54,521 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 38 treesize of output 20 [2023-12-21 20:24:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:24:54,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:24:56,005 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 37 treesize of output 31 [2023-12-21 20:24:56,017 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:24:56,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 24 [2023-12-21 20:24:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-21 20:24:57,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:24:57,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083678111] [2023-12-21 20:24:57,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083678111] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:24:57,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:24:57,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 27] total 65 [2023-12-21 20:24:57,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679266240] [2023-12-21 20:24:57,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:24:57,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-12-21 20:24:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:24:57,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-12-21 20:24:57,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=625, Invalid=3535, Unknown=0, NotChecked=0, Total=4160 [2023-12-21 20:24:57,124 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 65 states, 65 states have (on average 2.230769230769231) internal successors, (145), 65 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:25:12,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:25:16,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:25:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:25:17,382 INFO L93 Difference]: Finished difference Result 262 states and 292 transitions. [2023-12-21 20:25:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2023-12-21 20:25:17,385 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.230769230769231) internal successors, (145), 65 states have internal predecessors, (145), 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 78 [2023-12-21 20:25:17,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:25:17,385 INFO L225 Difference]: With dead ends: 262 [2023-12-21 20:25:17,385 INFO L226 Difference]: Without dead ends: 157 [2023-12-21 20:25:17,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8206 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2691, Invalid=23069, Unknown=0, NotChecked=0, Total=25760 [2023-12-21 20:25:17,387 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 569 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 3332 mSolverCounterSat, 216 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 3550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 3332 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:25:17,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 582 Invalid, 3550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 3332 Invalid, 2 Unknown, 0 Unchecked, 14.3s Time] [2023-12-21 20:25:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-12-21 20:25:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 92. [2023-12-21 20:25:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 91 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:25:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2023-12-21 20:25:17,408 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 78 [2023-12-21 20:25:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:25:17,409 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2023-12-21 20:25:17,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.230769230769231) internal successors, (145), 65 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:25:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2023-12-21 20:25:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-21 20:25:17,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:25:17,432 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:25:17,451 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 (23)] Forceful destruction successful, exit code 0 [2023-12-21 20:25:17,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:25:17,633 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:25:17,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:25:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1380536141, now seen corresponding path program 19 times [2023-12-21 20:25:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:25:17,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516722966] [2023-12-21 20:25:17,633 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 20:25:17,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:25:17,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:25:17,635 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:25:17,636 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 (24)] Waiting until timeout for monitored process [2023-12-21 20:25:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:25:18,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-21 20:25:18,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:25:18,721 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 29 treesize of output 13 [2023-12-21 20:25:18,834 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 29 treesize of output 13 [2023-12-21 20:25:19,573 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 38 treesize of output 20 [2023-12-21 20:25:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 368 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:25:19,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:25:21,347 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 45 treesize of output 39 [2023-12-21 20:25:21,356 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:25:21,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 74 treesize of output 58 [2023-12-21 20:25:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 302 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-21 20:25:22,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:25:22,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516722966] [2023-12-21 20:25:22,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516722966] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:25:22,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:25:22,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 27] total 66 [2023-12-21 20:25:22,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367197645] [2023-12-21 20:25:22,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:25:22,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-21 20:25:22,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:25:22,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-21 20:25:22,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=3970, Unknown=0, NotChecked=0, Total=4290 [2023-12-21 20:25:22,102 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 66 states, 66 states have (on average 2.303030303030303) internal successors, (152), 66 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:25:42,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:25:51,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:25:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:25:51,629 INFO L93 Difference]: Finished difference Result 322 states and 364 transitions. [2023-12-21 20:25:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2023-12-21 20:25:51,630 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.303030303030303) internal successors, (152), 66 states have internal predecessors, (152), 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 82 [2023-12-21 20:25:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:25:51,630 INFO L225 Difference]: With dead ends: 322 [2023-12-21 20:25:51,631 INFO L226 Difference]: Without dead ends: 276 [2023-12-21 20:25:51,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7082 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1598, Invalid=21658, Unknown=0, NotChecked=0, Total=23256 [2023-12-21 20:25:51,632 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 502 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 3565 mSolverCounterSat, 185 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 3565 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2023-12-21 20:25:51,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 441 Invalid, 3752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 3565 Invalid, 2 Unknown, 0 Unchecked, 14.9s Time] [2023-12-21 20:25:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-12-21 20:25:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 155. [2023-12-21 20:25:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.1688311688311688) internal successors, (180), 154 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:25:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2023-12-21 20:25:51,679 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 180 transitions. Word has length 82 [2023-12-21 20:25:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:25:51,680 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 180 transitions. [2023-12-21 20:25:51,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.303030303030303) internal successors, (152), 66 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:25:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 180 transitions. [2023-12-21 20:25:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-21 20:25:51,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:25:51,680 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:25:51,693 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 (24)] Forceful destruction successful, exit code 0 [2023-12-21 20:25:51,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:25:51,894 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:25:51,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:25:51,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1059769148, now seen corresponding path program 20 times [2023-12-21 20:25:51,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:25:51,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710726744] [2023-12-21 20:25:51,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:25:51,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:25:51,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:25:51,895 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:25:51,927 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 (25)] Waiting until timeout for monitored process [2023-12-21 20:25:52,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:25:52,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:25:52,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-21 20:25:52,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:25:52,482 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 29 treesize of output 13 [2023-12-21 20:25:53,374 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 38 treesize of output 20 [2023-12-21 20:25:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:25:53,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:25:54,963 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 37 treesize of output 31 [2023-12-21 20:25:54,974 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:25:54,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 24 [2023-12-21 20:25:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 331 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-21 20:25:56,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:25:56,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710726744] [2023-12-21 20:25:56,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710726744] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:25:56,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:25:56,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 58 [2023-12-21 20:25:56,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166023031] [2023-12-21 20:25:56,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:25:56,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-21 20:25:56,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:25:56,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-21 20:25:56,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=2847, Unknown=0, NotChecked=0, Total=3306 [2023-12-21 20:25:56,162 INFO L87 Difference]: Start difference. First operand 155 states and 180 transitions. Second operand has 58 states, 58 states have (on average 2.7241379310344827) internal successors, (158), 58 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:26:11,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:26:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:26:11,659 INFO L93 Difference]: Finished difference Result 262 states and 292 transitions. [2023-12-21 20:26:11,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-12-21 20:26:11,660 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.7241379310344827) internal successors, (158), 58 states have internal predecessors, (158), 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 85 [2023-12-21 20:26:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:26:11,660 INFO L225 Difference]: With dead ends: 262 [2023-12-21 20:26:11,660 INFO L226 Difference]: Without dead ends: 109 [2023-12-21 20:26:11,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2966 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1404, Invalid=10152, Unknown=0, NotChecked=0, Total=11556 [2023-12-21 20:26:11,662 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 349 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 2865 mSolverCounterSat, 159 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 3025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2865 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:26:11,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 341 Invalid, 3025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2865 Invalid, 1 Unknown, 0 Unchecked, 12.0s Time] [2023-12-21 20:26:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-21 20:26:11,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2023-12-21 20:26:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 92 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:26:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2023-12-21 20:26:11,691 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 85 [2023-12-21 20:26:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:26:11,691 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2023-12-21 20:26:11,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.7241379310344827) internal successors, (158), 58 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:26:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2023-12-21 20:26:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-21 20:26:11,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:26:11,692 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:26:11,697 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 (25)] Forceful destruction successful, exit code 0 [2023-12-21 20:26:11,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:26:11,897 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:26:11,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:26:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash 758005219, now seen corresponding path program 2 times [2023-12-21 20:26:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:26:11,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697954657] [2023-12-21 20:26:11,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:26:11,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:26:11,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:26:11,900 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:26:11,901 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 (26)] Waiting until timeout for monitored process [2023-12-21 20:26:12,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:26:12,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:26:12,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-21 20:26:12,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:26:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 11 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:26:13,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:26:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 11 proven. 352 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-21 20:26:15,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:26:15,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697954657] [2023-12-21 20:26:15,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697954657] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:26:15,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:26:15,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 27] total 68 [2023-12-21 20:26:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378477347] [2023-12-21 20:26:15,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:26:15,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-12-21 20:26:15,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:26:15,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-12-21 20:26:15,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=3830, Unknown=0, NotChecked=0, Total=4556 [2023-12-21 20:26:15,245 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 68 states, 68 states have (on average 2.411764705882353) internal successors, (164), 68 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:26:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:26:17,744 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2023-12-21 20:26:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-21 20:26:17,745 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.411764705882353) internal successors, (164), 68 states have internal predecessors, (164), 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 89 [2023-12-21 20:26:17,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:26:17,760 INFO L225 Difference]: With dead ends: 268 [2023-12-21 20:26:17,760 INFO L226 Difference]: Without dead ends: 190 [2023-12-21 20:26:17,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=800, Invalid=4456, Unknown=0, NotChecked=0, Total=5256 [2023-12-21 20:26:17,762 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 559 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 3503 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 3662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 3503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:26:17,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 652 Invalid, 3662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 3503 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-21 20:26:17,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-21 20:26:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 171. [2023-12-21 20:26:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.1764705882352942) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:26:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 200 transitions. [2023-12-21 20:26:17,824 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 200 transitions. Word has length 89 [2023-12-21 20:26:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:26:17,825 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 200 transitions. [2023-12-21 20:26:17,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.411764705882353) internal successors, (164), 68 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:26:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 200 transitions. [2023-12-21 20:26:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-21 20:26:17,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:26:17,826 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:26:17,832 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 (26)] Ended with exit code 0 [2023-12-21 20:26:18,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:26:18,032 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:26:18,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:26:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1249023383, now seen corresponding path program 21 times [2023-12-21 20:26:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:26:18,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615593361] [2023-12-21 20:26:18,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:26:18,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:26:18,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:26:18,034 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:26:18,035 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 (27)] Waiting until timeout for monitored process [2023-12-21 20:26:18,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-12-21 20:26:18,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:26:18,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-21 20:26:18,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:26:18,943 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 35 treesize of output 15 [2023-12-21 20:26:21,328 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-12-21 20:26:21,328 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 41 treesize of output 23 [2023-12-21 20:26:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 34 proven. 265 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2023-12-21 20:26:21,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:28:39,710 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 37 treesize of output 31 [2023-12-21 20:28:39,722 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:28:39,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 24 [2023-12-21 20:28:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2023-12-21 20:28:43,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:28:43,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615593361] [2023-12-21 20:28:43,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615593361] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:28:43,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:28:43,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 66 [2023-12-21 20:28:43,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190875154] [2023-12-21 20:28:43,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:28:43,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-21 20:28:43,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:28:43,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-21 20:28:43,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=3573, Unknown=34, NotChecked=0, Total=4290 [2023-12-21 20:28:43,684 INFO L87 Difference]: Start difference. First operand 171 states and 200 transitions. Second operand has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:30:32,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:30:52,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:30:56,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:31:16,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:31:20,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:31:22,685 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-21 20:31:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2023-12-21 20:31:22,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8819 ImplicationChecksByTransitivity, 273.4s TimeCoverageRelationStatistics Valid=4583, Invalid=24768, Unknown=61, NotChecked=0, Total=29412 [2023-12-21 20:31:22,687 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 631 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2147 mSolverCounterSat, 744 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 744 IncrementalHoareTripleChecker+Valid, 2147 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:31:22,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 8 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [744 Valid, 2147 Invalid, 5 Unknown, 0 Unchecked, 27.2s Time] [2023-12-21 20:31:22,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-12-21 20:31:22,696 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 (27)] Forceful destruction successful, exit code 0 [2023-12-21 20:31:22,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:31:22,888 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2023-12-21 20:31:22,891 INFO L158 Benchmark]: Toolchain (without parser) took 754537.94ms. Allocated memory is still 267.4MB. Free memory was 221.7MB in the beginning and 192.3MB in the end (delta: 29.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-12-21 20:31:22,892 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 222.3MB. Free memory is still 169.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 20:31:22,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.41ms. Allocated memory is still 267.4MB. Free memory was 221.7MB in the beginning and 209.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 20:31:22,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.10ms. Allocated memory is still 267.4MB. Free memory was 209.6MB in the beginning and 208.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 20:31:22,892 INFO L158 Benchmark]: Boogie Preprocessor took 28.36ms. Allocated memory is still 267.4MB. Free memory was 208.0MB in the beginning and 205.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 20:31:22,892 INFO L158 Benchmark]: RCFGBuilder took 242.20ms. Allocated memory is still 267.4MB. Free memory was 205.9MB in the beginning and 191.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 20:31:22,892 INFO L158 Benchmark]: TraceAbstraction took 754073.39ms. Allocated memory is still 267.4MB. Free memory was 190.7MB in the beginning and 192.3MB in the end (delta: -1.6MB). Peak memory consumption was 1.1kB. Max. memory is 8.0GB. [2023-12-21 20:31:22,893 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 222.3MB. Free memory is still 169.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.41ms. Allocated memory is still 267.4MB. Free memory was 221.7MB in the beginning and 209.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.10ms. Allocated memory is still 267.4MB. Free memory was 209.6MB in the beginning and 208.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.36ms. Allocated memory is still 267.4MB. Free memory was 208.0MB in the beginning and 205.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 242.20ms. Allocated memory is still 267.4MB. Free memory was 205.9MB in the beginning and 191.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 754073.39ms. Allocated memory is still 267.4MB. Free memory was 190.7MB in the beginning and 192.3MB in the end (delta: -1.6MB). Peak memory consumption was 1.1kB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...