/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-patterns/array10_pattern.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 19:17:35,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 19:17:36,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 19:17:36,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 19:17:36,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 19:17:36,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 19:17:36,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 19:17:36,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 19:17:36,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 19:17:36,059 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 19:17:36,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 19:17:36,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 19:17:36,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 19:17:36,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 19:17:36,061 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 19:17:36,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 19:17:36,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 19:17:36,062 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 19:17:36,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 19:17:36,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 19:17:36,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 19:17:36,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 19:17:36,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 19:17:36,072 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 19:17:36,072 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 19:17:36,072 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 19:17:36,073 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 19:17:36,073 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 19:17:36,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 19:17:36,073 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 19:17:36,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 19:17:36,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 19:17:36,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 19:17:36,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 19:17:36,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:17:36,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 19:17:36,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 19:17:36,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 19:17:36,075 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 19:17:36,075 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 19:17:36,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 19:17:36,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 19:17:36,088 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 19:17:36,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 19:17:36,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 19:17:36,089 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 19:17:36,089 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 19:17:36,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 19:17:36,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 19:17:36,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 19:17:36,320 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 19:17:36,320 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 19:17:36,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-patterns/array10_pattern.c [2023-12-21 19:17:37,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 19:17:37,589 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 19:17:37,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array10_pattern.c [2023-12-21 19:17:37,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ebe0dc7/56feda862cbd419c9ab1bf273db17483/FLAGb1bf02151 [2023-12-21 19:17:38,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ebe0dc7/56feda862cbd419c9ab1bf273db17483 [2023-12-21 19:17:38,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 19:17:38,033 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 19:17:38,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 19:17:38,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 19:17:38,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 19:17:38,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d4912b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38, skipping insertion in model container [2023-12-21 19:17:38,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,063 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 19:17:38,173 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-patterns/array10_pattern.c[1326,1339] [2023-12-21 19:17:38,187 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:17:38,194 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 19:17:38,202 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-patterns/array10_pattern.c[1326,1339] [2023-12-21 19:17:38,211 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:17:38,222 INFO L206 MainTranslator]: Completed translation [2023-12-21 19:17:38,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38 WrapperNode [2023-12-21 19:17:38,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 19:17:38,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 19:17:38,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 19:17:38,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 19:17:38,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,250 INFO L138 Inliner]: procedures = 18, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2023-12-21 19:17:38,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 19:17:38,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 19:17:38,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 19:17:38,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 19:17:38,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,270 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 3, 4]. 44 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2023-12-21 19:17:38,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 19:17:38,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 19:17:38,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 19:17:38,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 19:17:38,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (1/1) ... [2023-12-21 19:17:38,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:17:38,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 19:17:38,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 19:17:38,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 19:17:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 19:17:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 19:17:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 19:17:38,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 19:17:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 19:17:38,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 19:17:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 19:17:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 19:17:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 19:17:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-21 19:17:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 19:17:38,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 19:17:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 19:17:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 19:17:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 19:17:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-21 19:17:38,479 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 19:17:38,480 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 19:17:38,791 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 19:17:38,814 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 19:17:38,815 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 19:17:38,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:17:38 BoogieIcfgContainer [2023-12-21 19:17:38,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 19:17:38,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 19:17:38,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 19:17:38,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 19:17:38,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 07:17:38" (1/3) ... [2023-12-21 19:17:38,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8b3fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:17:38, skipping insertion in model container [2023-12-21 19:17:38,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:17:38" (2/3) ... [2023-12-21 19:17:38,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8b3fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:17:38, skipping insertion in model container [2023-12-21 19:17:38,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:17:38" (3/3) ... [2023-12-21 19:17:38,826 INFO L112 eAbstractionObserver]: Analyzing ICFG array10_pattern.c [2023-12-21 19:17:38,837 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 19:17:38,838 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 19:17:38,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 19:17:38,871 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;@61bdb852, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 19:17:38,871 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 19:17:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:17:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 19:17:38,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:17:38,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:17:38,878 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:17:38,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:17:38,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1066875782, now seen corresponding path program 1 times [2023-12-21 19:17:38,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:17:38,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623433323] [2023-12-21 19:17:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:17:38,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:17:38,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:17:38,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:17:38,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 19:17:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:17:38,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 19:17:38,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:17:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:17:39,018 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:17:39,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:17:39,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623433323] [2023-12-21 19:17:39,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623433323] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:17:39,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:17:39,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 19:17:39,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964382385] [2023-12-21 19:17:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:17:39,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 19:17:39,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:17:39,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 19:17:39,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 19:17:39,041 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 19:17:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:17:39,093 INFO L93 Difference]: Finished difference Result 42 states and 63 transitions. [2023-12-21 19:17:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 19:17:39,095 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-21 19:17:39,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:17:39,100 INFO L225 Difference]: With dead ends: 42 [2023-12-21 19:17:39,100 INFO L226 Difference]: Without dead ends: 20 [2023-12-21 19:17:39,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 19:17:39,106 INFO L413 NwaCegarLoop]: 22 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, 22 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 19:17:39,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 19:17:39,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-21 19:17:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-21 19:17:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:17:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-21 19:17:39,131 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2023-12-21 19:17:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:17:39,132 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-21 19:17:39,132 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 19:17:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-21 19:17:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 19:17:39,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:17:39,134 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:17:39,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-21 19:17:39,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:17:39,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:17:39,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:17:39,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1109591495, now seen corresponding path program 1 times [2023-12-21 19:17:39,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:17:39,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306850477] [2023-12-21 19:17:39,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:17:39,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:17:39,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:17:39,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:17:39,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 19:17:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:17:39,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 19:17:39,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:17:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:17:39,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:17:39,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:17:39,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306850477] [2023-12-21 19:17:39,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306850477] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:17:39,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:17:39,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 19:17:39,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164506584] [2023-12-21 19:17:39,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:17:39,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 19:17:39,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:17:39,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 19:17:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-21 19:17:39,637 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:17:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:17:39,875 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-12-21 19:17:39,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 19:17:39,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-12-21 19:17:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:17:39,881 INFO L225 Difference]: With dead ends: 42 [2023-12-21 19:17:39,881 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 19:17:39,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-21 19:17:39,882 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 19:17:39,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 51 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 19:17:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 19:17:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-21 19:17:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:17:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-21 19:17:39,888 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2023-12-21 19:17:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:17:39,889 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-21 19:17:39,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:17:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-21 19:17:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 19:17:39,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:17:39,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:17:39,896 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-21 19:17:40,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:17:40,100 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:17:40,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:17:40,101 INFO L85 PathProgramCache]: Analyzing trace with hash -865149808, now seen corresponding path program 1 times [2023-12-21 19:17:40,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:17:40,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306466572] [2023-12-21 19:17:40,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:17:40,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:17:40,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:17:40,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:17:40,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 19:17:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:17:40,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 19:17:40,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:17:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 19:17:40,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:17:40,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:17:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306466572] [2023-12-21 19:17:40,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306466572] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:17:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1097180046] [2023-12-21 19:17:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:17:40,760 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:17:40,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:17:40,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-21 19:17:40,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-21 19:17:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:17:41,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-21 19:17:41,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:17:41,562 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 27 treesize of output 23 [2023-12-21 19:17:45,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-12-21 19:17:49,231 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:17:49,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:17:49,311 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 32 treesize of output 23 [2023-12-21 19:17:49,323 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:17:49,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:17:49,404 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 42 treesize of output 33 [2023-12-21 19:17:51,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:17:51,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:18:00,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2023-12-21 19:18:00,139 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 67 treesize of output 65 [2023-12-21 19:18:10,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2023-12-21 19:18:10,392 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 166 treesize of output 162 [2023-12-21 19:18:30,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1097180046] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:18:30,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:18:30,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 22 [2023-12-21 19:18:30,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963776934] [2023-12-21 19:18:30,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:18:30,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 19:18:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:18:30,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 19:18:30,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 19:18:30,360 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 20 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 19:18:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:18:43,466 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2023-12-21 19:18:43,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 19:18:43,477 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 20 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-12-21 19:18:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:18:43,478 INFO L225 Difference]: With dead ends: 67 [2023-12-21 19:18:43,478 INFO L226 Difference]: Without dead ends: 50 [2023-12-21 19:18:43,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=327, Invalid=1653, Unknown=0, NotChecked=0, Total=1980 [2023-12-21 19:18:43,479 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 91 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-21 19:18:43,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 155 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-21 19:18:43,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-21 19:18:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2023-12-21 19:18:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 19:18:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2023-12-21 19:18:43,486 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 25 [2023-12-21 19:18:43,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:18:43,486 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2023-12-21 19:18:43,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 20 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 19:18:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2023-12-21 19:18:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 19:18:43,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:18:43,487 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:18:43,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 19:18:43,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-12-21 19:18:43,892 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-21 19:18:43,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:18:43,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:18:43,893 INFO L85 PathProgramCache]: Analyzing trace with hash -185091438, now seen corresponding path program 1 times [2023-12-21 19:18:43,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:18:43,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154589866] [2023-12-21 19:18:43,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:18:43,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:18:43,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:18:43,894 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:18:43,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 19:18:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:18:44,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-21 19:18:44,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:18:44,254 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-21 19:18:45,199 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 27 treesize of output 23 [2023-12-21 19:18:48,477 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:18:48,686 INFO L349 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2023-12-21 19:18:48,686 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 4 case distinctions, treesize of input 40 treesize of output 39 [2023-12-21 19:18:52,814 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 19:18:52,814 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 32 treesize of output 20 [2023-12-21 19:18:52,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:18:52,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:18:52,894 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 39 treesize of output 30 [2023-12-21 19:18:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:18:54,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:19:07,851 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 49 treesize of output 47 [2023-12-21 19:19:07,856 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 79 treesize of output 77 [2023-12-21 19:19:19,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:19:19,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154589866] [2023-12-21 19:19:19,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154589866] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:19:19,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1621912250] [2023-12-21 19:19:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:19:19,298 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:19:19,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:19:19,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-21 19:19:19,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-21 19:19:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:19:19,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 19:19:19,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:19:20,638 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-21 19:19:21,068 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 27 treesize of output 23 [2023-12-21 19:19:21,650 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:19:21,872 INFO L349 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2023-12-21 19:19:21,873 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 4 case distinctions, treesize of input 40 treesize of output 39 [2023-12-21 19:19:23,054 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 19:19:23,054 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 32 treesize of output 20 [2023-12-21 19:19:23,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:19:23,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:19:23,165 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 39 treesize of output 30 [2023-12-21 19:19:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:19:23,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:19:27,832 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 49 treesize of output 47 [2023-12-21 19:19:27,837 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 79 treesize of output 77 [2023-12-21 19:19:33,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1621912250] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:19:33,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:19:33,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 20 [2023-12-21 19:19:33,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357092779] [2023-12-21 19:19:33,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:19:33,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 19:19:33,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:19:33,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 19:19:33,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2023-12-21 19:19:33,780 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 19:19:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:19:50,666 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-12-21 19:19:50,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 19:19:50,686 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.3) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-12-21 19:19:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:19:50,686 INFO L225 Difference]: With dead ends: 47 [2023-12-21 19:19:50,686 INFO L226 Difference]: Without dead ends: 27 [2023-12-21 19:19:50,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 52.2s TimeCoverageRelationStatistics Valid=315, Invalid=1245, Unknown=0, NotChecked=0, Total=1560 [2023-12-21 19:19:50,688 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 43 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-21 19:19:50,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 109 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-21 19:19:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-21 19:19:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-21 19:19:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:19:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-21 19:19:50,691 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 25 [2023-12-21 19:19:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:19:50,692 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-21 19:19:50,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.3) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 19:19:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-21 19:19:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 19:19:50,692 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:19:50,692 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:19:50,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-21 19:19:50,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-21 19:19:51,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:19:51,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:19:51,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:19:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash 391671843, now seen corresponding path program 2 times [2023-12-21 19:19:51,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:19:51,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940682594] [2023-12-21 19:19:51,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:19:51,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:19:51,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:19:51,099 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:19:51,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-21 19:19:51,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 19:19:51,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:19:51,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 19:19:51,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:19:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:19:51,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:19:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 19:19:52,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:19:52,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940682594] [2023-12-21 19:19:52,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940682594] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:19:52,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:19:52,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2023-12-21 19:19:52,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958179096] [2023-12-21 19:19:52,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:19:52,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 19:19:52,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:19:52,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 19:19:52,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-12-21 19:19:52,174 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 19:19:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:19:52,784 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-12-21 19:19:52,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 19:19:52,795 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-12-21 19:19:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:19:52,795 INFO L225 Difference]: With dead ends: 32 [2023-12-21 19:19:52,795 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 19:19:52,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-12-21 19:19:52,796 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 19:19:52,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 92 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 19:19:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 19:19:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-21 19:19:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:19:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-21 19:19:52,800 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 26 [2023-12-21 19:19:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:19:52,800 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-21 19:19:52,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 19:19:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-21 19:19:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 19:19:52,801 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:19:52,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:19:52,810 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-21 19:19:53,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:19:53,002 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:19:53,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:19:53,002 INFO L85 PathProgramCache]: Analyzing trace with hash -716533849, now seen corresponding path program 3 times [2023-12-21 19:19:53,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:19:53,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281444938] [2023-12-21 19:19:53,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 19:19:53,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:19:53,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:19:53,004 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:19:53,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-21 19:19:53,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 19:19:53,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:19:53,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-21 19:19:53,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:19:53,556 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-21 19:19:53,565 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-21 19:19:53,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-21 19:19:53,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-21 19:19:54,993 INFO L349 Elim1Store]: treesize reduction 150, result has 25.4 percent of original size [2023-12-21 19:19:54,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 86 [2023-12-21 19:19:55,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:19:55,896 INFO L349 Elim1Store]: treesize reduction 70, result has 27.8 percent of original size [2023-12-21 19:19:55,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 69 [2023-12-21 19:19:57,437 INFO L349 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2023-12-21 19:19:57,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 176 [2023-12-21 19:19:57,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:19:57,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 164 [2023-12-21 19:19:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:19:59,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:20:47,831 WARN L854 $PredicateComparison]: unable to prove that (or (not (bvslt ((_ sign_extend 32) (_ bv1 32)) c_~ARR_SIZE~0)) (let ((.cse5 (bvmul (bvadd (_ bv1 64) c_~ARR_SIZE~0) (bvadd (_ bv18446744073709551615 64) c_~ARR_SIZE~0)))) (and (forall ((|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_2| (_ BitVec 32))) (or (= (_ bv0 64) (bvsrem |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ bv2 64))) (bvslt |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| c_~ARR_SIZE~0) (bvsle (let ((.cse4 ((_ sign_extend 32) |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_2|))) (let ((.cse2 (bvmul (_ bv4 32) ((_ extract 31 0) |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5|))) (.cse3 (bvmul |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| .cse4))) (let ((.cse0 (store (select |c_#memory_int#1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (bvadd |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5| .cse2) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse3 .cse4) .cse4) .cse4)))) (.cse1 (store (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) (bvadd |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5| .cse2) ((_ extract 31 0) .cse3)))) (bvadd (bvmul ((_ sign_extend 32) (select .cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5|))) (_ bv4 64)) (bvmul |v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_5| (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse1 |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5|)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse0 |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5|)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5|)))))))) .cse5))) (forall ((|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_2| (_ BitVec 32))) (or (bvsge |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ bv0 64)) (= (_ bv0 64) (bvsrem |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ bv2 64))) (bvsle (let ((.cse10 ((_ sign_extend 32) |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_2|))) (let ((.cse8 (bvmul (_ bv4 32) ((_ extract 31 0) |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5|))) (.cse9 (bvmul |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| .cse10))) (let ((.cse6 (store (select |c_#memory_int#1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (bvadd |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5| .cse8) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse9 .cse10) .cse10) .cse10)))) (.cse7 (store (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) (bvadd |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5| .cse8) ((_ extract 31 0) .cse9)))) (bvadd (bvmul ((_ sign_extend 32) (select .cse6 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5|))) (_ bv4 64)) (bvmul |v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_5| (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse7 |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5|)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse6 |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5|)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse7 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5|)))))))) .cse5))))) (bvslt ((_ sign_extend 32) (_ bv2 32)) c_~ARR_SIZE~0) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from false [2023-12-21 19:20:54,922 WARN L854 $PredicateComparison]: unable to prove that (or (not (bvslt ((_ sign_extend 32) (_ bv1 32)) c_~ARR_SIZE~0)) (= (_ bv0 32) c_assume_abort_if_not_~cond) (let ((.cse5 (bvmul (bvadd (_ bv1 64) c_~ARR_SIZE~0) (bvadd (_ bv18446744073709551615 64) c_~ARR_SIZE~0)))) (and (forall ((|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_2| (_ BitVec 32))) (or (= (_ bv0 64) (bvsrem |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ bv2 64))) (bvslt |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| c_~ARR_SIZE~0) (bvsle (let ((.cse4 ((_ sign_extend 32) |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_2|))) (let ((.cse2 (bvmul (_ bv4 32) ((_ extract 31 0) |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5|))) (.cse3 (bvmul |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| .cse4))) (let ((.cse0 (store (select |c_#memory_int#1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (bvadd |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5| .cse2) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse3 .cse4) .cse4) .cse4)))) (.cse1 (store (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) (bvadd |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5| .cse2) ((_ extract 31 0) .cse3)))) (bvadd (bvmul ((_ sign_extend 32) (select .cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5|))) (_ bv4 64)) (bvmul |v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_5| (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse1 |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5|)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse0 |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5|)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5|)))))))) .cse5))) (forall ((|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_2| (_ BitVec 32))) (or (bvsge |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ bv0 64)) (= (_ bv0 64) (bvsrem |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ bv2 64))) (bvsle (let ((.cse10 ((_ sign_extend 32) |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_2|))) (let ((.cse8 (bvmul (_ bv4 32) ((_ extract 31 0) |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5|))) (.cse9 (bvmul |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| .cse10))) (let ((.cse6 (store (select |c_#memory_int#1| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (bvadd |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5| .cse8) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse9 .cse10) .cse10) .cse10)))) (.cse7 (store (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) (bvadd |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5| .cse8) ((_ extract 31 0) .cse9)))) (bvadd (bvmul ((_ sign_extend 32) (select .cse6 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5|))) (_ bv4 64)) (bvmul |v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_5| (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse7 |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5|)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse6 |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_5|)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse7 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_5|)))))))) .cse5))))) (bvslt ((_ sign_extend 32) (_ bv2 32)) c_~ARR_SIZE~0) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from false [2023-12-21 19:21:19,156 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 182 treesize of output 178 [2023-12-21 19:21:19,164 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 178 treesize of output 174 [2023-12-21 19:21:19,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:21:19,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7566 treesize of output 7518 [2023-12-21 19:21:19,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:21:19,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165862 treesize of output 163558 [2023-12-21 19:23:52,811 WARN L293 SmtUtils]: Spent 14.38s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:23:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 19:23:53,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:23:53,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281444938] [2023-12-21 19:23:53,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281444938] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:23:53,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:23:53,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 37 [2023-12-21 19:23:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113567091] [2023-12-21 19:23:53,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:23:53,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-21 19:23:53,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:23:53,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-21 19:23:53,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1010, Unknown=11, NotChecked=134, Total=1332 [2023-12-21 19:23:53,078 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 37 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 33 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 19:23:55,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 19:23:59,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:24:05,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:24:14,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:24:25,518 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse1 (not (bvslt ((_ sign_extend 32) (_ bv1 32)) c_~ARR_SIZE~0))) (.cse5 (bvmul ((_ sign_extend 32) (select .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64))) (.cse6 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#array1~0#1.offset|))))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (bvadd (bvmul ((_ extract 31 0) |c_ULTIMATE.start_main_~index~0#1|) (_ bv4 32)) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse2 (bvmul (_ bv4 64) |c_ULTIMATE.start_main_~sum~0#1|)) (.cse12 ((_ sign_extend 32) |c_ULTIMATE.start_main_~num~0#1|)) (.cse8 (bvmul (bvadd (_ bv1 64) c_~ARR_SIZE~0) (bvadd (_ bv18446744073709551615 64) c_~ARR_SIZE~0))) (.cse9 (bvslt ((_ sign_extend 32) (_ bv2 32)) c_~ARR_SIZE~0))) (and (= (select .cse0 (_ bv4 32)) (_ bv0 32)) (or .cse1 (bvsle (let ((.cse3 (store .cse0 .cse7 ((_ extract 31 0) |c_ULTIMATE.start_main_#t~ite8#1|)))) (bvadd .cse2 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse3 .cse4))) .cse5 .cse6 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))))) .cse8) .cse9) (= (_ bv0 64) |c_ULTIMATE.start_main_~sum~0#1|) (= (select .cse10 (_ bv0 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt c_~ARR_SIZE~0 (_ bv0 64)) (= (bvadd |c_ULTIMATE.start_main_~num~0#1| (_ bv1 32)) (_ bv0 32)) (= (select .cse0 (_ bv0 32)) (_ bv0 32)) (= (select .cse10 (_ bv4 32)) (_ bv0 32)) (or .cse1 (= (_ bv0 64) (bvsrem |c_ULTIMATE.start_main_~index~0#1| (_ bv2 64))) .cse9 (bvsle (let ((.cse11 (store .cse0 .cse7 ((_ extract 31 0) (bvmul .cse12 |c_ULTIMATE.start_main_~index~0#1|))))) (bvadd .cse2 (bvmul ((_ sign_extend 32) (select .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv4 64)) .cse5 .cse6 (bvmul ((_ sign_extend 32) (select .cse11 .cse4)) (_ bv4 64)))) .cse8)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_28| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_28|) c_~ARR_SIZE~0)) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (or (let ((.cse29 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|)) (.cse20 (bvmul (_ bv8 64) ((_ sign_extend 32) (_ bv0 32))))) (let ((.cse14 (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse50 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (not (bvslt .cse50 c_~ARR_SIZE~0)) (not (bvsge .cse50 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse50 (_ bv2 64))) (bvsle (let ((.cse51 (bvmul .cse12 .cse50))) (bvadd .cse2 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse51)) (_ bv4 64)) .cse20 (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse51))))) (_ bv4 64)))) .cse8))))) (.cse13 (= (bvadd .cse29 (_ bv4 32)) (_ bv0 32))) (.cse15 (= .cse29 (_ bv0 32)))) (and (or (not .cse13) .cse14) (or .cse14 (not .cse15)) (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse21 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (let ((.cse22 (bvmul .cse12 .cse21))) (let ((.cse16 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse22)) (_ bv4 64))) (.cse17 (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse22))))) (_ bv4 64)))) (or (forall ((v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (let ((.cse18 (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49))) (.cse19 (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64)))) (or (bvsle (bvadd .cse2 .cse16 .cse17 .cse18 .cse19) .cse8) (bvsle (bvadd .cse2 .cse20 .cse18 .cse19) .cse8)))) (not (bvslt .cse21 c_~ARR_SIZE~0)) (not (bvsge .cse21 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse21 (_ bv2 64))) (bvsle (bvadd .cse2 .cse16 .cse20 .cse17) .cse8)))))) (or (and (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse26 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (forall ((v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (let ((.cse24 (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49))) (.cse25 (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64)))) (or (bvsle (let ((.cse23 (bvmul .cse12 .cse26))) (bvadd .cse2 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse23)) (_ bv4 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse23))))) (_ bv4 64)) .cse24 .cse25)) .cse8) (bvsle (bvadd .cse2 .cse20 .cse24 .cse25) .cse8)))) (not (bvslt .cse26 c_~ARR_SIZE~0)) (not (bvsge .cse26 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse26 (_ bv2 64)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse27 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (not (bvslt .cse27 c_~ARR_SIZE~0)) (not (bvsge .cse27 (_ bv0 64))) (forall ((v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (bvsle (let ((.cse28 (bvmul .cse12 .cse27))) (bvadd .cse2 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse28)) (_ bv4 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse28))))) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49)) (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64)))) .cse8)) (= (_ bv0 64) (bvsrem .cse27 (_ bv2 64))))))) (not (= .cse29 (_ bv4 32)))) (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse30 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (let ((.cse33 (bvmul .cse12 .cse30))) (let ((.cse31 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse33)) (_ bv4 64))) (.cse32 (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse33))))) (_ bv4 64)))) (or (not (bvslt .cse30 c_~ARR_SIZE~0)) (not (bvsge .cse30 (_ bv0 64))) (forall ((v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (bvsle (bvadd .cse2 .cse31 .cse32 (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49)) (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64))) .cse8)) (= (_ bv0 64) (bvsrem .cse30 (_ bv2 64))) (bvsle (bvadd .cse2 .cse31 .cse20 .cse32) .cse8)))))) (or (and (or .cse13 (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16)) (v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (let ((.cse35 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (bvsle (let ((.cse34 (bvmul .cse12 .cse35))) (bvadd .cse2 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse34)) (_ bv4 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse34))))) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49)) (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64)))) .cse8) (not (bvslt .cse35 c_~ARR_SIZE~0)) (not (bvsge .cse35 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse35 (_ bv2 64))))))) (or .cse13 (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16)) (v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (let ((.cse37 (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49))) (.cse38 (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64))) (.cse39 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (bvsle (let ((.cse36 (bvmul .cse12 .cse39))) (bvadd .cse2 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse36)) (_ bv4 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse36))))) (_ bv4 64)) .cse37 .cse38)) .cse8) (bvsle (bvadd .cse2 .cse20 .cse37 .cse38) .cse8) (not (bvslt .cse39 c_~ARR_SIZE~0)) (not (bvsge .cse39 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse39 (_ bv2 64))))))) (forall ((v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (let ((.cse42 (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49))) (.cse43 (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64)))) (or (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse44 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (let ((.cse45 (bvmul .cse12 .cse44))) (let ((.cse40 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse45)) (_ bv4 64))) (.cse41 (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse45))))) (_ bv4 64)))) (or (bvsle (bvadd .cse2 .cse40 .cse41 .cse42 .cse43) .cse8) (not (bvslt .cse44 c_~ARR_SIZE~0)) (not (bvsge .cse44 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse44 (_ bv2 64))) (bvsle (bvadd .cse2 .cse40 .cse20 .cse41) .cse8)))))) (bvsle (bvadd .cse2 .cse20 .cse42 .cse43) .cse8)))) (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16)) (v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (let ((.cse48 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (let ((.cse49 (bvmul .cse12 .cse48))) (let ((.cse46 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse49)) (_ bv4 64))) (.cse47 (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse49))))) (_ bv4 64)))) (or (bvsle (bvadd .cse2 .cse46 .cse47 (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49)) (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64))) .cse8) (not (bvslt .cse48 c_~ARR_SIZE~0)) (not (bvsge .cse48 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse48 (_ bv2 64))) (bvsle (bvadd .cse2 .cse46 .cse20 .cse47) .cse8))))))) .cse15)))) .cse9)))) is different from true [2023-12-21 19:24:57,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:25:02,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 19:25:20,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 19:25:24,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 19:25:31,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 19:25:54,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 19:26:08,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 19:26:11,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:26:44,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:28:11,700 WARN L293 SmtUtils]: Spent 9.03s on a formula simplification. DAG size of input: 234 DAG size of output: 154 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:28:16,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 ((_ sign_extend 32) |c_ULTIMATE.start_main_~num~0#1|))) (let ((.cse34 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|)) (.cse6 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse22 (bvmul ((_ extract 31 0) |c_ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse23 (bvmul .cse12 |c_ULTIMATE.start_main_~index~0#1|)) (.cse16 ((_ sign_extend 32) (_ bv0 32)))) (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse37 (bvslt ((_ sign_extend 32) (_ bv1 32)) c_~ARR_SIZE~0)) (.cse41 (bvmul .cse16 (_ bv2 64))) (.cse40 ((_ sign_extend 32) (_ bv4294967295 32))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse46 (store .cse6 (bvadd .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|) ((_ extract 31 0) .cse23))) (.cse10 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse11 (bvadd .cse34 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse7 (bvadd .cse34 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse26 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse6 .cse7)))) (.cse27 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse10 .cse11)))) (.cse28 (bvslt ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))) c_~ARR_SIZE~0)) (.cse25 (= (_ bv0 64) (bvsrem |c_ULTIMATE.start_main_~index~0#1| (_ bv2 64)))) (.cse19 (bvmul ((_ sign_extend 32) (select .cse46 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv4 64))) (.cse21 (bvmul ((_ sign_extend 32) (select .cse46 .cse4)) (_ bv4 64))) (.cse15 (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16)) (v_prenex_1 (_ BitVec 16))) (let ((.cse44 ((_ sign_extend 48) v_prenex_1))) (let ((.cse42 (bvmul (_ bv4 32) ((_ extract 31 0) .cse44))) (.cse45 (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))))) (and (= (_ bv4 32) .cse42) (= (let ((.cse43 (bvmul .cse44 .cse40))) (bvadd ((_ sign_extend 32) ((_ extract 31 0) .cse43)) ((_ sign_extend 32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse40 .cse43) .cse40) .cse40))) .cse41)) |c_ULTIMATE.start_main_~sum~0#1|) (not (= .cse42 .cse45)) (not (= (_ bv0 32) .cse45))))))) (.cse18 (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse38 ((_ sign_extend 48) v_prenex_1))) (and (= (_ bv4 32) (bvmul (_ bv4 32) ((_ extract 31 0) .cse38))) (= (let ((.cse39 (bvmul .cse38 .cse40))) (bvadd ((_ sign_extend 32) ((_ extract 31 0) .cse39)) ((_ sign_extend 32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse40 .cse39) .cse40) .cse40))) .cse41)) |c_ULTIMATE.start_main_~sum~0#1|))))) (.cse24 (not .cse37)) (.cse0 (bvslt ((_ sign_extend 32) (_ bv2 32)) c_~ARR_SIZE~0)) (.cse1 (bvmul (_ bv4 64) |c_ULTIMATE.start_main_~sum~0#1|)) (.cse35 (bvmul ((_ sign_extend 32) (select .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64))) (.cse36 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse10 .cse5)))) (.cse14 (bvmul (bvadd (_ bv1 64) c_~ARR_SIZE~0) (bvadd (_ bv18446744073709551615 64) c_~ARR_SIZE~0)))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse13 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (bvsle (let ((.cse8 (bvmul (_ bv4 32) ((_ extract 31 0) .cse13))) (.cse9 (bvmul .cse12 .cse13))) (let ((.cse2 (store (store .cse10 .cse11 (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse9)))))) (.cse3 (store (store .cse6 .cse7 (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8) ((_ extract 31 0) .cse9)))) (bvadd .cse1 (bvmul ((_ sign_extend 32) (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse3 .cse4)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse2 .cse5)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv4 64))))) .cse14) (not (bvslt .cse13 c_~ARR_SIZE~0)) (not (bvsge .cse13 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse13 (_ bv2 64))))))) (or .cse15 (and (= (bvmul .cse16 (_ bv4 64)) |c_ULTIMATE.start_main_~sum~0#1|) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse17 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (and (bvsge .cse17 (_ bv0 64)) (not (= (_ bv0 64) (bvsrem .cse17 (_ bv2 64)))) (not (= (_ bv4 32) (bvmul (_ bv4 32) ((_ extract 31 0) .cse17)))) (bvslt .cse17 c_~ARR_SIZE~0))))) .cse18) (or (bvsle (let ((.cse20 (store .cse10 (bvadd .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse23))))))) (bvadd .cse1 .cse19 (bvmul ((_ sign_extend 32) (select .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse20 .cse5))) .cse21)) .cse14) .cse24 .cse25 .cse0) (or (bvsle (bvadd .cse1 .cse26 .cse27) .cse14) (not (bvslt ((_ sign_extend 32) |c_ULTIMATE.start_main_~count~0#1|) c_~ARR_SIZE~0)) .cse28) (or (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse33 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (bvsle (let ((.cse31 (bvmul (_ bv4 32) ((_ extract 31 0) .cse33))) (.cse32 (bvmul .cse12 .cse33))) (let ((.cse29 (store .cse10 (bvadd |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse31) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse32)))))) (.cse30 (store .cse6 (bvadd |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse31) ((_ extract 31 0) .cse32)))) (bvadd (bvmul ((_ sign_extend 32) (select .cse29 .cse5)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse30 .cse4))) .cse1 (bvmul ((_ sign_extend 32) (select .cse29 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse30 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv4 64))))) .cse14) (not (bvslt .cse33 c_~ARR_SIZE~0)) (not (bvsge .cse33 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse33 (_ bv2 64)))))) .cse0) (or (bvsle (bvadd .cse1 .cse26 .cse27 (bvmul ((_ sign_extend 32) (select .cse10 (bvadd .cse34 (_ bv4 32) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse6 (bvadd .cse34 (_ bv4 32) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (_ bv4 64))) .cse14) (not .cse28) (bvslt ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)) c_~ARR_SIZE~0)) (or .cse24 .cse25 .cse0 (bvsle (bvadd .cse1 .cse19 .cse35 .cse36 .cse21) .cse14)) (or .cse15 .cse18) (not .cse0) .cse37 (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_28| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_28|) c_~ARR_SIZE~0)) (or .cse24 .cse0 (bvsle (bvadd .cse1 .cse35 .cse36 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse6 .cse4))) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))) .cse14)) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) is different from false [2023-12-21 19:28:22,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 19:28:26,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 19:28:30,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:28:34,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:28:36,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:28:39,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:28:43,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:29:19,216 WARN L293 SmtUtils]: Spent 11.58s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:29:20,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:29:25,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:29:30,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:29:32,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:29:36,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:29:42,088 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ sign_extend 32) |c_ULTIMATE.start_main_~num~0#1|))) (let ((.cse13 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse6 (bvmul ((_ extract 31 0) |c_ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse8 (bvmul .cse7 |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse16 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse35 (store .cse13 (bvadd .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|) ((_ extract 31 0) .cse8))) (.cse34 (bvslt ((_ sign_extend 32) (_ bv1 32)) c_~ARR_SIZE~0))) (let ((.cse10 (not .cse34)) (.cse11 (= (_ bv0 64) (bvsrem |c_ULTIMATE.start_main_~index~0#1| (_ bv2 64)))) (.cse1 (bvmul (_ bv4 64) |c_ULTIMATE.start_main_~sum~0#1|)) (.cse2 (bvmul ((_ sign_extend 32) (select .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv4 64))) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse5 (bvmul ((_ sign_extend 32) (select .cse35 .cse16)) (_ bv4 64))) (.cse9 (bvmul (bvadd (_ bv1 64) c_~ARR_SIZE~0) (bvadd (_ bv18446744073709551615 64) c_~ARR_SIZE~0))) (.cse23 ((_ sign_extend 32) (_ bv4294967295 32))) (.cse12 (bvslt ((_ sign_extend 32) (_ bv2 32)) c_~ARR_SIZE~0))) (and (= (_ bv0 64) |c_ULTIMATE.start_main_~sum~0#1|) (= (select .cse0 (_ bv0 32)) (_ bv0 32)) (or (bvsle (let ((.cse3 (store .cse0 (bvadd .cse6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) ((_ extract 31 0) (bvmul .cse7 (bvmul .cse7 (bvmul .cse7 .cse8))))))) (bvadd .cse1 .cse2 (bvmul ((_ sign_extend 32) (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse3 .cse4))) .cse5)) .cse9) .cse10 .cse11 .cse12) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (= (select .cse13 (_ bv0 32)) (_ bv0 32)) (or (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse19 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (bvsle (let ((.cse17 (bvmul (_ bv4 32) ((_ extract 31 0) .cse19))) (.cse18 (bvmul .cse7 .cse19))) (let ((.cse14 (store .cse0 (bvadd |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse17) ((_ extract 31 0) (bvmul .cse7 (bvmul .cse7 (bvmul .cse7 .cse18)))))) (.cse15 (store .cse13 (bvadd |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse17) ((_ extract 31 0) .cse18)))) (bvadd (bvmul ((_ sign_extend 32) (select .cse14 .cse4)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse15 .cse16))) .cse1 (bvmul ((_ sign_extend 32) (select .cse14 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse15 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv4 64))))) .cse9) (not (bvslt .cse19 c_~ARR_SIZE~0)) (not (bvsge .cse19 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse19 (_ bv2 64)))))) .cse12) (or (and (= (select .cse13 (_ bv4 32)) (_ bv0 32)) (= (select .cse0 (_ bv4 32)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse20 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (let ((.cse21 (bvmul (_ bv4 32) ((_ extract 31 0) .cse20))) (.cse22 (bvmul .cse20 .cse23))) (and (bvsge .cse20 (_ bv0 64)) (not (= (_ bv0 64) (bvsrem .cse20 (_ bv2 64)))) (= (select .cse13 .cse21) ((_ extract 31 0) .cse22)) (bvslt .cse20 c_~ARR_SIZE~0) (= (select .cse0 .cse21) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse22 .cse23) .cse23) .cse23)))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse26 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (let ((.cse24 (bvmul (_ bv4 32) ((_ extract 31 0) .cse26))) (.cse25 (bvmul .cse26 .cse23))) (and (= (select .cse13 .cse24) ((_ extract 31 0) .cse25)) (= (_ bv4 32) .cse24) (bvslt .cse26 c_~ARR_SIZE~0) (= (select .cse0 .cse24) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse25 .cse23) .cse23) .cse23)))))))) (or .cse10 .cse11 .cse12 (bvsle (bvadd .cse1 .cse2 (bvmul ((_ sign_extend 32) (select .cse0 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse0 .cse4))) .cse5) .cse9)) (let ((.cse29 (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (or (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16)) (v_prenex_1 (_ BitVec 16))) (let ((.cse30 ((_ sign_extend 48) v_prenex_1))) (let ((.cse27 (bvmul (_ bv4 32) ((_ extract 31 0) .cse30))) (.cse31 (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))))) (and (= (_ bv4 32) .cse27) (= (let ((.cse28 (bvmul .cse30 .cse23))) (bvadd ((_ sign_extend 32) ((_ extract 31 0) .cse28)) ((_ sign_extend 32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse23 .cse28) .cse23) .cse23))) .cse29)) |c_ULTIMATE.start_main_~sum~0#1|) (not (= .cse27 .cse31)) (not (= (_ bv0 32) .cse31)))))) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse32 ((_ sign_extend 48) v_prenex_1))) (and (= (_ bv4 32) (bvmul (_ bv4 32) ((_ extract 31 0) .cse32))) (= (let ((.cse33 (bvmul .cse32 .cse23))) (bvadd ((_ sign_extend 32) ((_ extract 31 0) .cse33)) ((_ sign_extend 32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse23 .cse33) .cse23) .cse23))) .cse29)) |c_ULTIMATE.start_main_~sum~0#1|)))))) (not .cse12) .cse34 (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_28| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_28|) c_~ARR_SIZE~0)) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32))))))) is different from false [2023-12-21 19:29:44,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:29:53,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:29:54,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:29:58,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:30:02,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:30:07,587 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse27 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|)) (.cse16 ((_ sign_extend 32) (_ bv0 32)))) (let ((.cse41 (bvmul .cse16 (_ bv2 64))) (.cse31 ((_ sign_extend 32) (_ bv4294967295 32))) (.cse10 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse11 (bvadd .cse27 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse6 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (bvadd .cse27 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse19 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse6 .cse7)))) (.cse20 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse10 .cse11)))) (.cse21 (bvslt ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))) c_~ARR_SIZE~0)) (.cse15 (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16)) (v_prenex_1 (_ BitVec 16))) (let ((.cse44 ((_ sign_extend 48) v_prenex_1))) (let ((.cse42 (bvmul (_ bv4 32) ((_ extract 31 0) .cse44))) (.cse45 (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))))) (and (= (_ bv4 32) .cse42) (= (let ((.cse43 (bvmul .cse44 .cse31))) (bvadd ((_ sign_extend 32) ((_ extract 31 0) .cse43)) ((_ sign_extend 32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse31 .cse43) .cse31) .cse31))) .cse41)) |c_ULTIMATE.start_main_~sum~0#1|) (not (= .cse42 .cse45)) (not (= (_ bv0 32) .cse45))))))) (.cse18 (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse39 ((_ sign_extend 48) v_prenex_1))) (and (= (_ bv4 32) (bvmul (_ bv4 32) ((_ extract 31 0) .cse39))) (= (let ((.cse40 (bvmul .cse39 .cse31))) (bvadd ((_ sign_extend 32) ((_ extract 31 0) .cse40)) ((_ sign_extend 32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse31 .cse40) .cse31) .cse31))) .cse41)) |c_ULTIMATE.start_main_~sum~0#1|))))) (.cse1 (bvmul (_ bv4 64) |c_ULTIMATE.start_main_~sum~0#1|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse12 ((_ sign_extend 32) |c_ULTIMATE.start_main_~num~0#1|)) (.cse14 (bvmul (bvadd (_ bv1 64) c_~ARR_SIZE~0) (bvadd (_ bv18446744073709551615 64) c_~ARR_SIZE~0))) (.cse0 (bvslt ((_ sign_extend 32) (_ bv2 32)) c_~ARR_SIZE~0))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse13 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (bvsle (let ((.cse8 (bvmul (_ bv4 32) ((_ extract 31 0) .cse13))) (.cse9 (bvmul .cse12 .cse13))) (let ((.cse2 (store (store .cse10 .cse11 (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse9)))))) (.cse3 (store (store .cse6 .cse7 (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8) ((_ extract 31 0) .cse9)))) (bvadd .cse1 (bvmul ((_ sign_extend 32) (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse3 .cse4)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse2 .cse5)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv4 64))))) .cse14) (not (bvslt .cse13 c_~ARR_SIZE~0)) (not (bvsge .cse13 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse13 (_ bv2 64))))))) (or .cse15 (and (= (bvmul .cse16 (_ bv4 64)) |c_ULTIMATE.start_main_~sum~0#1|) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse17 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (and (bvsge .cse17 (_ bv0 64)) (not (= (_ bv0 64) (bvsrem .cse17 (_ bv2 64)))) (not (= (_ bv4 32) (bvmul (_ bv4 32) ((_ extract 31 0) .cse17)))) (bvslt .cse17 c_~ARR_SIZE~0))))) .cse18) (= (_ bv0 64) |c_ULTIMATE.start_main_~sum~0#1|) (= (select .cse10 (_ bv0 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (or (bvsle (bvadd .cse1 .cse19 .cse20) .cse14) (not (bvslt ((_ sign_extend 32) |c_ULTIMATE.start_main_~count~0#1|) c_~ARR_SIZE~0)) .cse21) (= (select .cse6 (_ bv0 32)) (_ bv0 32)) (or (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse26 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (bvsle (let ((.cse24 (bvmul (_ bv4 32) ((_ extract 31 0) .cse26))) (.cse25 (bvmul .cse12 .cse26))) (let ((.cse22 (store .cse10 (bvadd |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse24) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse25)))))) (.cse23 (store .cse6 (bvadd |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse24) ((_ extract 31 0) .cse25)))) (bvadd (bvmul ((_ sign_extend 32) (select .cse22 .cse5)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse23 .cse4))) .cse1 (bvmul ((_ sign_extend 32) (select .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv4 64))))) .cse14) (not (bvslt .cse26 c_~ARR_SIZE~0)) (not (bvsge .cse26 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse26 (_ bv2 64)))))) .cse0) (or (bvsle (bvadd .cse1 .cse19 .cse20 (bvmul ((_ sign_extend 32) (select .cse10 (bvadd .cse27 (_ bv4 32) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse6 (bvadd .cse27 (_ bv4 32) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (_ bv4 64))) .cse14) (not .cse21) (bvslt ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)) c_~ARR_SIZE~0)) (or (and (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= (select .cse10 (_ bv4 32)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse28 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (let ((.cse29 (bvmul (_ bv4 32) ((_ extract 31 0) .cse28))) (.cse30 (bvmul .cse28 .cse31))) (and (bvsge .cse28 (_ bv0 64)) (not (= (_ bv0 64) (bvsrem .cse28 (_ bv2 64)))) (= (select .cse6 .cse29) ((_ extract 31 0) .cse30)) (bvslt .cse28 c_~ARR_SIZE~0) (= (select .cse10 .cse29) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse30 .cse31) .cse31) .cse31)))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse34 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (let ((.cse32 (bvmul (_ bv4 32) ((_ extract 31 0) .cse34))) (.cse33 (bvmul .cse34 .cse31))) (and (= (select .cse6 .cse32) ((_ extract 31 0) .cse33)) (= (_ bv4 32) .cse32) (bvslt .cse34 c_~ARR_SIZE~0) (= (select .cse10 .cse32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse33 .cse31) .cse31) .cse31)))))))) (or .cse15 .cse18) (not .cse0) (bvslt ((_ sign_extend 32) (_ bv1 32)) c_~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_28| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_28|) c_~ARR_SIZE~0)) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (or (bvsle (let ((.cse37 (bvmul ((_ extract 31 0) |c_ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse38 (bvmul .cse12 |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse36 (store .cse10 (bvadd .cse37 |c_ULTIMATE.start_main_~#array1~0#1.offset|) ((_ extract 31 0) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 .cse38)))))) (.cse35 (store .cse6 (bvadd .cse37 |c_ULTIMATE.start_main_~#array2~0#1.offset|) ((_ extract 31 0) .cse38)))) (bvadd .cse1 (bvmul ((_ sign_extend 32) (select .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse36 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse36 .cse5))) (bvmul ((_ sign_extend 32) (select .cse35 .cse4)) (_ bv4 64))))) .cse14) (= (_ bv0 64) (bvsrem |c_ULTIMATE.start_main_~index~0#1| (_ bv2 64))) (not (bvslt |c_ULTIMATE.start_main_~index~0#1| c_~ARR_SIZE~0)) (not (bvsge |c_ULTIMATE.start_main_~index~0#1| (_ bv0 64))) .cse0))))) is different from false [2023-12-21 19:30:23,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 19:30:29,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 19:30:34,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 19:30:38,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 19:30:43,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 19:30:47,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:30:58,247 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ sign_extend 32) |c_ULTIMATE.start_main_~num~0#1|)) (.cse22 (bvmul ((_ extract 31 0) |c_ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (let ((.cse6 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse18 (bvadd .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse23 (bvmul .cse11 |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse10 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse68 (store .cse6 .cse18 ((_ extract 31 0) .cse23)))) (let ((.cse24 (= (_ bv0 64) (bvsrem |c_ULTIMATE.start_main_~index~0#1| (_ bv2 64)))) (.cse19 (bvmul ((_ sign_extend 32) (select .cse68 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv4 64))) (.cse21 (bvmul ((_ sign_extend 32) (select .cse68 .cse4)) (_ bv4 64))) (.cse14 (not (bvslt ((_ sign_extend 32) (_ bv1 32)) c_~ARR_SIZE~0))) (.cse16 (bvmul ((_ sign_extend 32) (select .cse10 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64))) (.cse17 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse10 .cse5)))) (.cse7 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|)) (.cse1 (bvmul (_ bv4 64) |c_ULTIMATE.start_main_~sum~0#1|)) (.cse13 (bvmul (bvadd (_ bv1 64) c_~ARR_SIZE~0) (bvadd (_ bv18446744073709551615 64) c_~ARR_SIZE~0))) (.cse0 (bvslt ((_ sign_extend 32) (_ bv2 32)) c_~ARR_SIZE~0))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse12 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (bvsle (let ((.cse8 (bvmul (_ bv4 32) ((_ extract 31 0) .cse12))) (.cse9 (bvmul .cse11 .cse12))) (let ((.cse2 (store (store .cse10 (bvadd .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse11 .cse9)))))) (.cse3 (store (store .cse6 (bvadd .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8) ((_ extract 31 0) .cse9)))) (bvadd .cse1 (bvmul ((_ sign_extend 32) (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse3 .cse4)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse2 .cse5)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv4 64))))) .cse13) (not (bvslt .cse12 c_~ARR_SIZE~0)) (not (bvsge .cse12 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse12 (_ bv2 64))))))) (or .cse14 (bvsle (let ((.cse15 (store .cse6 .cse18 ((_ extract 31 0) |c_ULTIMATE.start_main_#t~ite8#1|)))) (bvadd .cse1 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse15 .cse4))) .cse16 .cse17 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse15 |c_ULTIMATE.start_main_~#array2~0#1.offset|))))) .cse13) .cse0) (or (bvsle (let ((.cse20 (store .cse10 (bvadd .cse22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse11 .cse23))))))) (bvadd .cse1 .cse19 (bvmul ((_ sign_extend 32) (select .cse20 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse20 .cse5))) .cse21)) .cse13) .cse14 .cse24 .cse0) (bvsgt c_~ARR_SIZE~0 (_ bv0 64)) (or (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse29 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (bvsle (let ((.cse27 (bvmul (_ bv4 32) ((_ extract 31 0) .cse29))) (.cse28 (bvmul .cse11 .cse29))) (let ((.cse25 (store .cse10 (bvadd |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse27) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse11 .cse28)))))) (.cse26 (store .cse6 (bvadd |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse27) ((_ extract 31 0) .cse28)))) (bvadd (bvmul ((_ sign_extend 32) (select .cse25 .cse5)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse26 .cse4))) .cse1 (bvmul ((_ sign_extend 32) (select .cse25 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv4 64))))) .cse13) (not (bvslt .cse29 c_~ARR_SIZE~0)) (not (bvsge .cse29 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse29 (_ bv2 64)))))) .cse0) (or .cse14 .cse24 .cse0 (bvsle (bvadd .cse1 .cse19 .cse16 .cse17 .cse21) .cse13)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_28| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_28|) c_~ARR_SIZE~0)) (or .cse14 .cse0 (bvsle (bvadd .cse1 .cse16 .cse17 (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse6 .cse4))) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))) .cse13)) (or (let ((.cse37 (bvmul (_ bv8 64) ((_ sign_extend 32) (_ bv0 32))))) (let ((.cse31 (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse66 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (not (bvslt .cse66 c_~ARR_SIZE~0)) (not (bvsge .cse66 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse66 (_ bv2 64))) (bvsle (let ((.cse67 (bvmul .cse11 .cse66))) (bvadd .cse1 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse67)) (_ bv4 64)) .cse37 (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse11 .cse67))))) (_ bv4 64)))) .cse13))))) (.cse30 (= (bvadd .cse7 (_ bv4 32)) (_ bv0 32))) (.cse32 (= .cse7 (_ bv0 32)))) (and (or (not .cse30) .cse31) (or .cse31 (not .cse32)) (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse38 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (let ((.cse39 (bvmul .cse11 .cse38))) (let ((.cse33 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse39)) (_ bv4 64))) (.cse34 (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse11 .cse39))))) (_ bv4 64)))) (or (forall ((v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (let ((.cse35 (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49))) (.cse36 (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64)))) (or (bvsle (bvadd .cse1 .cse33 .cse34 .cse35 .cse36) .cse13) (bvsle (bvadd .cse1 .cse37 .cse35 .cse36) .cse13)))) (not (bvslt .cse38 c_~ARR_SIZE~0)) (not (bvsge .cse38 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse38 (_ bv2 64))) (bvsle (bvadd .cse1 .cse33 .cse37 .cse34) .cse13)))))) (or (and (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse43 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (forall ((v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (let ((.cse41 (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49))) (.cse42 (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64)))) (or (bvsle (let ((.cse40 (bvmul .cse11 .cse43))) (bvadd .cse1 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse40)) (_ bv4 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse11 .cse40))))) (_ bv4 64)) .cse41 .cse42)) .cse13) (bvsle (bvadd .cse1 .cse37 .cse41 .cse42) .cse13)))) (not (bvslt .cse43 c_~ARR_SIZE~0)) (not (bvsge .cse43 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse43 (_ bv2 64)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse44 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (not (bvslt .cse44 c_~ARR_SIZE~0)) (not (bvsge .cse44 (_ bv0 64))) (forall ((v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (bvsle (let ((.cse45 (bvmul .cse11 .cse44))) (bvadd .cse1 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse45)) (_ bv4 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse11 .cse45))))) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49)) (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64)))) .cse13)) (= (_ bv0 64) (bvsrem .cse44 (_ bv2 64))))))) (not (= .cse7 (_ bv4 32)))) (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse46 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (let ((.cse49 (bvmul .cse11 .cse46))) (let ((.cse47 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse49)) (_ bv4 64))) (.cse48 (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse11 .cse49))))) (_ bv4 64)))) (or (not (bvslt .cse46 c_~ARR_SIZE~0)) (not (bvsge .cse46 (_ bv0 64))) (forall ((v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (bvsle (bvadd .cse1 .cse47 .cse48 (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49)) (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64))) .cse13)) (= (_ bv0 64) (bvsrem .cse46 (_ bv2 64))) (bvsle (bvadd .cse1 .cse47 .cse37 .cse48) .cse13)))))) (or (and (or .cse30 (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16)) (v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (let ((.cse51 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (bvsle (let ((.cse50 (bvmul .cse11 .cse51))) (bvadd .cse1 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse50)) (_ bv4 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse11 .cse50))))) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49)) (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64)))) .cse13) (not (bvslt .cse51 c_~ARR_SIZE~0)) (not (bvsge .cse51 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse51 (_ bv2 64))))))) (or .cse30 (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16)) (v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (let ((.cse53 (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49))) (.cse54 (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64))) (.cse55 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (or (bvsle (let ((.cse52 (bvmul .cse11 .cse55))) (bvadd .cse1 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse52)) (_ bv4 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse11 .cse52))))) (_ bv4 64)) .cse53 .cse54)) .cse13) (bvsle (bvadd .cse1 .cse37 .cse53 .cse54) .cse13) (not (bvslt .cse55 c_~ARR_SIZE~0)) (not (bvsge .cse55 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse55 (_ bv2 64))))))) (forall ((v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (let ((.cse58 (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49))) (.cse59 (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64)))) (or (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16))) (let ((.cse60 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (let ((.cse61 (bvmul .cse11 .cse60))) (let ((.cse56 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse61)) (_ bv4 64))) (.cse57 (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse11 .cse61))))) (_ bv4 64)))) (or (bvsle (bvadd .cse1 .cse56 .cse57 .cse58 .cse59) .cse13) (not (bvslt .cse60 c_~ARR_SIZE~0)) (not (bvsge .cse60 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse60 (_ bv2 64))) (bvsle (bvadd .cse1 .cse56 .cse37 .cse57) .cse13)))))) (bvsle (bvadd .cse1 .cse37 .cse58 .cse59) .cse13)))) (forall ((|v_ULTIMATE.start_main_#t~nondet6#1_23| (_ BitVec 16)) (v_arrayElimCell_49 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32))) (let ((.cse64 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_23|))) (let ((.cse65 (bvmul .cse11 .cse64))) (let ((.cse62 (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse65)) (_ bv4 64))) (.cse63 (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse11 .cse65))))) (_ bv4 64)))) (or (bvsle (bvadd .cse1 .cse62 .cse63 (bvmul (_ bv4 64) ((_ sign_extend 32) v_arrayElimCell_49)) (bvmul ((_ sign_extend 32) v_arrayElimCell_48) (_ bv4 64))) .cse13) (not (bvslt .cse64 c_~ARR_SIZE~0)) (not (bvsge .cse64 (_ bv0 64))) (= (_ bv0 64) (bvsrem .cse64 (_ bv2 64))) (bvsle (bvadd .cse1 .cse62 .cse37 .cse63) .cse13))))))) .cse32)))) .cse0)))))) is different from true [2023-12-21 19:31:25,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 19:31:40,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 19:31:53,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2023-12-21 19:32:20,962 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-21 19:32:20,973 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 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 19:32:21,986 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-21 19:32:22,163 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-21 19:32:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-21 19:32:22,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 522.7s TimeCoverageRelationStatistics Valid=565, Invalid=2961, Unknown=42, NotChecked=854, Total=4422 [2023-12-21 19:32:22,245 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 87 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 64 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 164.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 521 IncrementalHoareTripleChecker+Unchecked, 169.6s IncrementalHoareTripleChecker+Time [2023-12-21 19:32:22,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 230 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 514 Invalid, 21 Unknown, 521 Unchecked, 169.6s Time] [2023-12-21 19:32:22,246 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 19:32:22,246 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (28states) and FLOYD_HOARE automaton (currently 52 states, 37 states before enhancement),while executing Executor. [2023-12-21 19:32:22,249 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-12-21 19:32:22,251 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 19:32:22,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 07:32:22 BoogieIcfgContainer [2023-12-21 19:32:22,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 19:32:22,259 INFO L158 Benchmark]: Toolchain (without parser) took 884226.75ms. Allocated memory is still 261.1MB. Free memory was 219.2MB in the beginning and 160.3MB in the end (delta: 58.8MB). Peak memory consumption was 59.9MB. Max. memory is 8.0GB. [2023-12-21 19:32:22,259 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 217.1MB. Free memory was 169.6MB in the beginning and 169.5MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 19:32:22,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.91ms. Allocated memory is still 261.1MB. Free memory was 218.9MB in the beginning and 207.0MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 19:32:22,260 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.26ms. Allocated memory is still 261.1MB. Free memory was 207.0MB in the beginning and 205.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 19:32:22,260 INFO L158 Benchmark]: Boogie Preprocessor took 59.51ms. Allocated memory is still 261.1MB. Free memory was 205.2MB in the beginning and 203.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 19:32:22,260 INFO L158 Benchmark]: RCFGBuilder took 508.68ms. Allocated memory is still 261.1MB. Free memory was 203.1MB in the beginning and 187.8MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 19:32:22,260 INFO L158 Benchmark]: TraceAbstraction took 883437.46ms. Allocated memory is still 261.1MB. Free memory was 187.1MB in the beginning and 160.3MB in the end (delta: 26.7MB). Peak memory consumption was 27.4MB. Max. memory is 8.0GB. [2023-12-21 19:32:22,261 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks [2023-12-21 19:32:22,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 217.1MB. Free memory was 169.6MB in the beginning and 169.5MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.91ms. Allocated memory is still 261.1MB. Free memory was 218.9MB in the beginning and 207.0MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.26ms. Allocated memory is still 261.1MB. Free memory was 207.0MB in the beginning and 205.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.51ms. Allocated memory is still 261.1MB. Free memory was 205.2MB in the beginning and 203.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 508.68ms. Allocated memory is still 261.1MB. Free memory was 203.1MB in the beginning and 187.8MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 883437.46ms. Allocated memory is still 261.1MB. Free memory was 187.1MB in the beginning and 160.3MB in the end (delta: 26.7MB). Peak memory consumption was 27.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 33). Cancelled while NwaCegarLoop was constructing difference of abstraction (28states) and FLOYD_HOARE automaton (currently 52 states, 37 states before enhancement),while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 883.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 540.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 177.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 659 SdHoareTripleChecker+Invalid, 171.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 521 IncrementalHoareTripleChecker+Unchecked, 561 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1124 IncrementalHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 98 mSDtfsCounter, 1124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 157 SyntacticMatches, 11 SemanticMatches, 171 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 628.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=3, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 340.2s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 233 ConstructedInterpolants, 142 QuantifiedInterpolants, 7344 SizeOfPredicates, 71 NumberOfNonLiveVariables, 559 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 36/64 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