/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/heap-manipulation/dancing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 20:43:31,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 20:43:31,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 20:43:31,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 20:43:31,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 20:43:31,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 20:43:31,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 20:43:31,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 20:43:31,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 20:43:31,280 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 20:43:31,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 20:43:31,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 20:43:31,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 20:43:31,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 20:43:31,281 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 20:43:31,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 20:43:31,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 20:43:31,282 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 20:43:31,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 20:43:31,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 20:43:31,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 20:43:31,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 20:43:31,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 20:43:31,288 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 20:43:31,288 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 20:43:31,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 20:43:31,289 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 20:43:31,289 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 20:43:31,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 20:43:31,289 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 20:43:31,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 20:43:31,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 20:43:31,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 20:43:31,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 20:43:31,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:43:31,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 20:43:31,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 20:43:31,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 20:43:31,292 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 20:43:31,292 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 20:43:31,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 20:43:31,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 20:43:31,296 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 20:43:31,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 20:43:31,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 20:43:31,297 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 20:43:31,297 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 20:43:31,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 20:43:31,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 20:43:31,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 20:43:31,496 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 20:43:31,496 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 20:43:31,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dancing.i [2023-12-24 20:43:32,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 20:43:32,835 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 20:43:32,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dancing.i [2023-12-24 20:43:32,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae585e2b7/808cb04734d742f59282fe6a26fc7baa/FLAG6d4197a02 [2023-12-24 20:43:32,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae585e2b7/808cb04734d742f59282fe6a26fc7baa [2023-12-24 20:43:32,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 20:43:32,866 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 20:43:32,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 20:43:32,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 20:43:32,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 20:43:32,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:43:32" (1/1) ... [2023-12-24 20:43:32,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d12b6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:32, skipping insertion in model container [2023-12-24 20:43:32,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:43:32" (1/1) ... [2023-12-24 20:43:32,910 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 20:43:33,079 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dancing.i[938,951] [2023-12-24 20:43:33,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:43:33,227 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 20:43:33,241 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dancing.i[938,951] [2023-12-24 20:43:33,283 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:43:33,310 INFO L206 MainTranslator]: Completed translation [2023-12-24 20:43:33,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33 WrapperNode [2023-12-24 20:43:33,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 20:43:33,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 20:43:33,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 20:43:33,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 20:43:33,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (1/1) ... [2023-12-24 20:43:33,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (1/1) ... [2023-12-24 20:43:33,357 INFO L138 Inliner]: procedures = 125, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 87 [2023-12-24 20:43:33,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 20:43:33,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 20:43:33,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 20:43:33,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 20:43:33,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (1/1) ... [2023-12-24 20:43:33,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (1/1) ... [2023-12-24 20:43:33,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (1/1) ... [2023-12-24 20:43:33,391 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2023-12-24 20:43:33,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (1/1) ... [2023-12-24 20:43:33,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (1/1) ... [2023-12-24 20:43:33,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (1/1) ... [2023-12-24 20:43:33,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (1/1) ... [2023-12-24 20:43:33,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (1/1) ... [2023-12-24 20:43:33,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (1/1) ... [2023-12-24 20:43:33,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 20:43:33,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 20:43:33,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 20:43:33,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 20:43:33,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (1/1) ... [2023-12-24 20:43:33,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:43:33,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 20:43:33,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 20:43:33,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 20:43:33,486 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2023-12-24 20:43:33,486 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2023-12-24 20:43:33,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-24 20:43:33,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-24 20:43:33,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 20:43:33,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 20:43:33,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 20:43:33,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 20:43:33,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 20:43:33,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 20:43:33,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 20:43:33,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 20:43:33,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 20:43:33,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 20:43:33,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 20:43:33,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 20:43:33,605 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 20:43:33,607 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 20:43:33,938 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 20:43:33,961 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 20:43:33,961 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 20:43:33,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:43:33 BoogieIcfgContainer [2023-12-24 20:43:33,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 20:43:33,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 20:43:33,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 20:43:33,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 20:43:33,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 08:43:32" (1/3) ... [2023-12-24 20:43:33,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66aff01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:43:33, skipping insertion in model container [2023-12-24 20:43:33,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:43:33" (2/3) ... [2023-12-24 20:43:33,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66aff01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:43:33, skipping insertion in model container [2023-12-24 20:43:33,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:43:33" (3/3) ... [2023-12-24 20:43:33,973 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2023-12-24 20:43:33,990 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 20:43:33,990 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 20:43:34,032 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 20:43:34,040 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;@6fe9f4d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 20:43:34,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 20:43:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 20:43:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-24 20:43:34,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:43:34,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:43:34,063 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:43:34,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:43:34,069 INFO L85 PathProgramCache]: Analyzing trace with hash -761064872, now seen corresponding path program 1 times [2023-12-24 20:43:34,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:43:34,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709315539] [2023-12-24 20:43:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:43:34,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:43:34,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:43:34,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:43:34,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 20:43:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:43:34,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 20:43:34,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:43:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:43:34,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:43:34,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:43:34,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709315539] [2023-12-24 20:43:34,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709315539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:43:34,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:43:34,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 20:43:34,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699289161] [2023-12-24 20:43:34,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:43:34,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 20:43:34,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:43:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 20:43:34,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:43:34,326 INFO L87 Difference]: Start difference. First operand has 40 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:43:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:43:34,358 INFO L93 Difference]: Finished difference Result 74 states and 104 transitions. [2023-12-24 20:43:34,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 20:43:34,360 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-12-24 20:43:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:43:34,364 INFO L225 Difference]: With dead ends: 74 [2023-12-24 20:43:34,365 INFO L226 Difference]: Without dead ends: 38 [2023-12-24 20:43:34,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:43:34,369 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 20:43:34,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 20:43:34,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-24 20:43:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-24 20:43:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 20:43:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2023-12-24 20:43:34,399 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 19 [2023-12-24 20:43:34,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:43:34,399 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2023-12-24 20:43:34,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:43:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2023-12-24 20:43:34,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-24 20:43:34,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:43:34,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:43:34,408 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-24 20:43:34,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:43:34,606 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:43:34,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:43:34,606 INFO L85 PathProgramCache]: Analyzing trace with hash -100466027, now seen corresponding path program 1 times [2023-12-24 20:43:34,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:43:34,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925819537] [2023-12-24 20:43:34,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:43:34,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:43:34,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:43:34,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:43:34,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 20:43:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:43:34,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 20:43:34,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:43:34,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2023-12-24 20:43:34,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-24 20:43:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:43:35,130 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:43:35,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:43:35,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925819537] [2023-12-24 20:43:35,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925819537] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:43:35,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:43:35,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 20:43:35,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386877551] [2023-12-24 20:43:35,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:43:35,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 20:43:35,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:43:35,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 20:43:35,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-24 20:43:35,134 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:43:39,312 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 [0] [2023-12-24 20:43:43,355 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 [0] [2023-12-24 20:43:47,435 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 [0] [2023-12-24 20:43:51,503 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 [0] [2023-12-24 20:43:55,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:43:59,596 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 [0] [2023-12-24 20:44:03,631 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 [0] [2023-12-24 20:44:07,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:44:11,683 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 [0] [2023-12-24 20:44:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:11,732 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2023-12-24 20:44:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 20:44:11,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-12-24 20:44:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:11,734 INFO L225 Difference]: With dead ends: 100 [2023-12-24 20:44:11,734 INFO L226 Difference]: Without dead ends: 73 [2023-12-24 20:44:11,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:44:11,736 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 26 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.5s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:11,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 181 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 9 Unknown, 0 Unchecked, 36.5s Time] [2023-12-24 20:44:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-24 20:44:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2023-12-24 20:44:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 56 states have internal predecessors, (74), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 20:44:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2023-12-24 20:44:11,753 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 20 [2023-12-24 20:44:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:11,753 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2023-12-24 20:44:11,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:44:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2023-12-24 20:44:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-24 20:44:11,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:11,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:44:11,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:11,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:11,956 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:11,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 579592343, now seen corresponding path program 1 times [2023-12-24 20:44:11,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:11,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203006128] [2023-12-24 20:44:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:11,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:11,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:11,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:44:11,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 20:44:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:12,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 20:44:12,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:44:12,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:44:12,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:44:12,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203006128] [2023-12-24 20:44:12,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203006128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:44:12,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:44:12,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 20:44:12,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608961377] [2023-12-24 20:44:12,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:44:12,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 20:44:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:44:12,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 20:44:12,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:44:12,194 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:44:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:12,369 INFO L93 Difference]: Finished difference Result 145 states and 194 transitions. [2023-12-24 20:44:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 20:44:12,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-12-24 20:44:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:12,371 INFO L225 Difference]: With dead ends: 145 [2023-12-24 20:44:12,371 INFO L226 Difference]: Without dead ends: 99 [2023-12-24 20:44:12,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 20:44:12,373 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:12,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 221 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:44:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-24 20:44:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2023-12-24 20:44:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.323943661971831) internal successors, (94), 73 states have internal predecessors, (94), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 20:44:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2023-12-24 20:44:12,398 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 20 [2023-12-24 20:44:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:12,398 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2023-12-24 20:44:12,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:44:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2023-12-24 20:44:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 20:44:12,400 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:12,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:44:12,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:12,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:12,605 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:12,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:12,605 INFO L85 PathProgramCache]: Analyzing trace with hash -752469801, now seen corresponding path program 1 times [2023-12-24 20:44:12,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:12,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130835330] [2023-12-24 20:44:12,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:12,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:12,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:12,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:44:12,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 20:44:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:12,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 20:44:12,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:12,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 20:44:12,755 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:44:12,755 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 13 treesize of output 13 [2023-12-24 20:44:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:44:12,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:44:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 20:44:12,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:44:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130835330] [2023-12-24 20:44:12,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130835330] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:44:12,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:44:12,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-12-24 20:44:12,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658266926] [2023-12-24 20:44:12,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:44:12,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 20:44:12,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:44:12,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 20:44:12,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-24 20:44:12,968 INFO L87 Difference]: Start difference. First operand 90 states and 118 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-24 20:44:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:13,763 INFO L93 Difference]: Finished difference Result 192 states and 270 transitions. [2023-12-24 20:44:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:44:13,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2023-12-24 20:44:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:13,767 INFO L225 Difference]: With dead ends: 192 [2023-12-24 20:44:13,767 INFO L226 Difference]: Without dead ends: 156 [2023-12-24 20:44:13,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-24 20:44:13,769 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 78 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:13,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 501 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 20:44:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-24 20:44:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 99. [2023-12-24 20:44:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 81 states have internal predecessors, (102), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) [2023-12-24 20:44:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2023-12-24 20:44:13,812 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 31 [2023-12-24 20:44:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:13,813 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2023-12-24 20:44:13,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-24 20:44:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2023-12-24 20:44:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-24 20:44:13,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:13,819 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:44:13,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 (5)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:14,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:14,024 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:14,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:14,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1606598365, now seen corresponding path program 1 times [2023-12-24 20:44:14,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:14,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168710702] [2023-12-24 20:44:14,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:14,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:14,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:14,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:44:14,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 20:44:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:14,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 20:44:14,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:14,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2023-12-24 20:44:14,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 34 [2023-12-24 20:44:14,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-24 20:44:14,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-12-24 20:44:14,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:14,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:14,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 [2023-12-24 20:44:14,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:14,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-12-24 20:44:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:44:14,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:44:15,647 INFO L349 Elim1Store]: treesize reduction 45, result has 52.6 percent of original size [2023-12-24 20:44:15,648 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 218 treesize of output 204 [2023-12-24 20:44:15,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2023-12-24 20:44:15,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:44:15,681 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 100 treesize of output 102 [2023-12-24 20:44:15,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-24 20:44:15,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-24 20:44:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 20:44:15,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:44:15,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168710702] [2023-12-24 20:44:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168710702] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:44:15,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:44:15,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-12-24 20:44:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140104119] [2023-12-24 20:44:15,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:44:15,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 20:44:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:44:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 20:44:15,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-12-24 20:44:15,821 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 20:44:21,024 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 [0] [2023-12-24 20:44:25,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:44:29,953 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 [0] [2023-12-24 20:44:34,014 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 [0] [2023-12-24 20:44:38,124 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 [0] [2023-12-24 20:44:42,178 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 [0] [2023-12-24 20:44:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:42,793 INFO L93 Difference]: Finished difference Result 235 states and 319 transitions. [2023-12-24 20:44:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 20:44:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-12-24 20:44:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:42,796 INFO L225 Difference]: With dead ends: 235 [2023-12-24 20:44:42,796 INFO L226 Difference]: Without dead ends: 150 [2023-12-24 20:44:42,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-12-24 20:44:42,798 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 60 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 12 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:42,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 366 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 319 Invalid, 6 Unknown, 0 Unchecked, 26.8s Time] [2023-12-24 20:44:42,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-12-24 20:44:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2023-12-24 20:44:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 108 states have (on average 1.2962962962962963) internal successors, (140), 117 states have internal predecessors, (140), 23 states have call successors, (23), 9 states have call predecessors, (23), 11 states have return successors, (26), 16 states have call predecessors, (26), 20 states have call successors, (26) [2023-12-24 20:44:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 189 transitions. [2023-12-24 20:44:42,821 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 189 transitions. Word has length 33 [2023-12-24 20:44:42,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:42,821 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 189 transitions. [2023-12-24 20:44:42,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 20:44:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 189 transitions. [2023-12-24 20:44:42,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-24 20:44:42,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:42,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:44:42,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:43,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:43,027 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:43,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash -722940018, now seen corresponding path program 1 times [2023-12-24 20:44:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:43,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060123783] [2023-12-24 20:44:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:43,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-24 20:44:43,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:43,029 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:44:43,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 (7)] Waiting until timeout for monitored process [2023-12-24 20:44:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:43,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 20:44:43,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 20:44:43,181 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:44:43,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:44:43,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060123783] [2023-12-24 20:44:43,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060123783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:44:43,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:44:43,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 20:44:43,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245315002] [2023-12-24 20:44:43,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:44:43,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 20:44:43,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:44:43,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 20:44:43,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:44:43,183 INFO L87 Difference]: Start difference. First operand 143 states and 189 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 20:44:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:43,293 INFO L93 Difference]: Finished difference Result 160 states and 207 transitions. [2023-12-24 20:44:43,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 20:44:43,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2023-12-24 20:44:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:43,299 INFO L225 Difference]: With dead ends: 160 [2023-12-24 20:44:43,299 INFO L226 Difference]: Without dead ends: 145 [2023-12-24 20:44:43,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-24 20:44:43,304 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:43,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 239 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:44:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-24 20:44:43,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2023-12-24 20:44:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 107 states have internal predecessors, (127), 19 states have call successors, (19), 9 states have call predecessors, (19), 12 states have return successors, (22), 14 states have call predecessors, (22), 16 states have call successors, (22) [2023-12-24 20:44:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 168 transitions. [2023-12-24 20:44:43,328 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 168 transitions. Word has length 35 [2023-12-24 20:44:43,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:43,328 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 168 transitions. [2023-12-24 20:44:43,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 20:44:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 168 transitions. [2023-12-24 20:44:43,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-24 20:44:43,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:43,330 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:44:43,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:43,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:43,531 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:43,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:43,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1293495713, now seen corresponding path program 1 times [2023-12-24 20:44:43,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:43,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159776408] [2023-12-24 20:44:43,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:43,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:43,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:43,533 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:44:43,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 20:44:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:43,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 20:44:43,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 20:44:43,840 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:44:43,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:44:43,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159776408] [2023-12-24 20:44:43,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159776408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:44:43,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:44:43,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 20:44:43,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868208733] [2023-12-24 20:44:43,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:44:43,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 20:44:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:44:43,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 20:44:43,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 20:44:43,842 INFO L87 Difference]: Start difference. First operand 131 states and 168 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 20:44:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:44,026 INFO L93 Difference]: Finished difference Result 239 states and 302 transitions. [2023-12-24 20:44:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 20:44:44,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-12-24 20:44:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:44,028 INFO L225 Difference]: With dead ends: 239 [2023-12-24 20:44:44,028 INFO L226 Difference]: Without dead ends: 86 [2023-12-24 20:44:44,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:44:44,030 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:44,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:44:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-24 20:44:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2023-12-24 20:44:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.3) internal successors, (78), 66 states have internal predecessors, (78), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (13), 9 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-24 20:44:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2023-12-24 20:44:44,039 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 36 [2023-12-24 20:44:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:44,039 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2023-12-24 20:44:44,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 20:44:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2023-12-24 20:44:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-24 20:44:44,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:44,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:44:44,051 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-24 20:44:44,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:44,246 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:44,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:44,246 INFO L85 PathProgramCache]: Analyzing trace with hash -927020922, now seen corresponding path program 1 times [2023-12-24 20:44:44,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:44,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677992602] [2023-12-24 20:44:44,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:44,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:44,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:44,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:44:44,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 (9)] Waiting until timeout for monitored process [2023-12-24 20:44:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:44,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 20:44:44,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-24 20:44:44,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:44:44,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:44:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677992602] [2023-12-24 20:44:44,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677992602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:44:44,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:44:44,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 20:44:44,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746332343] [2023-12-24 20:44:44,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:44:44,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 20:44:44,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:44:44,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 20:44:44,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 20:44:44,401 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 20:44:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:44,512 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2023-12-24 20:44:44,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:44:44,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-12-24 20:44:44,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:44,514 INFO L225 Difference]: With dead ends: 97 [2023-12-24 20:44:44,514 INFO L226 Difference]: Without dead ends: 95 [2023-12-24 20:44:44,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-24 20:44:44,515 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:44,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 287 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:44:44,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-24 20:44:44,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2023-12-24 20:44:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 68 states have internal predecessors, (80), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2023-12-24 20:44:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2023-12-24 20:44:44,524 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 39 [2023-12-24 20:44:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:44,525 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2023-12-24 20:44:44,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 20:44:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2023-12-24 20:44:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-24 20:44:44,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:44,526 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:44:44,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:44,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:44,731 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:44,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1959492709, now seen corresponding path program 1 times [2023-12-24 20:44:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:44,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705399482] [2023-12-24 20:44:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:44,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:44,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:44,734 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:44:44,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 20:44:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:44,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 20:44:44,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:44,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:44:44,927 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:44:44,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:44:44,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:44:45,269 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 24 treesize of output 12 [2023-12-24 20:44:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 20:44:45,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:44:45,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:44:45,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-12-24 20:44:45,798 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 33 treesize of output 25 [2023-12-24 20:44:45,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-24 20:44:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 20:44:45,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:44:45,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705399482] [2023-12-24 20:44:45,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705399482] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:44:45,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:44:45,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-12-24 20:44:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787987698] [2023-12-24 20:44:45,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:44:45,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 20:44:45,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:44:45,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 20:44:45,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-12-24 20:44:45,864 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-24 20:44:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:47,072 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2023-12-24 20:44:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 20:44:47,073 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 45 [2023-12-24 20:44:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:47,073 INFO L225 Difference]: With dead ends: 131 [2023-12-24 20:44:47,074 INFO L226 Difference]: Without dead ends: 66 [2023-12-24 20:44:47,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2023-12-24 20:44:47,075 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:47,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 350 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 20:44:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-24 20:44:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2023-12-24 20:44:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-12-24 20:44:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2023-12-24 20:44:47,082 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 45 [2023-12-24 20:44:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:47,082 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2023-12-24 20:44:47,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-24 20:44:47,083 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2023-12-24 20:44:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-24 20:44:47,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:47,083 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:44:47,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:47,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:47,294 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:47,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:47,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1736680855, now seen corresponding path program 1 times [2023-12-24 20:44:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:47,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954865599] [2023-12-24 20:44:47,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:47,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:47,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:47,297 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:44:47,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 20:44:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:47,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 20:44:47,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:47,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:44:47,509 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:44:47,510 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:44:47,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:44:47,548 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:44:47,548 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:44:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 20:44:47,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:44:48,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:44:48,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 57 [2023-12-24 20:44:48,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:44:48,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2023-12-24 20:44:48,589 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 50 treesize of output 38 [2023-12-24 20:44:48,596 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 50 treesize of output 38 [2023-12-24 20:44:48,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-12-24 20:44:48,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-24 20:44:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 20:44:48,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:44:48,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954865599] [2023-12-24 20:44:48,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954865599] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:44:48,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:44:48,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-12-24 20:44:48,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633335318] [2023-12-24 20:44:48,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:44:48,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 20:44:48,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:44:48,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 20:44:48,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-24 20:44:48,674 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-24 20:44:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:49,835 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2023-12-24 20:44:49,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 20:44:49,836 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 45 [2023-12-24 20:44:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:49,837 INFO L225 Difference]: With dead ends: 104 [2023-12-24 20:44:49,837 INFO L226 Difference]: Without dead ends: 67 [2023-12-24 20:44:49,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2023-12-24 20:44:49,838 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 51 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:49,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 300 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-24 20:44:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-24 20:44:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2023-12-24 20:44:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-12-24 20:44:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2023-12-24 20:44:49,846 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 45 [2023-12-24 20:44:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:49,846 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2023-12-24 20:44:49,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-24 20:44:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2023-12-24 20:44:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-24 20:44:49,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:49,847 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:44:49,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:50,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:50,057 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:50,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:50,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1517826137, now seen corresponding path program 1 times [2023-12-24 20:44:50,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:50,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367442273] [2023-12-24 20:44:50,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:50,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:50,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:50,059 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:44:50,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 20:44:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:50,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-24 20:44:50,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:50,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:44:50,317 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:44:50,318 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 1 case distinctions, treesize of input 23 treesize of output 20 [2023-12-24 20:44:50,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:44:50,354 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:44:50,354 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:44:50,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:44:50,869 INFO L349 Elim1Store]: treesize reduction 54, result has 34.9 percent of original size [2023-12-24 20:44:50,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 72 [2023-12-24 20:44:50,927 INFO L349 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-12-24 20:44:50,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 71 [2023-12-24 20:45:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 20:45:08,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:45:30,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:45:30,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 250 treesize of output 177 [2023-12-24 20:45:30,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:45:30,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 125 [2023-12-24 20:45:30,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:45:30,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 892 treesize of output 862 [2023-12-24 20:45:30,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:45:30,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:45:30,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1498 treesize of output 1438 [2023-12-24 20:45:30,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:45:30,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 616 treesize of output 560 [2023-12-24 20:45:30,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:45:30,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 486 treesize of output 452 [2023-12-24 20:45:33,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-24 20:45:33,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-24 20:45:33,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-12-24 20:45:33,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:45:33,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 290 treesize of output 282 [2023-12-24 20:45:35,334 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-24 20:45:35,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:45:35,851 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 26 treesize of output 20 [2023-12-24 20:45:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 20:45:35,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:45:35,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367442273] [2023-12-24 20:45:35,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367442273] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:45:35,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:45:35,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2023-12-24 20:45:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492846559] [2023-12-24 20:45:35,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:45:35,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-24 20:45:35,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:45:35,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-24 20:45:35,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=598, Unknown=8, NotChecked=0, Total=702 [2023-12-24 20:45:35,941 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 27 states, 25 states have (on average 2.12) internal successors, (53), 26 states have internal predecessors, (53), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-24 20:45:56,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:46:00,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:46:04,510 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 [0] [2023-12-24 20:46:08,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:46:12,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:46:16,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:46:20,567 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 [0] [2023-12-24 20:46:44,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:46:48,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:46:52,639 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 [0] [2023-12-24 20:46:56,815 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 [0] [2023-12-24 20:47:02,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:47:10,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:47:14,784 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 [0] [2023-12-24 20:47:18,811 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 [0] [2023-12-24 20:47:22,855 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 [0] [2023-12-24 20:47:30,954 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 [0] [2023-12-24 20:47:35,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:47:39,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:47:47,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:48:00,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:48:08,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:48:13,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:48:17,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:48:21,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:48:25,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:48:29,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:48:33,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:48:37,857 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 [0] [2023-12-24 20:48:41,934 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 [0] [2023-12-24 20:48:45,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:48:50,223 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 [0] [2023-12-24 20:48:54,260 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 [0] [2023-12-24 20:48:58,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:49:02,654 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 [0] [2023-12-24 20:49:06,907 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 [0] [2023-12-24 20:49:10,927 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 [0] [2023-12-24 20:49:15,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:49:19,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:49:23,223 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 [0] [2023-12-24 20:49:27,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:49:27,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:49:27,232 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2023-12-24 20:49:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-24 20:49:27,234 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.12) internal successors, (53), 26 states have internal predecessors, (53), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 45 [2023-12-24 20:49:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:49:27,235 INFO L225 Difference]: With dead ends: 133 [2023-12-24 20:49:27,235 INFO L226 Difference]: Without dead ends: 90 [2023-12-24 20:49:27,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 93.6s TimeCoverageRelationStatistics Valid=299, Invalid=1658, Unknown=23, NotChecked=0, Total=1980 [2023-12-24 20:49:27,236 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 99 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 40 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 171.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 171.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:49:27,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 634 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 848 Invalid, 42 Unknown, 0 Unchecked, 171.8s Time] [2023-12-24 20:49:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-24 20:49:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2023-12-24 20:49:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 64 states have internal predecessors, (72), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2023-12-24 20:49:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2023-12-24 20:49:27,251 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 45 [2023-12-24 20:49:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:49:27,251 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2023-12-24 20:49:27,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.12) internal successors, (53), 26 states have internal predecessors, (53), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-24 20:49:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2023-12-24 20:49:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-24 20:49:27,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:49:27,253 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:49:27,260 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-24 20:49:27,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:49:27,459 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:49:27,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:49:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash 870967375, now seen corresponding path program 1 times [2023-12-24 20:49:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:49:27,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872396276] [2023-12-24 20:49:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:49:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:49:27,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:49:27,461 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:49:27,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 20:49:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:49:27,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 20:49:27,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:49:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 20:49:27,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:49:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-24 20:49:27,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:49:27,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872396276] [2023-12-24 20:49:27,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872396276] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:49:27,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:49:27,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2023-12-24 20:49:27,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481786771] [2023-12-24 20:49:27,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:49:27,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 20:49:27,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:49:27,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 20:49:27,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-24 20:49:27,896 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-24 20:49:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:49:28,261 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2023-12-24 20:49:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 20:49:28,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 48 [2023-12-24 20:49:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:49:28,263 INFO L225 Difference]: With dead ends: 102 [2023-12-24 20:49:28,263 INFO L226 Difference]: Without dead ends: 71 [2023-12-24 20:49:28,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-24 20:49:28,264 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 57 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 20:49:28,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 156 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 20:49:28,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-24 20:49:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2023-12-24 20:49:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-24 20:49:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2023-12-24 20:49:28,273 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 48 [2023-12-24 20:49:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:49:28,274 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2023-12-24 20:49:28,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-24 20:49:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2023-12-24 20:49:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-24 20:49:28,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:49:28,275 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:49:28,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 20:49:28,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:49:28,484 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:49:28,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:49:28,484 INFO L85 PathProgramCache]: Analyzing trace with hash -174794930, now seen corresponding path program 1 times [2023-12-24 20:49:28,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:49:28,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494529325] [2023-12-24 20:49:28,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:49:28,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:49:28,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:49:28,486 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:49:28,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 20:49:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:49:28,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-24 20:49:28,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:49:28,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:49:28,711 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:49:28,711 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:49:28,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:49:28,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:49:28,744 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:49:28,745 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:49:29,086 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-12-24 20:49:29,086 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 50 [2023-12-24 20:49:29,105 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-24 20:49:29,106 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 1 case distinctions, treesize of input 24 treesize of output 21 [2023-12-24 20:49:29,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2023-12-24 20:49:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 20:49:29,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:49:30,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:49:30,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494529325] [2023-12-24 20:49:30,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494529325] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:49:30,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [723962522] [2023-12-24 20:49:30,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:49:30,131 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:49:30,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:49:30,162 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:49:30,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-12-24 20:49:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:49:30,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-24 20:49:30,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:49:30,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:49:30,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 20:49:30,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:49:30,495 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:49:30,496 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:49:30,877 INFO L349 Elim1Store]: treesize reduction 54, result has 34.9 percent of original size [2023-12-24 20:49:30,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 65 [2023-12-24 20:49:30,920 INFO L349 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-12-24 20:49:30,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 71 [2023-12-24 20:49:31,893 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 20:49:31,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 17 [2023-12-24 20:49:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 20:49:31,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:49:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-24 20:49:44,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [723962522] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 20:49:44,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:49:44,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14, 13] total 30 [2023-12-24 20:49:44,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335475335] [2023-12-24 20:49:44,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:49:44,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 20:49:44,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:49:44,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 20:49:44,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=927, Unknown=5, NotChecked=0, Total=1056 [2023-12-24 20:49:44,608 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-24 20:49:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:49:54,303 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2023-12-24 20:49:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 20:49:54,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2023-12-24 20:49:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:49:54,304 INFO L225 Difference]: With dead ends: 89 [2023-12-24 20:49:54,304 INFO L226 Difference]: Without dead ends: 69 [2023-12-24 20:49:54,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 163 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=151, Invalid=1102, Unknown=7, NotChecked=0, Total=1260 [2023-12-24 20:49:54,305 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-24 20:49:54,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 179 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-24 20:49:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-24 20:49:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2023-12-24 20:49:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.16) internal successors, (58), 52 states have internal predecessors, (58), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-24 20:49:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-12-24 20:49:54,315 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 55 [2023-12-24 20:49:54,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:49:54,315 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-12-24 20:49:54,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-24 20:49:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-12-24 20:49:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-24 20:49:54,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:49:54,316 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:49:54,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2023-12-24 20:49:54,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-24 20:49:54,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:49:54,720 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:49:54,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:49:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1185912180, now seen corresponding path program 1 times [2023-12-24 20:49:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:49:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126070429] [2023-12-24 20:49:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:49:54,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:49:54,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:49:54,722 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:49:54,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-24 20:49:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:49:54,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-24 20:49:54,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:49:54,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:49:54,941 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:49:54,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2023-12-24 20:49:54,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:49:54,971 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:49:54,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:49:54,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:49:55,385 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-12-24 20:49:55,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2023-12-24 20:49:55,411 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-24 20:49:55,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2023-12-24 20:49:55,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-24 20:49:56,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 20:49:56,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2023-12-24 20:49:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 20:49:56,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:50:13,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:50:13,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126070429] [2023-12-24 20:50:13,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126070429] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:50:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [268826563] [2023-12-24 20:50:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:50:13,309 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:50:13,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:50:13,313 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:50:13,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-24 20:50:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:50:13,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-24 20:50:13,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:50:13,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:50:13,626 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:50:13,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:50:13,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:50:13,656 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:50:13,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:50:13,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:50:14,652 INFO L349 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2023-12-24 20:50:14,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 60 [2023-12-24 20:50:14,680 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-24 20:50:14,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2023-12-24 20:50:14,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-24 20:50:14,737 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 20:50:14,737 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 27 treesize of output 19 [2023-12-24 20:50:23,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2023-12-24 20:50:23,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-24 20:50:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 20:50:24,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:50:24,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [268826563] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:50:24,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:50:24,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 29 [2023-12-24 20:50:24,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854146729] [2023-12-24 20:50:24,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:50:24,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-24 20:50:24,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:50:24,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-24 20:50:24,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1388, Unknown=13, NotChecked=0, Total=1560 [2023-12-24 20:50:24,687 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 28 states have internal predecessors, (75), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-24 20:50:29,383 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 [0] [2023-12-24 20:50:34,757 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 [0] [2023-12-24 20:50:38,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:50:43,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 [0] [2023-12-24 20:50:47,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:50:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:50:49,293 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2023-12-24 20:50:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-24 20:50:49,294 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 28 states have internal predecessors, (75), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 55 [2023-12-24 20:50:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:50:49,295 INFO L225 Difference]: With dead ends: 98 [2023-12-24 20:50:49,295 INFO L226 Difference]: Without dead ends: 91 [2023-12-24 20:50:49,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 137 SyntacticMatches, 9 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=543, Invalid=4274, Unknown=13, NotChecked=0, Total=4830 [2023-12-24 20:50:49,297 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 113 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 67 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2023-12-24 20:50:49,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 516 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 622 Invalid, 5 Unknown, 0 Unchecked, 22.0s Time] [2023-12-24 20:50:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-24 20:50:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2023-12-24 20:50:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.150943396226415) internal successors, (61), 56 states have internal predecessors, (61), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-24 20:50:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2023-12-24 20:50:49,319 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 55 [2023-12-24 20:50:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:50:49,319 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2023-12-24 20:50:49,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 28 states have internal predecessors, (75), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-24 20:50:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2023-12-24 20:50:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-24 20:50:49,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:50:49,321 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:50:49,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-24 20:50:49,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2023-12-24 20:50:49,721 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 20:50:49,722 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:50:49,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:50:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash -927746742, now seen corresponding path program 1 times [2023-12-24 20:50:49,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:50:49,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344271774] [2023-12-24 20:50:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:50:49,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:50:49,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:50:49,724 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:50:49,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-24 20:50:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:50:49,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 20:50:49,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:50:49,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:50:49,927 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:50:49,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:50:49,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:50:50,212 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-12-24 20:50:50,213 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 33 [2023-12-24 20:50:50,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-24 20:50:50,476 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 24 treesize of output 12 [2023-12-24 20:50:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 20:50:50,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:50:50,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:50:50,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344271774] [2023-12-24 20:50:50,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344271774] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:50:50,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1170011791] [2023-12-24 20:50:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:50:50,742 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:50:50,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:50:50,743 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:50:50,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-12-24 20:50:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:50:50,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-24 20:50:50,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:50:50,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:50:51,006 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:50:51,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:50:51,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:50:51,166 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-12-24 20:50:51,166 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 33 [2023-12-24 20:50:51,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-24 20:50:51,385 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 24 treesize of output 12 [2023-12-24 20:50:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 20:50:51,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:50:51,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1170011791] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:50:51,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:50:51,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2023-12-24 20:50:51,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382579344] [2023-12-24 20:50:51,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:50:51,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 20:50:51,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:50:51,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 20:50:51,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=253, Unknown=1, NotChecked=0, Total=306 [2023-12-24 20:50:51,520 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-24 20:50:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:50:52,232 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2023-12-24 20:50:52,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 20:50:52,233 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 55 [2023-12-24 20:50:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:50:52,233 INFO L225 Difference]: With dead ends: 80 [2023-12-24 20:50:52,233 INFO L226 Difference]: Without dead ends: 68 [2023-12-24 20:50:52,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 156 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=645, Unknown=1, NotChecked=0, Total=812 [2023-12-24 20:50:52,234 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 47 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 20:50:52,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 225 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 20:50:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-24 20:50:52,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-12-24 20:50:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 54 states have internal predecessors, (59), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-12-24 20:50:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2023-12-24 20:50:52,243 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 55 [2023-12-24 20:50:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:50:52,243 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2023-12-24 20:50:52,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-24 20:50:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2023-12-24 20:50:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-24 20:50:52,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:50:52,244 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:50:52,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2023-12-24 20:50:52,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-24 20:50:52,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:50:52,649 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:50:52,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:50:52,649 INFO L85 PathProgramCache]: Analyzing trace with hash -115493879, now seen corresponding path program 2 times [2023-12-24 20:50:52,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:50:52,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407863128] [2023-12-24 20:50:52,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 20:50:52,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:50:52,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:50:52,651 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:50:52,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-24 20:50:52,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 20:50:52,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:50:52,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 20:50:52,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:50:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-24 20:50:52,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:50:52,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:50:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407863128] [2023-12-24 20:50:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407863128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:50:52,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:50:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 20:50:52,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693956980] [2023-12-24 20:50:52,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:50:52,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 20:50:52,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:50:52,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 20:50:52,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 20:50:52,820 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-24 20:50:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:50:52,899 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2023-12-24 20:50:52,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 20:50:52,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2023-12-24 20:50:52,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:50:52,900 INFO L225 Difference]: With dead ends: 84 [2023-12-24 20:50:52,900 INFO L226 Difference]: Without dead ends: 71 [2023-12-24 20:50:52,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-24 20:50:52,900 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:50:52,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 250 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:50:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-24 20:50:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2023-12-24 20:50:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-24 20:50:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2023-12-24 20:50:52,912 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 61 [2023-12-24 20:50:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:50:52,912 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2023-12-24 20:50:52,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-24 20:50:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2023-12-24 20:50:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-24 20:50:52,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:50:52,913 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:50:52,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-24 20:50:53,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:50:53,121 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:50:53,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:50:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash 916767562, now seen corresponding path program 3 times [2023-12-24 20:50:53,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:50:53,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730979041] [2023-12-24 20:50:53,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 20:50:53,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:50:53,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:50:53,122 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:50:53,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-24 20:50:53,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-24 20:50:53,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:50:53,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-24 20:50:53,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:50:53,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2023-12-24 20:50:53,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-24 20:50:53,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2023-12-24 20:50:53,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 22 [2023-12-24 20:50:53,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 20:50:53,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:50:53,517 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:50:53,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2023-12-24 20:50:53,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:50:53,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 20:50:54,719 INFO L349 Elim1Store]: treesize reduction 56, result has 60.3 percent of original size [2023-12-24 20:50:54,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 156 treesize of output 208 [2023-12-24 20:50:54,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 69 [2023-12-24 20:50:54,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2023-12-24 20:50:54,814 INFO L349 Elim1Store]: treesize reduction 36, result has 50.7 percent of original size [2023-12-24 20:50:54,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 100 [2023-12-24 20:50:54,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2023-12-24 20:50:54,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2023-12-24 20:50:54,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:50:54,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-24 20:50:54,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-24 20:50:54,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-24 20:50:55,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-24 20:50:55,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:50:55,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2023-12-24 20:50:55,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:50:55,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 181 [2023-12-24 20:50:56,052 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-24 20:50:56,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:50:56,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:50:58,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:51:02,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2023-12-24 20:51:02,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-12-24 20:51:02,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 20:51:02,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 20:51:02,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2023-12-24 20:51:02,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2023-12-24 20:51:02,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:51:03,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:51:03,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-12-24 20:51:03,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 20:51:03,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:51:04,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-12-24 20:51:04,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 252 [2023-12-24 20:51:04,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 162 [2023-12-24 20:51:04,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 20:51:04,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:51:25,889 INFO L349 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2023-12-24 20:51:25,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 85 [2023-12-24 20:51:25,950 INFO L349 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2023-12-24 20:51:25,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 105 [2023-12-24 20:51:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 33 refuted. 5 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 20:51:28,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:52:24,841 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_is_list_containing_x_#in~l.offset|))) (or (not (= (select (select |c_#memory_$Pointer$#1.base| c_is_list_containing_x_~l.base) (bvadd c_is_list_containing_x_~l.offset (_ bv4 32))) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$#1.base| |c_is_list_containing_x_#in~l.base|) .cse0) (_ bv0 32)) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50| |c_is_list_containing_x_#in~l.offset|) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53| (_ BitVec 32))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50|))) (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50|)) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50|))) |c_is_list_containing_x_#in~l.base|) .cse0) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50| (_ BitVec 32))) (= (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50|))) (store |c_#memory_$Pointer$#1.offset| .cse2 (store (select |c_#memory_$Pointer$#1.offset| .cse2) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50|)) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50|))) |c_is_list_containing_x_#in~l.base|) .cse0) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50|)) (= |c_is_list_containing_x_#in~l.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50| (_ BitVec 32))) (= (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50|))) (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50|)) |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|))) |c_is_list_containing_x_#in~l.base|) .cse0) |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|)) (= |c_is_list_containing_x_#in~l.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50| |c_is_list_containing_x_#in~l.offset|) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53| (_ BitVec 32))) (= (select (select (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50|))) (store |c_#memory_$Pointer$#1.base| .cse4 (store (select |c_#memory_$Pointer$#1.base| .cse4) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_50|)) |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|))) |c_is_list_containing_x_#in~l.base|) .cse0) |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|))))))) is different from false [2023-12-24 20:52:29,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:52:29,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730979041] [2023-12-24 20:52:29,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730979041] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:52:29,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [251428314] [2023-12-24 20:52:29,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 20:52:29,196 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:52:29,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:52:29,197 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:52:29,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-12-24 20:52:29,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-24 20:52:29,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:52:29,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-24 20:52:29,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:52:30,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:52:30,446 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:52:30,446 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:52:30,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:52:30,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 20:52:30,602 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:52:30,602 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 20:52:34,591 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-24 20:52:34,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 42 [2023-12-24 20:52:34,687 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-24 20:52:34,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2023-12-24 20:52:40,094 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-12-24 20:52:40,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 56 [2023-12-24 20:52:40,166 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-12-24 20:52:40,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2023-12-24 20:52:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 31 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 20:52:53,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:53:55,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:53:55,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2193 treesize of output 1730 [2023-12-24 20:53:56,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:53:56,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1725 treesize of output 898 [2023-12-24 20:55:30,462 WARN L293 SmtUtils]: Spent 1.57m on a formula simplification. DAG size of input: 111 DAG size of output: 91 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 20:55:30,462 INFO L349 Elim1Store]: treesize reduction 98, result has 63.0 percent of original size [2023-12-24 20:55:30,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 200463 treesize of output 175899 [2023-12-24 20:55:31,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:57:37,125 WARN L293 SmtUtils]: Spent 2.07m on a formula simplification. DAG size of input: 109 DAG size of output: 73 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 20:57:37,125 INFO L349 Elim1Store]: treesize reduction 130, result has 55.0 percent of original size [2023-12-24 20:57:37,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 882829 treesize of output 778649 [2023-12-24 20:57:40,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:40,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 23088 treesize of output 20458 [2023-12-24 20:57:42,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:42,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25372 treesize of output 23300 Received shutdown request... [2023-12-24 20:57:59,482 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 20:57:59,482 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 20:57:59,501 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 20:57:59,796 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 20:57:59,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-12-24 20:58:00,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-24 20:58:00,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:58:00,204 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 63 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-31-4-3-2-2-2-2-4-3-4-3-3-2-3-3-3-2-2-2-2-3-2-3-2-2-2-1 context. [2023-12-24 20:58:00,208 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:58:00,210 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 20:58:00,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 08:58:00 BoogieIcfgContainer [2023-12-24 20:58:00,212 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 20:58:00,213 INFO L158 Benchmark]: Toolchain (without parser) took 867347.02ms. Allocated memory was 271.6MB in the beginning and 565.2MB in the end (delta: 293.6MB). Free memory was 221.8MB in the beginning and 210.6MB in the end (delta: 11.2MB). Peak memory consumption was 332.9MB. Max. memory is 8.0GB. [2023-12-24 20:58:00,217 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 212.9MB. Free memory was 165.7MB in the beginning and 165.5MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 20:58:00,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.39ms. Allocated memory is still 271.6MB. Free memory was 221.6MB in the beginning and 202.9MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 20:58:00,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.25ms. Allocated memory is still 271.6MB. Free memory was 202.7MB in the beginning and 200.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 20:58:00,217 INFO L158 Benchmark]: Boogie Preprocessor took 58.69ms. Allocated memory is still 271.6MB. Free memory was 200.6MB in the beginning and 197.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 20:58:00,217 INFO L158 Benchmark]: RCFGBuilder took 544.10ms. Allocated memory is still 271.6MB. Free memory was 197.5MB in the beginning and 229.2MB in the end (delta: -31.7MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2023-12-24 20:58:00,217 INFO L158 Benchmark]: TraceAbstraction took 866249.21ms. Allocated memory was 271.6MB in the beginning and 565.2MB in the end (delta: 293.6MB). Free memory was 228.7MB in the beginning and 210.6MB in the end (delta: 18.0MB). Peak memory consumption was 338.4MB. Max. memory is 8.0GB. [2023-12-24 20:58:00,218 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.48ms. Allocated memory is still 212.9MB. Free memory was 165.7MB in the beginning and 165.5MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 445.39ms. Allocated memory is still 271.6MB. Free memory was 221.6MB in the beginning and 202.9MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.25ms. Allocated memory is still 271.6MB. Free memory was 202.7MB in the beginning and 200.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.69ms. Allocated memory is still 271.6MB. Free memory was 200.6MB in the beginning and 197.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 544.10ms. Allocated memory is still 271.6MB. Free memory was 197.5MB in the beginning and 229.2MB in the end (delta: -31.7MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * TraceAbstraction took 866249.21ms. Allocated memory was 271.6MB in the beginning and 565.2MB in the end (delta: 293.6MB). Free memory was 228.7MB in the beginning and 210.6MB in the end (delta: 18.0MB). Peak memory consumption was 338.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 20). Cancelled while NwaCegarLoop was analyzing trace of length 63 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-31-4-3-2-2-2-2-4-3-4-3-3-2-3-3-3-2-2-2-2-3-2-3-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 866.2s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 334.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 62 mSolverCounterUnknown, 669 SdHoareTripleChecker+Valid, 262.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 4600 SdHoareTripleChecker+Invalid, 260.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3831 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3019 IncrementalHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 769 mSDtfsCounter, 3019 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1372 GetRequests, 1059 SyntacticMatches, 25 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2526 ImplicationChecksByTransitivity, 148.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=5, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 158 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 97.9s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1083 ConstructedInterpolants, 100 QuantifiedInterpolants, 12088 SizeOfPredicates, 241 NumberOfNonLiveVariables, 3300 ConjunctsInSsa, 398 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 432/527 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown