/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/conda.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 07:12:01,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 07:12:01,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 07:12:01,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 07:12:01,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 07:12:01,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 07:12:01,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 07:12:01,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 07:12:01,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 07:12:01,443 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 07:12:01,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 07:12:01,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 07:12:01,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 07:12:01,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 07:12:01,444 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 07:12:01,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 07:12:01,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 07:12:01,445 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 07:12:01,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 07:12:01,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 07:12:01,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 07:12:01,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 07:12:01,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 07:12:01,446 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 07:12:01,446 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 07:12:01,446 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 07:12:01,446 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 07:12:01,446 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 07:12:01,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 07:12:01,447 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 07:12:01,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 07:12:01,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 07:12:01,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 07:12:01,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 07:12:01,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:12:01,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 07:12:01,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 07:12:01,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 07:12:01,449 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 07:12:01,449 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 07:12:01,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 07:12:01,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 07:12:01,449 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 07:12:01,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 07:12:01,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 07:12:01,449 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 07:12:01,449 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 07:12:01,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 07:12:01,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 07:12:01,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 07:12:01,676 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 07:12:01,678 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 07:12:01,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/conda.c [2023-12-16 07:12:02,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 07:12:02,876 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 07:12:02,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/conda.c [2023-12-16 07:12:02,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9dc3bb6d/ff7ba044e72a4911ac28a501796f3568/FLAG957bc8596 [2023-12-16 07:12:02,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9dc3bb6d/ff7ba044e72a4911ac28a501796f3568 [2023-12-16 07:12:02,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 07:12:02,894 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 07:12:02,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 07:12:02,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 07:12:02,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 07:12:02,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:12:02" (1/1) ... [2023-12-16 07:12:02,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448bcd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:02, skipping insertion in model container [2023-12-16 07:12:02,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:12:02" (1/1) ... [2023-12-16 07:12:02,917 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 07:12:03,039 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/conda.c[588,601] [2023-12-16 07:12:03,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:12:03,063 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 07:12:03,072 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/conda.c[588,601] [2023-12-16 07:12:03,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:12:03,094 INFO L206 MainTranslator]: Completed translation [2023-12-16 07:12:03,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03 WrapperNode [2023-12-16 07:12:03,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 07:12:03,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 07:12:03,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 07:12:03,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 07:12:03,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (1/1) ... [2023-12-16 07:12:03,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (1/1) ... [2023-12-16 07:12:03,121 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2023-12-16 07:12:03,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 07:12:03,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 07:12:03,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 07:12:03,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 07:12:03,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (1/1) ... [2023-12-16 07:12:03,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (1/1) ... [2023-12-16 07:12:03,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (1/1) ... [2023-12-16 07:12:03,144 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 8, 7, 4]. 38 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 5 writes are split as follows [0, 0, 3, 2]. [2023-12-16 07:12:03,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (1/1) ... [2023-12-16 07:12:03,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (1/1) ... [2023-12-16 07:12:03,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (1/1) ... [2023-12-16 07:12:03,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (1/1) ... [2023-12-16 07:12:03,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (1/1) ... [2023-12-16 07:12:03,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (1/1) ... [2023-12-16 07:12:03,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 07:12:03,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 07:12:03,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 07:12:03,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 07:12:03,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (1/1) ... [2023-12-16 07:12:03,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:12:03,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 07:12:03,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 07:12:03,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 07:12:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 07:12:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 07:12:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 07:12:03,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 07:12:03,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-16 07:12:03,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 07:12:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-16 07:12:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-16 07:12:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-16 07:12:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-12-16 07:12:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 07:12:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 07:12:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 07:12:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 07:12:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-16 07:12:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 07:12:03,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 07:12:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-16 07:12:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-16 07:12:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-16 07:12:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-12-16 07:12:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 07:12:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 07:12:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 07:12:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 07:12:03,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-16 07:12:03,308 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 07:12:03,309 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 07:12:03,465 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 07:12:03,486 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 07:12:03,487 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-16 07:12:03,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:12:03 BoogieIcfgContainer [2023-12-16 07:12:03,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 07:12:03,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 07:12:03,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 07:12:03,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 07:12:03,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:12:02" (1/3) ... [2023-12-16 07:12:03,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469dddf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:12:03, skipping insertion in model container [2023-12-16 07:12:03,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:03" (2/3) ... [2023-12-16 07:12:03,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469dddf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:12:03, skipping insertion in model container [2023-12-16 07:12:03,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:12:03" (3/3) ... [2023-12-16 07:12:03,492 INFO L112 eAbstractionObserver]: Analyzing ICFG conda.c [2023-12-16 07:12:03,503 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 07:12:03,503 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 07:12:03,529 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 07:12:03,534 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;@1daee0c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 07:12:03,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 07:12:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:03,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 07:12:03,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:03,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:03,541 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:03,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash 199618784, now seen corresponding path program 1 times [2023-12-16 07:12:03,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:03,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250915236] [2023-12-16 07:12:03,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:12:03,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:03,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:03,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:12:03,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 07:12:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:12:03,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 07:12:03,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:12:03,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:12:03,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:12:03,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250915236] [2023-12-16 07:12:03,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250915236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:12:03,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:12:03,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:12:03,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43154922] [2023-12-16 07:12:03,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:12:03,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 07:12:03,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:12:03,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 07:12:03,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 07:12:03,659 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:12:03,679 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2023-12-16 07:12:03,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 07:12:03,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-12-16 07:12:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:12:03,686 INFO L225 Difference]: With dead ends: 33 [2023-12-16 07:12:03,686 INFO L226 Difference]: Without dead ends: 15 [2023-12-16 07:12:03,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 07:12:03,691 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:12:03,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:12:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-16 07:12:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-16 07:12:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-16 07:12:03,716 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 12 [2023-12-16 07:12:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:12:03,716 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-16 07:12:03,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-16 07:12:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 07:12:03,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:03,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:03,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 07:12:03,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:03,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:03,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash -193408226, now seen corresponding path program 1 times [2023-12-16 07:12:03,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:03,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883947694] [2023-12-16 07:12:03,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:12:03,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:03,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:03,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:12:03,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 07:12:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:12:04,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:12:04,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:12:04,151 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:12:04,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:12:04,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883947694] [2023-12-16 07:12:04,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883947694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:12:04,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:12:04,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 07:12:04,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834111939] [2023-12-16 07:12:04,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:12:04,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:12:04,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:12:04,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:12:04,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:12:04,158 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:12:04,246 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2023-12-16 07:12:04,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 07:12:04,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-12-16 07:12:04,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:12:04,248 INFO L225 Difference]: With dead ends: 30 [2023-12-16 07:12:04,248 INFO L226 Difference]: Without dead ends: 20 [2023-12-16 07:12:04,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-16 07:12:04,249 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:12:04,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 11 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:12:04,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-16 07:12:04,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2023-12-16 07:12:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-16 07:12:04,258 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2023-12-16 07:12:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:12:04,258 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-16 07:12:04,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-16 07:12:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 07:12:04,260 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:04,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:04,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 07:12:04,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:04,464 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:04,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:04,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1840868648, now seen corresponding path program 1 times [2023-12-16 07:12:04,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:04,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654589097] [2023-12-16 07:12:04,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:12:04,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:04,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:04,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:12:04,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 07:12:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:12:04,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 07:12:04,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:04,638 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 07:12:04,643 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-16 07:12:04,695 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 11 treesize of output 7 [2023-12-16 07:12:04,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 07:12:05,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:05,015 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 67 treesize of output 37 [2023-12-16 07:12:05,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:05,078 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 79 treesize of output 49 [2023-12-16 07:12:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:12:05,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:12:05,549 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 66 treesize of output 62 [2023-12-16 07:12:05,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2023-12-16 07:12:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:12:05,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:12:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654589097] [2023-12-16 07:12:05,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654589097] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:12:05,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:12:05,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-12-16 07:12:05,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911404227] [2023-12-16 07:12:05,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:12:05,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 07:12:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:12:05,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 07:12:05,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-12-16 07:12:05,878 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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-16 07:12:08,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 07:12:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:12:10,116 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2023-12-16 07:12:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 07:12:10,117 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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 17 [2023-12-16 07:12:10,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:12:10,119 INFO L225 Difference]: With dead ends: 46 [2023-12-16 07:12:10,119 INFO L226 Difference]: Without dead ends: 37 [2023-12-16 07:12:10,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2023-12-16 07:12:10,120 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 61 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-16 07:12:10,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 55 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-16 07:12:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-16 07:12:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2023-12-16 07:12:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 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-16 07:12:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-12-16 07:12:10,125 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2023-12-16 07:12:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:12:10,125 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-12-16 07:12:10,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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-16 07:12:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-12-16 07:12:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 07:12:10,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:10,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:10,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 07:12:10,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:10,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:10,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:10,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1160810278, now seen corresponding path program 1 times [2023-12-16 07:12:10,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:10,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027553420] [2023-12-16 07:12:10,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:12:10,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:10,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:10,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:12:10,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 07:12:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:12:10,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:12:10,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:10,389 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 11 treesize of output 7 [2023-12-16 07:12:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:12:10,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:12:10,442 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 14 treesize of output 12 [2023-12-16 07:12:10,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-12-16 07:12:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:12:10,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:12:10,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027553420] [2023-12-16 07:12:10,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027553420] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:12:10,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:12:10,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-16 07:12:10,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077913902] [2023-12-16 07:12:10,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:12:10,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 07:12:10,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:12:10,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 07:12:10,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 07:12:10,458 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:12:10,612 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-12-16 07:12:10,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 07:12:10,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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) Word has length 17 [2023-12-16 07:12:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:12:10,613 INFO L225 Difference]: With dead ends: 42 [2023-12-16 07:12:10,613 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 07:12:10,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-16 07:12:10,614 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:12:10,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:12:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 07:12:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-12-16 07:12:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-12-16 07:12:10,619 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2023-12-16 07:12:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:12:10,619 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-12-16 07:12:10,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-12-16 07:12:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 07:12:10,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:10,620 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:10,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 07:12:10,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:10,821 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:10,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:10,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1209506422, now seen corresponding path program 2 times [2023-12-16 07:12:10,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:10,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302257499] [2023-12-16 07:12:10,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 07:12:10,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:10,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:10,823 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:12:10,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 07:12:10,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 07:12:10,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:12:10,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 07:12:10,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:12:11,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:12:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:12:11,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:12:11,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302257499] [2023-12-16 07:12:11,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302257499] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:12:11,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:12:11,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-16 07:12:11,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47968621] [2023-12-16 07:12:11,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:12:11,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 07:12:11,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:12:11,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 07:12:11,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-16 07:12:11,101 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:12:11,285 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-12-16 07:12:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 07:12:11,286 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-16 07:12:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:12:11,287 INFO L225 Difference]: With dead ends: 53 [2023-12-16 07:12:11,287 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 07:12:11,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-12-16 07:12:11,288 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 63 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:12:11,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 21 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:12:11,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 07:12:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2023-12-16 07:12:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-16 07:12:11,292 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2023-12-16 07:12:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:12:11,292 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-16 07:12:11,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-16 07:12:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 07:12:11,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:11,293 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:11,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 07:12:11,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:11,496 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:11,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1807460438, now seen corresponding path program 3 times [2023-12-16 07:12:11,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:11,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677517919] [2023-12-16 07:12:11,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 07:12:11,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:11,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:11,498 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:12:11,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 07:12:11,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 07:12:11,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:12:11,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 07:12:11,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:12:11,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:12:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:12:11,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:12:11,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677517919] [2023-12-16 07:12:11,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677517919] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:12:11,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:12:11,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-16 07:12:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958820238] [2023-12-16 07:12:11,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:12:11,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 07:12:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:12:11,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 07:12:11,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-16 07:12:11,778 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:12:12,001 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2023-12-16 07:12:12,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 07:12:12,001 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 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 18 [2023-12-16 07:12:12,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:12:12,002 INFO L225 Difference]: With dead ends: 59 [2023-12-16 07:12:12,002 INFO L226 Difference]: Without dead ends: 46 [2023-12-16 07:12:12,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-12-16 07:12:12,003 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 132 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:12:12,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 23 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:12:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-16 07:12:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2023-12-16 07:12:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2023-12-16 07:12:12,015 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 18 [2023-12-16 07:12:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:12:12,015 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2023-12-16 07:12:12,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2023-12-16 07:12:12,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 07:12:12,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:12,016 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:12,021 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 (7)] Ended with exit code 0 [2023-12-16 07:12:12,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:12,216 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:12,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1712818014, now seen corresponding path program 4 times [2023-12-16 07:12:12,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:12,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180488421] [2023-12-16 07:12:12,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 07:12:12,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:12,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:12,218 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:12:12,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 07:12:12,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 07:12:12,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:12:12,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-16 07:12:12,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:12,342 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 07:12:12,343 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-16 07:12:12,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 07:12:12,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:12,803 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 30 treesize of output 23 [2023-12-16 07:12:12,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:12,965 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 67 treesize of output 37 [2023-12-16 07:12:13,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:13,033 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 81 treesize of output 51 [2023-12-16 07:12:13,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:13,095 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 107 treesize of output 77 [2023-12-16 07:12:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:12:13,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:12:14,486 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 228 treesize of output 212 [2023-12-16 07:12:14,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:14,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1671 treesize of output 1636 [2023-12-16 07:12:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:12:17,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:12:17,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180488421] [2023-12-16 07:12:17,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180488421] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:12:17,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:12:17,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2023-12-16 07:12:17,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184309975] [2023-12-16 07:12:17,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:12:17,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-16 07:12:17,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:12:17,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-16 07:12:17,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2023-12-16 07:12:17,637 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 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-16 07:12:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:12:20,407 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2023-12-16 07:12:20,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 07:12:20,408 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 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) Word has length 22 [2023-12-16 07:12:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:12:20,408 INFO L225 Difference]: With dead ends: 52 [2023-12-16 07:12:20,408 INFO L226 Difference]: Without dead ends: 42 [2023-12-16 07:12:20,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=276, Invalid=1364, Unknown=0, NotChecked=0, Total=1640 [2023-12-16 07:12:20,410 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 07:12:20,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 53 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 07:12:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-16 07:12:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2023-12-16 07:12:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-12-16 07:12:20,415 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2023-12-16 07:12:20,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:12:20,416 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-12-16 07:12:20,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 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-16 07:12:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-12-16 07:12:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 07:12:20,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:20,416 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:20,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-16 07:12:20,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:20,619 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:20,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1319791004, now seen corresponding path program 1 times [2023-12-16 07:12:20,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:20,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430581740] [2023-12-16 07:12:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:12:20,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:20,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:20,621 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:12:20,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 07:12:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:12:20,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 07:12:20,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:20,721 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 13 treesize of output 9 [2023-12-16 07:12:20,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:12:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 07:12:20,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:12:20,844 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 16 treesize of output 14 [2023-12-16 07:12:20,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-12-16 07:12:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 07:12:20,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:12:20,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430581740] [2023-12-16 07:12:20,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430581740] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:12:20,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:12:20,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-12-16 07:12:20,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262079246] [2023-12-16 07:12:20,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:12:20,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 07:12:20,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:12:20,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 07:12:20,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-16 07:12:20,893 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:12:21,032 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-12-16 07:12:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 07:12:21,032 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 07:12:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:12:21,032 INFO L225 Difference]: With dead ends: 56 [2023-12-16 07:12:21,032 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 07:12:21,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-12-16 07:12:21,033 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:12:21,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 61 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:12:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 07:12:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-16 07:12:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 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-16 07:12:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-12-16 07:12:21,045 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2023-12-16 07:12:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:12:21,045 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-12-16 07:12:21,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-12-16 07:12:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 07:12:21,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:21,046 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:21,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 07:12:21,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:21,249 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:21,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash -160565812, now seen corresponding path program 5 times [2023-12-16 07:12:21,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:21,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422916148] [2023-12-16 07:12:21,250 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 07:12:21,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:21,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:21,251 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:12:21,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 07:12:21,334 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-16 07:12:21,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:12:21,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 07:12:21,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 07:12:21,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:12:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 07:12:21,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:12:21,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422916148] [2023-12-16 07:12:21,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422916148] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:12:21,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:12:21,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-16 07:12:21,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881336694] [2023-12-16 07:12:21,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:12:21,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 07:12:21,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:12:21,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 07:12:21,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-12-16 07:12:21,713 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:12:21,941 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-12-16 07:12:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 07:12:21,942 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 23 [2023-12-16 07:12:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:12:21,942 INFO L225 Difference]: With dead ends: 38 [2023-12-16 07:12:21,942 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 07:12:21,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2023-12-16 07:12:21,943 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 31 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:12:21,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 19 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:12:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 07:12:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-12-16 07:12:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-16 07:12:21,947 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2023-12-16 07:12:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:12:21,947 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-16 07:12:21,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:12:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-16 07:12:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 07:12:21,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:21,947 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:21,954 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 (10)] Ended with exit code 0 [2023-12-16 07:12:22,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:22,152 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:22,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash 851391128, now seen corresponding path program 6 times [2023-12-16 07:12:22,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:22,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931134257] [2023-12-16 07:12:22,153 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 07:12:22,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:22,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:22,154 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:12:22,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 07:12:22,268 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-12-16 07:12:22,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:12:22,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-16 07:12:22,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:22,309 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 07:12:22,309 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-16 07:12:22,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 07:12:22,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:22,648 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 30 treesize of output 23 [2023-12-16 07:12:22,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:22,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2023-12-16 07:12:23,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:23,209 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 67 treesize of output 37 [2023-12-16 07:12:23,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:23,307 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 81 treesize of output 51 [2023-12-16 07:12:23,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:23,398 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 109 treesize of output 79 [2023-12-16 07:12:23,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:23,462 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 163 treesize of output 133 [2023-12-16 07:12:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:12:23,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:12:43,401 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 601 treesize of output 567 [2023-12-16 07:12:43,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:43,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98514 treesize of output 96030 [2023-12-16 07:12:59,471 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse25 ((_ sign_extend 32) (_ bv2 32))) (.cse13 ((_ sign_extend 32) (_ bv1 32))) (.cse51 (let ((.cse272 (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse272 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse272 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse39 (let ((.cse271 (bvadd .cse13 .cse51))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271)))) (.cse49 (let ((.cse270 (bvadd .cse51 .cse25))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270)))) (.cse215 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse4 (= (_ bv8 32) .cse215)) (.cse20 (= (bvadd (_ bv8 32) .cse215) (_ bv0 32))) (.cse12 (let ((.cse269 (bvadd .cse49 .cse25))) (concat ((_ extract 63 32) .cse269) ((_ extract 31 0) .cse269)))) (.cse10 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32)))) (.cse26 (let ((.cse268 (bvadd .cse13 .cse39))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268))))) (let ((.cse21 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse10 (let ((.cse267 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse26))) (concat ((_ extract 63 32) .cse267) ((_ extract 31 0) .cse267)))))) (.cse22 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse265 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse264 (bvadd .cse12 .cse265))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))) .cse10) (= .cse10 (let ((.cse266 (bvadd .cse265 .cse26))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266)))))))) (.cse213 (not .cse20)) (.cse169 (let ((.cse263 (bvadd .cse13 .cse49))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263)))) (.cse23 (not .cse4))) (let ((.cse27 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse260 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse258 (bvadd (let ((.cse259 (bvadd .cse260 .cse49))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259))) .cse13))) (concat ((_ extract 63 32) .cse258) ((_ extract 31 0) .cse258))) .cse10) (= .cse10 (let ((.cse261 (bvadd .cse13 (let ((.cse262 (bvadd .cse260 .cse39))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262)))))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261)))))))) (.cse28 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (= .cse10 (let ((.cse256 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse257 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse39))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257)))))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256)))))) (.cse29 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse253 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse252 (bvadd .cse253 (let ((.cse254 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse39))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254)))))) (concat ((_ extract 63 32) .cse252) ((_ extract 31 0) .cse252)))) (= (let ((.cse255 (bvadd .cse12 .cse253))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255))) .cse10))))) (.cse30 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse248 ((_ sign_extend 32) v_arrayElimCell_46)) (.cse246 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse245 (bvadd .cse246 (let ((.cse247 (bvadd .cse248 .cse39))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247)))))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245)))) (= (let ((.cse249 (bvadd .cse12 .cse246))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))) .cse10) (= (let ((.cse250 (bvadd (let ((.cse251 (bvadd .cse248 .cse49))) (concat ((_ extract 63 32) .cse251) ((_ extract 31 0) .cse251))) .cse246))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250))) .cse10))))) (.cse31 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= .cse10 (let ((.cse243 (bvadd .cse13 (let ((.cse244 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse39))) (concat ((_ extract 63 32) .cse244) ((_ extract 31 0) .cse244)))))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243)))))) (.cse32 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse240 ((_ sign_extend 32) v_arrayElimCell_46)) (.cse238 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse237 (bvadd .cse238 (let ((.cse239 (bvadd .cse240 .cse39))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239)))))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237)))) (= (let ((.cse241 (bvadd (let ((.cse242 (bvadd .cse240 .cse49))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242))) .cse238))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241))) .cse10))))) (.cse33 (or .cse23 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= .cse10 (let ((.cse235 (bvadd (let ((.cse236 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse39))) (concat ((_ extract 63 32) .cse236) ((_ extract 31 0) .cse236))) .cse25))) (concat ((_ extract 63 32) .cse235) ((_ extract 31 0) .cse235))))))) (.cse5 (or .cse213 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse233 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse232 (bvadd .cse12 .cse233))) (concat ((_ extract 63 32) .cse232) ((_ extract 31 0) .cse232))) .cse10) (= .cse10 (let ((.cse234 (bvadd .cse233 .cse169))) (concat ((_ extract 63 32) .cse234) ((_ extract 31 0) .cse234))))))))) (.cse7 (or .cse20 .cse22)) (.cse8 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse229 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse228 (bvadd .cse12 .cse229))) (concat ((_ extract 63 32) .cse228) ((_ extract 31 0) .cse228))) .cse10) (= .cse10 (let ((.cse230 (bvadd .cse229 .cse26))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230)))) (= .cse10 (let ((.cse231 (bvadd .cse229 .cse169))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231)))))))) (.cse16 (or .cse20 .cse21)) (.cse17 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse226 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse225 (bvadd .cse226 .cse26))) (concat ((_ extract 63 32) .cse225) ((_ extract 31 0) .cse225)))) (= .cse10 (let ((.cse227 (bvadd .cse226 .cse169))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227)))))))) (.cse18 (or .cse213 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse10 (let ((.cse224 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse169))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224))))))) (.cse3 (= (_ bv0 32) .cse215))) (let ((.cse0 (or (and .cse5 .cse7 .cse8 .cse16 .cse17 .cse18) .cse3 .cse4)) (.cse1 (or .cse3 (and (or (and (or .cse213 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse217 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse216 (bvadd .cse12 .cse217))) (concat ((_ extract 63 32) .cse216) ((_ extract 31 0) .cse216))) .cse10) (= (let ((.cse218 (bvadd (let ((.cse219 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse49))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219))) .cse217))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218))) .cse10))))) .cse27 (or .cse213 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse220 (bvadd (let ((.cse221 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse49))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221))) .cse13))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))) .cse10))) (or .cse20 .cse28) (or .cse20 .cse29) .cse30 (or .cse213 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse222 (bvadd (let ((.cse223 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse49))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222))) .cse10))) (or .cse20 .cse31) .cse32) .cse4) .cse33))) (.cse19 (= (_ bv4 32) .cse215)) (.cse2 (= (bvadd (_ bv4 32) .cse215) (_ bv0 32)))) (and (or (let ((.cse14 (not .cse2))) (let ((.cse6 (or (and .cse16 .cse17 .cse18) .cse2)) (.cse9 (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= (let ((.cse15 (bvadd .cse12 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))) .cse10)) .cse14))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9)) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 (or (= .cse10 (let ((.cse11 (bvadd .cse12 .cse13))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11)))) .cse14)) .cse3 .cse4)))) .cse19) (or (and (or .cse20 (let ((.cse34 (not .cse19))) (and (or (and (or .cse3 .cse4 (and .cse21 .cse8 .cse17 .cse22)) (or .cse23 (= .cse10 (let ((.cse24 (bvadd .cse25 .cse26))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24))))) (or (and (or .cse4 (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32)) .cse33) .cse3) (or (and .cse34 .cse21 .cse8 .cse17 .cse22) .cse3 .cse4) (or (and (or (and (= (let ((.cse35 (bvadd .cse13 .cse26))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))) .cse10) .cse21 .cse8 .cse17 .cse22) .cse3) (or (not .cse3) (= .cse10 (let ((.cse36 (bvadd .cse12 .cse25))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36)))))) .cse4)) (and (= .cse10 (let ((.cse37 (bvadd (let ((.cse38 (bvadd .cse25 .cse39))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38))) .cse25))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37)))) .cse19)) (or .cse3 (let ((.cse92 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse207 (let ((.cse212 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse212) ((_ extract 31 0) .cse212))))) (or (= (let ((.cse205 (bvadd (let ((.cse206 (bvadd .cse207 .cse25))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206))) .cse25))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse209 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse208 (bvadd .cse12 .cse209))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))) .cse10) (= (let ((.cse210 (bvadd .cse209 (let ((.cse211 (bvadd .cse207 .cse13))) (concat ((_ extract 63 32) .cse211) ((_ extract 31 0) .cse211)))))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210))) .cse10)))))))) (.cse93 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse199 (let ((.cse204 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204))))) (or (= (let ((.cse197 (bvadd (let ((.cse198 (bvadd .cse199 .cse25))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198))) .cse25))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse201 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse200 (bvadd .cse201 (let ((.cse202 (bvadd .cse199 .cse13))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202)))))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))) .cse10) (= .cse10 (let ((.cse203 (bvadd .cse201 .cse169))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203))))))))))) (.cse94 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse192 (let ((.cse196 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse189 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse188 (bvadd .cse12 .cse189))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188))) .cse10) (= (let ((.cse190 (bvadd .cse189 (let ((.cse191 (bvadd .cse192 .cse13))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191)))))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190))) .cse10) (= .cse10 (let ((.cse193 (bvadd .cse189 .cse169))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193))))))) (= (let ((.cse194 (bvadd (let ((.cse195 (bvadd .cse192 .cse25))) (concat ((_ extract 63 32) .cse195) ((_ extract 31 0) .cse195))) .cse25))) (concat ((_ extract 63 32) .cse194) ((_ extract 31 0) .cse194))) .cse10))))) (.cse95 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse184 (let ((.cse187 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187))))) (or (= (let ((.cse182 (bvadd (let ((.cse183 (bvadd .cse184 .cse25))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183))) .cse25))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= (let ((.cse185 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse186 (bvadd .cse184 .cse13))) (concat ((_ extract 63 32) .cse186) ((_ extract 31 0) .cse186)))))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185))) .cse10))))))) (and (or (and (or (and (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse42 (let ((.cse50 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50))))) (or (= (let ((.cse40 (bvadd (let ((.cse41 (bvadd .cse42 .cse25))) (concat ((_ extract 63 32) .cse41) ((_ extract 31 0) .cse41))) .cse25))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse45 ((_ sign_extend 32) v_arrayElimCell_46)) (.cse46 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse43 (bvadd (let ((.cse44 (bvadd .cse42 .cse45))) (concat ((_ extract 63 32) .cse44) ((_ extract 31 0) .cse44))) .cse46))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43)))) (= (let ((.cse47 (bvadd (let ((.cse48 (bvadd .cse45 .cse49))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))) .cse46))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47))) .cse10))))))) (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse54 (let ((.cse57 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse57) ((_ extract 31 0) .cse57))))) (or (= (let ((.cse52 (bvadd (let ((.cse53 (bvadd .cse54 .cse25))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) .cse25))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))) .cse10) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse55 (bvadd (let ((.cse56 (bvadd .cse54 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))) .cse13))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse10))))) (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse60 (let ((.cse63 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63))))) (or (= (let ((.cse58 (bvadd (let ((.cse59 (bvadd .cse60 .cse25))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59))) .cse25))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (= .cse10 (let ((.cse61 (bvadd (let ((.cse62 (bvadd .cse60 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62))) ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61)))))))) (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse66 (let ((.cse74 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))))) (or (= (let ((.cse64 (bvadd (let ((.cse65 (bvadd .cse66 .cse25))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65))) .cse25))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse71 ((_ sign_extend 32) v_arrayElimCell_46)) (.cse68 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse67 (bvadd .cse12 .cse68))) (concat ((_ extract 63 32) .cse67) ((_ extract 31 0) .cse67))) .cse10) (= .cse10 (let ((.cse69 (bvadd (let ((.cse70 (bvadd .cse66 .cse71))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))) .cse68))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69)))) (= (let ((.cse72 (bvadd (let ((.cse73 (bvadd .cse71 .cse49))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73))) .cse68))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72))) .cse10))))))) (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse79 (let ((.cse82 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse76 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse75 (bvadd .cse12 .cse76))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75))) .cse10) (= .cse10 (let ((.cse77 (bvadd (let ((.cse78 (bvadd .cse79 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))) .cse76))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77))))))) (= (let ((.cse80 (bvadd (let ((.cse81 (bvadd .cse79 .cse25))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81))) .cse25))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))) .cse10)))) (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse88 (let ((.cse91 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91))))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse85 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse83 (bvadd (let ((.cse84 (bvadd .cse85 .cse49))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84))) .cse13))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse10) (= (let ((.cse86 (bvadd (let ((.cse87 (bvadd .cse88 .cse85))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87))) .cse13))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))) .cse10)))) (= (let ((.cse89 (bvadd (let ((.cse90 (bvadd .cse88 .cse25))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90))) .cse25))) (concat ((_ extract 63 32) .cse89) ((_ extract 31 0) .cse89))) .cse10))))) .cse4) (or (and .cse92 .cse93 .cse94 .cse95) .cse4) (or (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse98 (let ((.cse101 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101))))) (or (= (let ((.cse96 (bvadd (let ((.cse97 (bvadd .cse98 .cse25))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse25))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96))) .cse10) (= (let ((.cse99 (bvadd (let ((.cse100 (bvadd .cse98 .cse13))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100))) .cse25))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99))) .cse10)))) .cse23) (or (and .cse92 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse104 (let ((.cse107 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))))) (or (= (let ((.cse102 (bvadd (let ((.cse103 (bvadd .cse104 .cse25))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))) .cse25))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102))) .cse10) (= (let ((.cse105 (bvadd .cse13 (let ((.cse106 (bvadd .cse104 .cse13))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106)))))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105))) .cse10)))) .cse93 .cse94 .cse95) .cse4) (or .cse23 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse110 (let ((.cse113 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113))))) (or (= (let ((.cse108 (bvadd (let ((.cse109 (bvadd .cse110 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109))) .cse25))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))) .cse10) (= (let ((.cse111 (bvadd (let ((.cse112 (bvadd .cse110 .cse25))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112))) .cse25))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111))) .cse10)))))) .cse19) (or (let ((.cse152 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse176 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse177 (bvadd (let ((.cse178 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse178) ((_ extract 31 0) .cse178))) .cse13))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177)))))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))) .cse10))) (.cse153 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse171 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse170 (bvadd .cse12 .cse171))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170))) .cse10) (= (let ((.cse172 (bvadd .cse171 (let ((.cse173 (bvadd (let ((.cse174 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse174) ((_ extract 31 0) .cse174))) .cse13))) (concat ((_ extract 63 32) .cse173) ((_ extract 31 0) .cse173)))))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172))) .cse10) (= .cse10 (let ((.cse175 (bvadd .cse171 .cse169))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175)))))))) (.cse154 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse165 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse164 (bvadd .cse165 (let ((.cse166 (bvadd (let ((.cse167 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167))) .cse13))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166)))))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))) .cse10) (= .cse10 (let ((.cse168 (bvadd .cse165 .cse169))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168)))))))) (.cse155 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse160 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse159 (bvadd .cse12 .cse160))) (concat ((_ extract 63 32) .cse159) ((_ extract 31 0) .cse159))) .cse10) (= (let ((.cse161 (bvadd .cse160 (let ((.cse162 (bvadd (let ((.cse163 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163))) .cse13))) (concat ((_ extract 63 32) .cse162) ((_ extract 31 0) .cse162)))))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161))) .cse10)))))) (and (or (and (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse116 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse114 (bvadd (let ((.cse115 (bvadd .cse116 .cse49))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))) .cse13))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114))) .cse10) (= (let ((.cse117 (bvadd (let ((.cse118 (bvadd (let ((.cse119 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119))) .cse116))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118))) .cse13))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117))) .cse10)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse125 ((_ sign_extend 32) v_arrayElimCell_46)) (.cse121 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse120 (bvadd .cse12 .cse121))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120))) .cse10) (= .cse10 (let ((.cse122 (bvadd (let ((.cse123 (bvadd (let ((.cse124 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124))) .cse125))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123))) .cse121))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122)))) (= (let ((.cse126 (bvadd (let ((.cse127 (bvadd .cse125 .cse49))) (concat ((_ extract 63 32) .cse127) ((_ extract 31 0) .cse127))) .cse121))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126))) .cse10)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse131 ((_ sign_extend 32) v_arrayElimCell_46)) (.cse132 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse128 (bvadd (let ((.cse129 (bvadd (let ((.cse130 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130))) .cse131))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129))) .cse132))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128)))) (= (let ((.cse133 (bvadd (let ((.cse134 (bvadd .cse131 .cse49))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134))) .cse132))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))) .cse10)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= .cse10 (let ((.cse135 (bvadd (let ((.cse136 (bvadd (let ((.cse137 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))) ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse138 (bvadd (let ((.cse139 (bvadd (let ((.cse140 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139))) .cse13))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))) .cse10)) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse142 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse141 (bvadd .cse12 .cse142))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141))) .cse10) (= .cse10 (let ((.cse143 (bvadd (let ((.cse144 (bvadd (let ((.cse145 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144))) .cse142))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143)))))))) .cse4) (or .cse23 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse146 (bvadd (let ((.cse147 (bvadd (let ((.cse148 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148))) .cse13))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147))) .cse25))) (concat ((_ extract 63 32) .cse146) ((_ extract 31 0) .cse146))) .cse10))) (or .cse23 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse149 (bvadd (let ((.cse150 (bvadd (let ((.cse151 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150))) .cse25))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149))) .cse10))) (or (and .cse152 .cse153 .cse154 .cse155) .cse4) (or (and .cse152 .cse153 .cse154 .cse155 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse156 (bvadd .cse13 (let ((.cse157 (bvadd (let ((.cse158 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158))) .cse13))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157)))))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))) .cse10))) .cse4))) .cse19) (or (and .cse92 (or .cse34 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse179 (bvadd (let ((.cse180 (bvadd (let ((.cse181 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse51))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181))) .cse25))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180))) .cse25))) (concat ((_ extract 63 32) .cse179) ((_ extract 31 0) .cse179))) .cse10))) .cse93 .cse94 .cse95) .cse4))))))) (or (and .cse0 .cse1 (or .cse3 (and (or .cse213 (= (let ((.cse214 (bvadd .cse13 .cse169))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse10)) .cse5 .cse7 .cse8 .cse16 .cse17 .cse18) .cse4)) .cse19)) .cse2)))))))) (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from true [2023-12-16 07:13:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-16 07:13:02,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:13:02,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931134257] [2023-12-16 07:13:02,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931134257] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:13:02,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:13:02,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2023-12-16 07:13:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324280993] [2023-12-16 07:13:02,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:13:02,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-16 07:13:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:13:02,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-16 07:13:02,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1520, Unknown=4, NotChecked=82, Total=1892 [2023-12-16 07:13:02,110 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-16 07:13:20,692 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 07:13:20,716 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 07:13:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 07:13:20,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 38.4s TimeCoverageRelationStatistics Valid=345, Invalid=1817, Unknown=4, NotChecked=90, Total=2256 [2023-12-16 07:13:20,909 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:13:20,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 14 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 566 Invalid, 0 Unknown, 33 Unchecked, 5.2s Time] [2023-12-16 07:13:20,911 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 07:13:20,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 07:13:21,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:13:21,112 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (28states) and FLOYD_HOARE automaton (currently 23 states, 44 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. [2023-12-16 07:13:21,115 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2023-12-16 07:13:21,117 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 07:13:21,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:13:21 BoogieIcfgContainer [2023-12-16 07:13:21,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 07:13:21,128 INFO L158 Benchmark]: Toolchain (without parser) took 78234.47ms. Allocated memory was 360.7MB in the beginning and 433.1MB in the end (delta: 72.4MB). Free memory was 316.0MB in the beginning and 162.9MB in the end (delta: 153.1MB). Peak memory consumption was 226.5MB. Max. memory is 8.0GB. [2023-12-16 07:13:21,128 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:13:21,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.42ms. Allocated memory is still 360.7MB. Free memory was 316.0MB in the beginning and 303.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 07:13:21,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.93ms. Allocated memory is still 360.7MB. Free memory was 303.9MB in the beginning and 302.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 07:13:21,129 INFO L158 Benchmark]: Boogie Preprocessor took 33.80ms. Allocated memory is still 360.7MB. Free memory was 302.0MB in the beginning and 299.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 07:13:21,129 INFO L158 Benchmark]: RCFGBuilder took 326.47ms. Allocated memory is still 360.7MB. Free memory was 299.9MB in the beginning and 283.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 07:13:21,129 INFO L158 Benchmark]: TraceAbstraction took 77639.10ms. Allocated memory was 360.7MB in the beginning and 433.1MB in the end (delta: 72.4MB). Free memory was 283.1MB in the beginning and 162.9MB in the end (delta: 120.2MB). Peak memory consumption was 194.0MB. Max. memory is 8.0GB. [2023-12-16 07:13:21,130 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.10ms. Allocated memory is still 207.6MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.42ms. Allocated memory is still 360.7MB. Free memory was 316.0MB in the beginning and 303.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.93ms. Allocated memory is still 360.7MB. Free memory was 303.9MB in the beginning and 302.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.80ms. Allocated memory is still 360.7MB. Free memory was 302.0MB in the beginning and 299.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 326.47ms. Allocated memory is still 360.7MB. Free memory was 299.9MB in the beginning and 283.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 77639.10ms. Allocated memory was 360.7MB in the beginning and 433.1MB in the end (delta: 72.4MB). Free memory was 283.1MB in the beginning and 162.9MB in the end (delta: 120.2MB). Peak memory consumption was 194.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15). Cancelled while NwaCegarLoop was constructing difference of abstraction (28states) and FLOYD_HOARE automaton (currently 23 states, 44 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 77.6s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 26.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 374 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 374 mSDsluCounter, 326 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 33 IncrementalHoareTripleChecker+Unchecked, 250 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2016 IncrementalHoareTripleChecker+Invalid, 2205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 76 mSDtfsCounter, 2016 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 46.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=6, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 47.7s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 334 ConstructedInterpolants, 3 QuantifiedInterpolants, 51983 SizeOfPredicates, 74 NumberOfNonLiveVariables, 780 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 41/152 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown