/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-fpi/mods.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 20:39:04,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 20:39:04,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 20:39:04,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 20:39:04,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 20:39:04,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 20:39:04,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 20:39:04,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 20:39:04,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 20:39:04,392 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 20:39:04,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 20:39:04,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 20:39:04,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 20:39:04,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 20:39:04,394 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 20:39:04,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 20:39:04,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 20:39:04,395 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 20:39:04,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 20:39:04,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 20:39:04,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 20:39:04,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 20:39:04,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 20:39:04,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 20:39:04,396 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 20:39:04,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 20:39:04,396 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 20:39:04,397 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 20:39:04,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 20:39:04,397 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 20:39:04,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 20:39:04,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 20:39:04,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 20:39:04,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 20:39:04,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:39:04,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 20:39:04,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 20:39:04,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 20:39:04,399 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 20:39:04,399 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 20:39:04,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 20:39:04,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 20:39:04,399 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 20:39:04,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 20:39:04,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 20:39:04,400 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 20:39:04,400 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 20:39:04,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 20:39:04,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 20:39:04,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 20:39:04,593 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 20:39:04,593 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 20:39:04,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/mods.c [2023-12-21 20:39:05,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 20:39:05,760 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 20:39:05,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/mods.c [2023-12-21 20:39:05,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1620d6337/a2e10c0f25c34450951dbbf138dd483a/FLAGddfe4c3a5 [2023-12-21 20:39:05,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1620d6337/a2e10c0f25c34450951dbbf138dd483a [2023-12-21 20:39:05,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 20:39:05,794 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 20:39:05,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 20:39:05,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 20:39:05,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 20:39:05,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:05,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2feefdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05, skipping insertion in model container [2023-12-21 20:39:05,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:05,817 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 20:39:05,912 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/mods.c[587,600] [2023-12-21 20:39:05,928 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:39:05,937 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 20:39:05,947 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/mods.c[587,600] [2023-12-21 20:39:05,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:39:05,973 INFO L206 MainTranslator]: Completed translation [2023-12-21 20:39:05,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05 WrapperNode [2023-12-21 20:39:05,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 20:39:05,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 20:39:05,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 20:39:05,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 20:39:05,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:05,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:05,999 INFO L138 Inliner]: procedures = 19, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103 [2023-12-21 20:39:05,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 20:39:06,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 20:39:06,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 20:39:06,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 20:39:06,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:06,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:06,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:06,017 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 7, 5, 7]. 33 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 5 writes are split as follows [0, 0, 2, 3]. [2023-12-21 20:39:06,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:06,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:06,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:06,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:06,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:06,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:06,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 20:39:06,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 20:39:06,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 20:39:06,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 20:39:06,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (1/1) ... [2023-12-21 20:39:06,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:39:06,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 20:39:06,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 20:39:06,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 20:39:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 20:39:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 20:39:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 20:39:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 20:39:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-21 20:39:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 20:39:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-21 20:39:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-21 20:39:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-21 20:39:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-12-21 20:39:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 20:39:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 20:39:06,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 20:39:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-21 20:39:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-21 20:39:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-21 20:39:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-12-21 20:39:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 20:39:06,147 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 20:39:06,148 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 20:39:06,447 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 20:39:06,472 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 20:39:06,472 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-21 20:39:06,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:39:06 BoogieIcfgContainer [2023-12-21 20:39:06,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 20:39:06,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 20:39:06,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 20:39:06,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 20:39:06,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:39:05" (1/3) ... [2023-12-21 20:39:06,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e3a19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:39:06, skipping insertion in model container [2023-12-21 20:39:06,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:05" (2/3) ... [2023-12-21 20:39:06,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e3a19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:39:06, skipping insertion in model container [2023-12-21 20:39:06,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:39:06" (3/3) ... [2023-12-21 20:39:06,478 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2023-12-21 20:39:06,491 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 20:39:06,491 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 20:39:06,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 20:39:06,530 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;@10349c0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 20:39:06,530 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 20:39:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:39:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 20:39:06,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:39:06,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:39:06,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:39:06,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:39:06,543 INFO L85 PathProgramCache]: Analyzing trace with hash -270928915, now seen corresponding path program 1 times [2023-12-21 20:39:06,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:39:06,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445073503] [2023-12-21 20:39:06,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:39:06,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:39:06,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:39:06,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:39:06,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 20:39:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:39:06,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 20:39:06,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:39:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:39:06,637 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:39:06,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:39:06,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445073503] [2023-12-21 20:39:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445073503] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:39:06,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:39:06,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 20:39:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039915313] [2023-12-21 20:39:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:39:06,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 20:39:06,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:39:06,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 20:39:06,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:39:06,662 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:39:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:39:06,830 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2023-12-21 20:39:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 20:39:06,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 20:39:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:39:06,837 INFO L225 Difference]: With dead ends: 37 [2023-12-21 20:39:06,837 INFO L226 Difference]: Without dead ends: 17 [2023-12-21 20:39:06,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:39:06,841 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:39:06,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 20:39:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-21 20:39:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-21 20:39:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:39:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-21 20:39:06,869 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 15 [2023-12-21 20:39:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:39:06,870 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-21 20:39:06,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:39:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-21 20:39:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 20:39:06,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:39:06,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:39:06,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-21 20:39:07,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:39:07,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:39:07,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:39:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash -863276055, now seen corresponding path program 1 times [2023-12-21 20:39:07,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:39:07,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299452194] [2023-12-21 20:39:07,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:39:07,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:39:07,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:39:07,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:39:07,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 20:39:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:39:07,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 20:39:07,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:39:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:39:07,320 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:39:07,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:39:07,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299452194] [2023-12-21 20:39:07,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299452194] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:39:07,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:39:07,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 20:39:07,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299276515] [2023-12-21 20:39:07,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:39:07,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 20:39:07,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:39:07,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 20:39:07,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 20:39:07,329 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:39:07,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:39:07,538 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-12-21 20:39:07,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 20:39:07,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 20:39:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:39:07,540 INFO L225 Difference]: With dead ends: 38 [2023-12-21 20:39:07,540 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 20:39:07,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 20:39:07,541 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:39:07,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 20:39:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 20:39:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2023-12-21 20:39:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:39:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-21 20:39:07,546 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2023-12-21 20:39:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:39:07,546 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-21 20:39:07,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:39:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-21 20:39:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 20:39:07,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:39:07,547 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-21 20:39:07,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-21 20:39:07,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:39:07,748 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:39:07,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:39:07,749 INFO L85 PathProgramCache]: Analyzing trace with hash 405160390, now seen corresponding path program 1 times [2023-12-21 20:39:07,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:39:07,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910806109] [2023-12-21 20:39:07,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:39:07,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:39:07,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:39:07,751 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:39:07,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 20:39:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:39:08,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-21 20:39:08,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:39:08,192 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:39:08,218 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 18 treesize of output 19 [2023-12-21 20:39:08,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:39:08,288 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 18 treesize of output 19 [2023-12-21 20:39:08,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:39:08,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 89 treesize of output 59 [2023-12-21 20:39:08,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:39:08,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 143 treesize of output 93 [2023-12-21 20:39:08,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:39:08,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 129 treesize of output 99 [2023-12-21 20:39:08,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:39:08,790 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 169 treesize of output 99 [2023-12-21 20:39:08,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:39:08,931 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 243 treesize of output 213 [2023-12-21 20:39:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:39:08,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:40:03,773 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 573 treesize of output 541 [2023-12-21 20:40:07,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:40:07,731 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 4138 treesize of output 3946 [2023-12-21 20:40:23,536 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 573 treesize of output 541 [2023-12-21 20:40:25,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:40:25,240 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 8286 treesize of output 7902 [2023-12-21 20:40:53,595 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ extract 63 32) (_ bv1 64))) (.cse19 ((_ extract 31 0) (_ bv1 64)))) (let ((.cse38 (= (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|) (_ bv0 32))) (.cse75 (concat .cse10 .cse19)) (.cse4 (let ((.cse80 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse80 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse37 (let ((.cse78 (let ((.cse79 (bvadd .cse75 .cse4))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))))) (bvsrem (let ((.cse77 (bvadd .cse75 .cse78))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77))) (bvadd (_ bv1 64) .cse78)))) (.cse24 (not .cse38)) (.cse39 (let ((.cse74 (let ((.cse76 (bvadd (concat ((_ extract 63 32) (_ bv0 64)) ((_ extract 31 0) (_ bv0 64))) .cse75))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))))) (bvsrem (let ((.cse73 (bvadd .cse74 .cse75))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73))) (bvadd .cse74 (_ bv1 64)))))) (and (let ((.cse5 ((_ extract 31 0) .cse39))) (or (and (forall ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (or (= ((_ extract 31 0) (let ((.cse1 (concat v_arrayElimCell_16 v_arrayElimCell_15))) (let ((.cse2 (let ((.cse3 (bvadd .cse1 .cse4))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))))) (bvsrem (let ((.cse0 (bvadd .cse1 .cse2))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0))) (bvadd .cse2 (_ bv1 64)))))) .cse5) (= ((_ extract 31 0) (let ((.cse8 (concat v_arrayElimCell_16 .cse10))) (let ((.cse7 (let ((.cse9 (bvadd .cse4 .cse8))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))))) (bvsrem (let ((.cse6 (bvadd .cse7 .cse8))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6))) (bvadd .cse7 (_ bv1 64)))))) .cse5))) (forall ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (= ((_ extract 31 0) (let ((.cse12 (concat v_arrayElimCell_16 v_arrayElimCell_15))) (let ((.cse13 (let ((.cse14 (bvadd .cse12 .cse4))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))))) (bvsrem (let ((.cse11 (bvadd .cse12 .cse13))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11))) (bvadd .cse13 (_ bv1 64)))))) .cse5)) (forall ((v_arrayElimCell_15 (_ BitVec 32))) (or (= ((_ extract 31 0) (let ((.cse16 (concat .cse19 v_arrayElimCell_15))) (let ((.cse17 (let ((.cse18 (bvadd .cse16 .cse4))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18))))) (bvsrem (let ((.cse15 (bvadd .cse16 .cse17))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))) (bvadd (_ bv1 64) .cse17))))) .cse5) (forall ((v_arrayElimCell_16 (_ BitVec 32))) (= ((_ extract 31 0) (let ((.cse21 (concat v_arrayElimCell_16 v_arrayElimCell_15))) (let ((.cse22 (let ((.cse23 (bvadd .cse21 .cse4))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23))))) (bvsrem (let ((.cse20 (bvadd .cse21 .cse22))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20))) (bvadd .cse22 (_ bv1 64)))))) .cse5)))) .cse24 (forall ((v_arrayElimCell_15 (_ BitVec 32))) (or (= ((_ extract 31 0) (let ((.cse26 (concat .cse19 v_arrayElimCell_15))) (let ((.cse27 (let ((.cse28 (bvadd .cse26 .cse4))) (concat ((_ extract 63 32) .cse28) ((_ extract 31 0) .cse28))))) (bvsrem (let ((.cse25 (bvadd .cse26 .cse27))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))) (bvadd (_ bv1 64) .cse27))))) .cse5) (forall ((v_arrayElimCell_16 (_ BitVec 32))) (or (= ((_ extract 31 0) (let ((.cse30 (concat v_arrayElimCell_16 v_arrayElimCell_15))) (let ((.cse31 (let ((.cse32 (bvadd .cse30 .cse4))) (concat ((_ extract 63 32) .cse32) ((_ extract 31 0) .cse32))))) (bvsrem (let ((.cse29 (bvadd .cse30 .cse31))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29))) (bvadd .cse31 (_ bv1 64)))))) .cse5) (= ((_ extract 31 0) (let ((.cse35 (concat v_arrayElimCell_16 .cse10))) (let ((.cse34 (let ((.cse36 (bvadd .cse4 .cse35))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))))) (bvsrem (let ((.cse33 (bvadd .cse34 .cse35))) (concat ((_ extract 63 32) .cse33) ((_ extract 31 0) .cse33))) (bvadd .cse34 (_ bv1 64)))))) .cse5)))))) (and (= ((_ extract 31 0) .cse37) .cse5) .cse38))) (let ((.cse40 ((_ extract 63 32) .cse39))) (or (and (= .cse40 ((_ extract 63 32) .cse37)) .cse38) (and (forall ((v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= .cse40 ((_ extract 63 32) (let ((.cse43 (concat v_arrayElimCell_13 v_arrayElimCell_12))) (let ((.cse42 (let ((.cse44 (bvadd .cse4 .cse43))) (concat ((_ extract 63 32) .cse44) ((_ extract 31 0) .cse44))))) (bvsrem (let ((.cse41 (bvadd .cse42 .cse43))) (concat ((_ extract 63 32) .cse41) ((_ extract 31 0) .cse41))) (bvadd .cse42 (_ bv1 64)))))))) (forall ((v_arrayElimCell_13 (_ BitVec 32))) (or (forall ((v_arrayElimCell_12 (_ BitVec 32))) (= .cse40 ((_ extract 63 32) (let ((.cse47 (concat v_arrayElimCell_13 v_arrayElimCell_12))) (let ((.cse46 (let ((.cse48 (bvadd .cse4 .cse47))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))))) (bvsrem (let ((.cse45 (bvadd .cse46 .cse47))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45))) (bvadd .cse46 (_ bv1 64)))))))) (= .cse40 ((_ extract 63 32) (let ((.cse51 (concat v_arrayElimCell_13 .cse10))) (let ((.cse50 (let ((.cse52 (bvadd .cse4 .cse51))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))))) (bvsrem (let ((.cse49 (bvadd .cse50 .cse51))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49))) (bvadd .cse50 (_ bv1 64))))))))) (forall ((v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (or (= .cse40 ((_ extract 63 32) (let ((.cse55 (concat v_arrayElimCell_13 v_arrayElimCell_12))) (let ((.cse54 (let ((.cse56 (bvadd .cse4 .cse55))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))))) (bvsrem (let ((.cse53 (bvadd .cse54 .cse55))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) (bvadd .cse54 (_ bv1 64))))))) (= .cse40 ((_ extract 63 32) (let ((.cse58 (concat .cse19 v_arrayElimCell_12))) (let ((.cse59 (let ((.cse60 (bvadd .cse58 .cse4))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))))) (bvsrem (let ((.cse57 (bvadd .cse58 .cse59))) (concat ((_ extract 63 32) .cse57) ((_ extract 31 0) .cse57))) (bvadd (_ bv1 64) .cse59)))))))) (forall ((v_arrayElimCell_13 (_ BitVec 32))) (or (forall ((v_arrayElimCell_12 (_ BitVec 32))) (or (= .cse40 ((_ extract 63 32) (let ((.cse63 (concat v_arrayElimCell_13 v_arrayElimCell_12))) (let ((.cse62 (let ((.cse64 (bvadd .cse4 .cse63))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64))))) (bvsrem (let ((.cse61 (bvadd .cse62 .cse63))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) (bvadd .cse62 (_ bv1 64))))))) (= .cse40 ((_ extract 63 32) (let ((.cse66 (concat .cse19 v_arrayElimCell_12))) (let ((.cse67 (let ((.cse68 (bvadd .cse66 .cse4))) (concat ((_ extract 63 32) .cse68) ((_ extract 31 0) .cse68))))) (bvsrem (let ((.cse65 (bvadd .cse66 .cse67))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65))) (bvadd (_ bv1 64) .cse67)))))))) (= .cse40 ((_ extract 63 32) (let ((.cse71 (concat v_arrayElimCell_13 .cse10))) (let ((.cse70 (let ((.cse72 (bvadd .cse4 .cse71))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72))))) (bvsrem (let ((.cse69 (bvadd .cse70 .cse71))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69))) (bvadd .cse70 (_ bv1 64))))))))) .cse24))))))) is different from true [2023-12-21 20:40:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-21 20:40:53,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:40:53,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910806109] [2023-12-21 20:40:53,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910806109] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:40:53,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:40:53,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-12-21 20:40:53,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312583171] [2023-12-21 20:40:53,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:40:53,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 20:40:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:40:53,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 20:40:53,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=4, NotChecked=36, Total=420 [2023-12-21 20:40:53,609 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:40:59,631 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse84 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse84 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse1 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 ((_ extract 63 32) (_ bv1 64))) (.cse21 ((_ extract 31 0) (_ bv1 64)))) (let ((.cse43 ((_ extract 63 32) (_ bv0 64))) (.cse0 ((_ extract 31 0) (_ bv0 64))) (.cse40 (= (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|) (_ bv0 32))) (.cse79 (concat .cse12 .cse21)) (.cse6 (concat .cse42 .cse1))) (let ((.cse39 (let ((.cse82 (let ((.cse83 (bvadd .cse79 .cse6))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))))) (bvsrem (let ((.cse81 (bvadd .cse79 .cse82))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81))) (bvadd (_ bv1 64) .cse82)))) (.cse26 (not .cse40)) (.cse41 (let ((.cse78 (let ((.cse80 (bvadd (concat .cse43 .cse0) .cse79))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))))) (bvsrem (let ((.cse77 (bvadd .cse78 .cse79))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77))) (bvadd .cse78 (_ bv1 64)))))) (and (= .cse0 .cse1) (let ((.cse7 ((_ extract 31 0) .cse41))) (or (and (forall ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (or (= ((_ extract 31 0) (let ((.cse3 (concat v_arrayElimCell_16 v_arrayElimCell_15))) (let ((.cse4 (let ((.cse5 (bvadd .cse3 .cse6))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5))))) (bvsrem (let ((.cse2 (bvadd .cse3 .cse4))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))) (bvadd .cse4 (_ bv1 64)))))) .cse7) (= ((_ extract 31 0) (let ((.cse10 (concat v_arrayElimCell_16 .cse12))) (let ((.cse9 (let ((.cse11 (bvadd .cse6 .cse10))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11))))) (bvsrem (let ((.cse8 (bvadd .cse9 .cse10))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))) (bvadd .cse9 (_ bv1 64)))))) .cse7))) (forall ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (= ((_ extract 31 0) (let ((.cse14 (concat v_arrayElimCell_16 v_arrayElimCell_15))) (let ((.cse15 (let ((.cse16 (bvadd .cse14 .cse6))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))))) (bvsrem (let ((.cse13 (bvadd .cse14 .cse15))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13))) (bvadd .cse15 (_ bv1 64)))))) .cse7)) (forall ((v_arrayElimCell_15 (_ BitVec 32))) (or (= ((_ extract 31 0) (let ((.cse18 (concat .cse21 v_arrayElimCell_15))) (let ((.cse19 (let ((.cse20 (bvadd .cse18 .cse6))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20))))) (bvsrem (let ((.cse17 (bvadd .cse18 .cse19))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17))) (bvadd (_ bv1 64) .cse19))))) .cse7) (forall ((v_arrayElimCell_16 (_ BitVec 32))) (= ((_ extract 31 0) (let ((.cse23 (concat v_arrayElimCell_16 v_arrayElimCell_15))) (let ((.cse24 (let ((.cse25 (bvadd .cse23 .cse6))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))))) (bvsrem (let ((.cse22 (bvadd .cse23 .cse24))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))) (bvadd .cse24 (_ bv1 64)))))) .cse7)))) .cse26 (forall ((v_arrayElimCell_15 (_ BitVec 32))) (or (= ((_ extract 31 0) (let ((.cse28 (concat .cse21 v_arrayElimCell_15))) (let ((.cse29 (let ((.cse30 (bvadd .cse28 .cse6))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30))))) (bvsrem (let ((.cse27 (bvadd .cse28 .cse29))) (concat ((_ extract 63 32) .cse27) ((_ extract 31 0) .cse27))) (bvadd (_ bv1 64) .cse29))))) .cse7) (forall ((v_arrayElimCell_16 (_ BitVec 32))) (or (= ((_ extract 31 0) (let ((.cse32 (concat v_arrayElimCell_16 v_arrayElimCell_15))) (let ((.cse33 (let ((.cse34 (bvadd .cse32 .cse6))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34))))) (bvsrem (let ((.cse31 (bvadd .cse32 .cse33))) (concat ((_ extract 63 32) .cse31) ((_ extract 31 0) .cse31))) (bvadd .cse33 (_ bv1 64)))))) .cse7) (= ((_ extract 31 0) (let ((.cse37 (concat v_arrayElimCell_16 .cse12))) (let ((.cse36 (let ((.cse38 (bvadd .cse6 .cse37))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38))))) (bvsrem (let ((.cse35 (bvadd .cse36 .cse37))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))) (bvadd .cse36 (_ bv1 64)))))) .cse7)))))) (and (= ((_ extract 31 0) .cse39) .cse7) .cse40))) (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) (= .cse42 .cse43) (let ((.cse44 ((_ extract 63 32) .cse41))) (or (and (= .cse44 ((_ extract 63 32) .cse39)) .cse40) (and (forall ((v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= .cse44 ((_ extract 63 32) (let ((.cse47 (concat v_arrayElimCell_13 v_arrayElimCell_12))) (let ((.cse46 (let ((.cse48 (bvadd .cse6 .cse47))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))))) (bvsrem (let ((.cse45 (bvadd .cse46 .cse47))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45))) (bvadd .cse46 (_ bv1 64)))))))) (forall ((v_arrayElimCell_13 (_ BitVec 32))) (or (forall ((v_arrayElimCell_12 (_ BitVec 32))) (= .cse44 ((_ extract 63 32) (let ((.cse51 (concat v_arrayElimCell_13 v_arrayElimCell_12))) (let ((.cse50 (let ((.cse52 (bvadd .cse6 .cse51))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))))) (bvsrem (let ((.cse49 (bvadd .cse50 .cse51))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49))) (bvadd .cse50 (_ bv1 64)))))))) (= .cse44 ((_ extract 63 32) (let ((.cse55 (concat v_arrayElimCell_13 .cse12))) (let ((.cse54 (let ((.cse56 (bvadd .cse6 .cse55))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))))) (bvsrem (let ((.cse53 (bvadd .cse54 .cse55))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) (bvadd .cse54 (_ bv1 64))))))))) (forall ((v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (or (= .cse44 ((_ extract 63 32) (let ((.cse59 (concat v_arrayElimCell_13 v_arrayElimCell_12))) (let ((.cse58 (let ((.cse60 (bvadd .cse6 .cse59))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))))) (bvsrem (let ((.cse57 (bvadd .cse58 .cse59))) (concat ((_ extract 63 32) .cse57) ((_ extract 31 0) .cse57))) (bvadd .cse58 (_ bv1 64))))))) (= .cse44 ((_ extract 63 32) (let ((.cse62 (concat .cse21 v_arrayElimCell_12))) (let ((.cse63 (let ((.cse64 (bvadd .cse62 .cse6))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64))))) (bvsrem (let ((.cse61 (bvadd .cse62 .cse63))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) (bvadd (_ bv1 64) .cse63)))))))) (forall ((v_arrayElimCell_13 (_ BitVec 32))) (or (forall ((v_arrayElimCell_12 (_ BitVec 32))) (or (= .cse44 ((_ extract 63 32) (let ((.cse67 (concat v_arrayElimCell_13 v_arrayElimCell_12))) (let ((.cse66 (let ((.cse68 (bvadd .cse6 .cse67))) (concat ((_ extract 63 32) .cse68) ((_ extract 31 0) .cse68))))) (bvsrem (let ((.cse65 (bvadd .cse66 .cse67))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65))) (bvadd .cse66 (_ bv1 64))))))) (= .cse44 ((_ extract 63 32) (let ((.cse70 (concat .cse21 v_arrayElimCell_12))) (let ((.cse71 (let ((.cse72 (bvadd .cse70 .cse6))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72))))) (bvsrem (let ((.cse69 (bvadd .cse70 .cse71))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69))) (bvadd (_ bv1 64) .cse71)))))))) (= .cse44 ((_ extract 63 32) (let ((.cse75 (concat v_arrayElimCell_13 .cse12))) (let ((.cse74 (let ((.cse76 (bvadd .cse6 .cse75))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))))) (bvsrem (let ((.cse73 (bvadd .cse74 .cse75))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73))) (bvadd .cse74 (_ bv1 64))))))))) .cse26)))))))) is different from true [2023-12-21 20:41:03,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:41:16,001 WARN L293 SmtUtils]: Spent 9.66s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:41:22,025 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 [] [2023-12-21 20:41:26,047 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 [] [2023-12-21 20:41:27,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:41:37,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:42:04,758 WARN L293 SmtUtils]: Spent 14.16s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:42:09,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:42:11,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:42:16,330 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 [] [2023-12-21 20:42:20,338 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 [] [2023-12-21 20:42:21,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:42:45,758 WARN L293 SmtUtils]: Spent 9.80s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:42:47,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:42:50,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:42:54,109 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 [] [2023-12-21 20:42:57,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:42:58,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:43:03,844 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 [] [2023-12-21 20:43:07,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:43:11,530 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 [] [2023-12-21 20:43:18,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:43:47,591 WARN L293 SmtUtils]: Spent 16.21s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:43:49,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:44:16,541 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 74 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:44:20,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:44:21,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:44:25,984 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 [] [2023-12-21 20:44:30,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:44:34,535 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 [] [2023-12-21 20:44:38,562 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 [] [2023-12-21 20:44:52,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:44:56,569 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 [] [2023-12-21 20:44:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:44:56,570 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2023-12-21 20:44:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 20:44:56,594 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-21 20:44:56,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:44:56,596 INFO L225 Difference]: With dead ends: 52 [2023-12-21 20:44:56,596 INFO L226 Difference]: Without dead ends: 50 [2023-12-21 20:44:56,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 190.6s TimeCoverageRelationStatistics Valid=135, Invalid=619, Unknown=10, NotChecked=106, Total=870 [2023-12-21 20:44:56,597 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 12 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 105.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:44:56,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 128 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 234 Invalid, 14 Unknown, 74 Unchecked, 105.6s Time] [2023-12-21 20:44:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-21 20:44:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2023-12-21 20:44:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:44:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2023-12-21 20:44:56,607 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 19 [2023-12-21 20:44:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:44:56,608 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2023-12-21 20:44:56,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:44:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2023-12-21 20:44:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-21 20:44:56,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:44:56,609 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:44:56,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 20:44:56,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:44:56,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:44:56,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:44:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1637112026, now seen corresponding path program 2 times [2023-12-21 20:44:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:44:56,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143777994] [2023-12-21 20:44:56,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:44:56,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:44:56,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:44:56,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:44:56,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 20:44:57,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:44:57,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:44:57,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 20:44:57,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:44:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 20:44:59,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:45:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 20:45:00,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:45:00,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143777994] [2023-12-21 20:45:00,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143777994] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:45:00,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:45:00,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-21 20:45:00,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006813470] [2023-12-21 20:45:00,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:45:00,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 20:45:00,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:45:00,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 20:45:00,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-21 20:45:00,809 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:45:05,378 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2023-12-21 20:45:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 20:45:05,378 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-21 20:45:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:45:05,379 INFO L225 Difference]: With dead ends: 84 [2023-12-21 20:45:05,379 INFO L226 Difference]: Without dead ends: 47 [2023-12-21 20:45:05,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-12-21 20:45:05,380 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 86 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-21 20:45:05,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 58 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-21 20:45:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-21 20:45:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2023-12-21 20:45:05,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2023-12-21 20:45:05,387 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 21 [2023-12-21 20:45:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:45:05,387 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-12-21 20:45:05,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2023-12-21 20:45:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 20:45:05,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:45:05,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:45:05,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 20:45:05,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:05,589 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:45:05,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:45:05,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1374136321, now seen corresponding path program 3 times [2023-12-21 20:45:05,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:45:05,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984593196] [2023-12-21 20:45:05,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:45:05,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:05,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:45:05,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:45:05,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 20:45:05,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 20:45:05,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:45:05,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 20:45:05,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:45:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 20:45:08,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:45:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 20:45:11,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:45:11,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984593196] [2023-12-21 20:45:11,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984593196] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:45:11,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:45:11,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-21 20:45:11,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624646236] [2023-12-21 20:45:11,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:45:11,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 20:45:11,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:45:11,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 20:45:11,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-21 20:45:11,077 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:45:16,820 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2023-12-21 20:45:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 20:45:16,821 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-21 20:45:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:45:16,822 INFO L225 Difference]: With dead ends: 89 [2023-12-21 20:45:16,822 INFO L226 Difference]: Without dead ends: 66 [2023-12-21 20:45:16,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-12-21 20:45:16,823 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 159 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:45:16,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 70 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-21 20:45:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-21 20:45:16,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2023-12-21 20:45:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2023-12-21 20:45:16,832 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2023-12-21 20:45:16,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:45:16,833 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2023-12-21 20:45:16,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2023-12-21 20:45:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 20:45:16,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:45:16,833 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:45:16,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-21 20:45:17,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:17,043 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:45:17,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:45:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1546241993, now seen corresponding path program 4 times [2023-12-21 20:45:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:45:17,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636627542] [2023-12-21 20:45:17,044 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:45:17,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:45:17,045 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:45:17,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-21 20:45:18,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:45:18,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:45:18,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-21 20:45:18,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:45:18,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:45:18,380 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 18 treesize of output 19 [2023-12-21 20:45:18,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:45:18,687 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 18 treesize of output 19 [2023-12-21 20:45:19,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:45:19,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:19,110 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 39 treesize of output 45 [2023-12-21 20:45:20,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:20,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 89 treesize of output 59 [2023-12-21 20:45:21,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:21,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 129 treesize of output 99 [2023-12-21 20:45:22,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:22,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 239 treesize of output 151 [2023-12-21 20:45:23,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:23,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 121 [2023-12-21 20:45:25,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:25,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 185 treesize of output 161 [2023-12-21 20:45:57,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:57,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 237 [2023-12-21 20:45:58,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:58,921 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 341 treesize of output 211 [2023-12-21 20:46:08,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:46:08,898 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 927 treesize of output 885 [2023-12-21 20:46:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:46:13,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:51:12,964 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 3767 treesize of output 3607 [2023-12-21 20:51:16,475 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-21 20:51:16,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:51:16,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636627542] [2023-12-21 20:51:16,476 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-21 20:51:16,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-12-21 20:51:16,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-21 20:51:16,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:51:16,677 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyEliminationToAtom(QuantifierPusher.java:291) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 53 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 73 more [2023-12-21 20:51:16,681 INFO L158 Benchmark]: Toolchain (without parser) took 730887.70ms. Allocated memory is still 240.1MB. Free memory was 200.8MB in the beginning and 129.8MB in the end (delta: 71.0MB). Peak memory consumption was 131.6MB. Max. memory is 8.0GB. [2023-12-21 20:51:16,681 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 197.1MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 20:51:16,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.80ms. Allocated memory is still 240.1MB. Free memory was 200.5MB in the beginning and 188.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 20:51:16,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.40ms. Allocated memory is still 240.1MB. Free memory was 188.2MB in the beginning and 186.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 20:51:16,682 INFO L158 Benchmark]: Boogie Preprocessor took 32.42ms. Allocated memory is still 240.1MB. Free memory was 186.5MB in the beginning and 184.0MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 20:51:16,682 INFO L158 Benchmark]: RCFGBuilder took 439.94ms. Allocated memory is still 240.1MB. Free memory was 184.0MB in the beginning and 166.2MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-21 20:51:16,682 INFO L158 Benchmark]: TraceAbstraction took 730207.06ms. Allocated memory is still 240.1MB. Free memory was 165.5MB in the beginning and 129.8MB in the end (delta: 35.7MB). Peak memory consumption was 97.0MB. Max. memory is 8.0GB. [2023-12-21 20:51:16,683 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 197.1MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.80ms. Allocated memory is still 240.1MB. Free memory was 200.5MB in the beginning and 188.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.40ms. Allocated memory is still 240.1MB. Free memory was 188.2MB in the beginning and 186.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.42ms. Allocated memory is still 240.1MB. Free memory was 186.5MB in the beginning and 184.0MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 439.94ms. Allocated memory is still 240.1MB. Free memory was 184.0MB in the beginning and 166.2MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 730207.06ms. Allocated memory is still 240.1MB. Free memory was 165.5MB in the beginning and 129.8MB in the end (delta: 35.7MB). Peak memory consumption was 97.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...