/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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 20:31:48,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 20:31:48,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 20:31:48,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 20:31:48,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 20:31:48,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 20:31:48,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 20:31:48,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 20:31:48,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 20:31:48,356 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 20:31:48,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 20:31:48,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 20:31:48,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 20:31:48,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 20:31:48,358 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 20:31:48,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 20:31:48,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 20:31:48,359 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 20:31:48,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 20:31:48,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 20:31:48,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 20:31:48,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 20:31:48,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 20:31:48,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 20:31:48,361 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 20:31:48,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 20:31:48,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 20:31:48,362 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 20:31:48,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 20:31:48,363 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 20:31:48,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 20:31:48,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 20:31:48,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 20:31:48,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 20:31:48,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:31:48,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 20:31:48,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 20:31:48,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 20:31:48,365 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 20:31:48,365 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 20:31:48,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 20:31:48,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 20:31:48,366 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 20:31:48,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 20:31:48,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 20:31:48,367 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 20:31:48,367 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 20:31:48,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 20:31:48,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 20:31:48,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 20:31:48,579 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 20:31:48,579 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 20:31:48,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i [2023-12-24 20:31:49,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 20:31:49,851 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 20:31:49,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i [2023-12-24 20:31:49,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fbc1608/2423ed5c54fe4b8b8c07bc0fa9e0c83f/FLAGb9ce37d3c [2023-12-24 20:31:49,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fbc1608/2423ed5c54fe4b8b8c07bc0fa9e0c83f [2023-12-24 20:31:49,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 20:31:49,884 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 20:31:49,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 20:31:49,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 20:31:49,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 20:31:49,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:31:49" (1/1) ... [2023-12-24 20:31:49,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab3fd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:49, skipping insertion in model container [2023-12-24 20:31:49,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:31:49" (1/1) ... [2023-12-24 20:31:49,927 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 20:31:50,073 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i[917,930] [2023-12-24 20:31:50,131 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:31:50,144 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 20:31:50,152 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i[917,930] [2023-12-24 20:31:50,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:31:50,217 INFO L206 MainTranslator]: Completed translation [2023-12-24 20:31:50,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50 WrapperNode [2023-12-24 20:31:50,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 20:31:50,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 20:31:50,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 20:31:50,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 20:31:50,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (1/1) ... [2023-12-24 20:31:50,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (1/1) ... [2023-12-24 20:31:50,284 INFO L138 Inliner]: procedures = 33, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 416 [2023-12-24 20:31:50,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 20:31:50,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 20:31:50,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 20:31:50,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 20:31:50,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (1/1) ... [2023-12-24 20:31:50,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (1/1) ... [2023-12-24 20:31:50,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (1/1) ... [2023-12-24 20:31:50,325 INFO L175 MemorySlicer]: Split 107 memory accesses to 2 slices as follows [2, 105]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 15 writes are split as follows [0, 15]. [2023-12-24 20:31:50,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (1/1) ... [2023-12-24 20:31:50,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (1/1) ... [2023-12-24 20:31:50,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (1/1) ... [2023-12-24 20:31:50,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (1/1) ... [2023-12-24 20:31:50,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (1/1) ... [2023-12-24 20:31:50,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (1/1) ... [2023-12-24 20:31:50,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 20:31:50,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 20:31:50,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 20:31:50,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 20:31:50,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (1/1) ... [2023-12-24 20:31:50,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:31:50,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 20:31:50,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 20:31:50,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 20:31:50,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 20:31:50,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 20:31:50,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 20:31:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 20:31:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 20:31:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 20:31:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 20:31:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 20:31:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 20:31:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 20:31:50,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 20:31:50,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 20:31:50,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 20:31:50,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 20:31:50,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 20:31:50,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 20:31:50,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 20:31:50,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 20:31:50,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 20:31:50,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 20:31:50,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 20:31:50,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 20:31:50,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 20:31:50,593 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 20:31:50,595 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 20:31:51,181 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 20:31:51,218 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 20:31:51,218 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 20:31:51,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:31:51 BoogieIcfgContainer [2023-12-24 20:31:51,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 20:31:51,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 20:31:51,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 20:31:51,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 20:31:51,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 08:31:49" (1/3) ... [2023-12-24 20:31:51,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9c6ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:31:51, skipping insertion in model container [2023-12-24 20:31:51,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:31:50" (2/3) ... [2023-12-24 20:31:51,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9c6ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:31:51, skipping insertion in model container [2023-12-24 20:31:51,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:31:51" (3/3) ... [2023-12-24 20:31:51,225 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-89.i [2023-12-24 20:31:51,239 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 20:31:51,239 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 20:31:51,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 20:31:51,286 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;@8021f54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 20:31:51,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 20:31:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-24 20:31:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 20:31:51,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:31:51,306 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:31:51,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:31:51,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:31:51,311 INFO L85 PathProgramCache]: Analyzing trace with hash 389372757, now seen corresponding path program 1 times [2023-12-24 20:31:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:31:51,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459520668] [2023-12-24 20:31:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:31:51,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:31:51,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:31:51,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:31:51,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 20:31:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:31:51,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 20:31:51,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:31:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2023-12-24 20:31:51,646 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:31:51,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:31:51,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459520668] [2023-12-24 20:31:51,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459520668] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:31:51,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:31:51,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 20:31:51,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850293121] [2023-12-24 20:31:51,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:31:51,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 20:31:51,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:31:51,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 20:31:51,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:31:51,685 INFO L87 Difference]: Start difference. First operand has 87 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-24 20:31:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:31:51,750 INFO L93 Difference]: Finished difference Result 171 states and 269 transitions. [2023-12-24 20:31:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 20:31:51,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2023-12-24 20:31:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:31:51,760 INFO L225 Difference]: With dead ends: 171 [2023-12-24 20:31:51,760 INFO L226 Difference]: Without dead ends: 85 [2023-12-24 20:31:51,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:31:51,767 INFO L413 NwaCegarLoop]: 120 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, 120 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-24 20:31:51,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 20:31:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-24 20:31:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-24 20:31:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-24 20:31:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2023-12-24 20:31:51,804 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 104 [2023-12-24 20:31:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:31:51,805 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2023-12-24 20:31:51,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-24 20:31:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2023-12-24 20:31:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 20:31:51,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:31:51,809 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:31:51,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 20:31:52,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:31:52,015 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:31:52,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:31:52,016 INFO L85 PathProgramCache]: Analyzing trace with hash 791764987, now seen corresponding path program 1 times [2023-12-24 20:31:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:31:52,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499249825] [2023-12-24 20:31:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:31:52,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:31:52,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:31:52,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:31:52,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 20:31:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:31:52,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 20:31:52,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:31:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 20:31:52,298 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:31:52,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:31:52,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499249825] [2023-12-24 20:31:52,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499249825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:31:52,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:31:52,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 20:31:52,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956601582] [2023-12-24 20:31:52,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:31:52,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 20:31:52,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:31:52,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 20:31:52,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 20:31:52,302 INFO L87 Difference]: Start difference. First operand 85 states and 124 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 20:31:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:31:52,422 INFO L93 Difference]: Finished difference Result 190 states and 277 transitions. [2023-12-24 20:31:52,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:31:52,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2023-12-24 20:31:52,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:31:52,427 INFO L225 Difference]: With dead ends: 190 [2023-12-24 20:31:52,427 INFO L226 Difference]: Without dead ends: 106 [2023-12-24 20:31:52,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 20:31:52,429 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 46 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:31:52,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 458 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:31:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-24 20:31:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2023-12-24 20:31:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-24 20:31:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-12-24 20:31:52,441 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 104 [2023-12-24 20:31:52,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:31:52,442 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-12-24 20:31:52,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 20:31:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-12-24 20:31:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 20:31:52,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:31:52,448 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:31:52,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 20:31:52,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:31:52,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:31:52,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:31:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -17581639, now seen corresponding path program 1 times [2023-12-24 20:31:52,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:31:52,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885365875] [2023-12-24 20:31:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:31:52,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:31:52,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:31:52,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:31:52,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 20:31:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:31:52,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 20:31:52,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:31:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 20:31:52,950 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:31:52,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:31:52,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885365875] [2023-12-24 20:31:52,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885365875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:31:52,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:31:52,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 20:31:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244818745] [2023-12-24 20:31:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:31:52,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 20:31:52,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:31:52,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 20:31:52,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:31:52,955 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 20:31:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:31:53,081 INFO L93 Difference]: Finished difference Result 197 states and 282 transitions. [2023-12-24 20:31:53,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 20:31:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2023-12-24 20:31:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:31:53,084 INFO L225 Difference]: With dead ends: 197 [2023-12-24 20:31:53,084 INFO L226 Difference]: Without dead ends: 109 [2023-12-24 20:31:53,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 20:31:53,086 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 49 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:31:53,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 566 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:31:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-24 20:31:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2023-12-24 20:31:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.368421052631579) internal successors, (104), 76 states have internal predecessors, (104), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-24 20:31:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2023-12-24 20:31:53,097 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 104 [2023-12-24 20:31:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:31:53,098 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2023-12-24 20:31:53,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 20:31:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2023-12-24 20:31:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 20:31:53,100 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:31:53,100 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:31:53,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 20:31:53,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:31:53,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:31:53,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:31:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash 39676663, now seen corresponding path program 1 times [2023-12-24 20:31:53,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:31:53,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908466232] [2023-12-24 20:31:53,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:31:53,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:31:53,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:31:53,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:31:53,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 20:31:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:31:53,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 20:31:53,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:31:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 20:31:53,529 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:31:53,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:31:53,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908466232] [2023-12-24 20:31:53,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908466232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:31:53,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:31:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 20:31:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258508504] [2023-12-24 20:31:53,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:31:53,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 20:31:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:31:53,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 20:31:53,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 20:31:53,532 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 20:31:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:31:53,678 INFO L93 Difference]: Finished difference Result 200 states and 282 transitions. [2023-12-24 20:31:53,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 20:31:53,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2023-12-24 20:31:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:31:53,683 INFO L225 Difference]: With dead ends: 200 [2023-12-24 20:31:53,683 INFO L226 Difference]: Without dead ends: 110 [2023-12-24 20:31:53,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-24 20:31:53,691 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:31:53,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 668 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:31:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-24 20:31:53,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2023-12-24 20:31:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.358974358974359) internal successors, (106), 78 states have internal predecessors, (106), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-24 20:31:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2023-12-24 20:31:53,705 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 104 [2023-12-24 20:31:53,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:31:53,705 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2023-12-24 20:31:53,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 20:31:53,705 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2023-12-24 20:31:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 20:31:53,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:31:53,707 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:31:53,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 20:31:53,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:31:53,919 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:31:53,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:31:53,920 INFO L85 PathProgramCache]: Analyzing trace with hash 39736245, now seen corresponding path program 1 times [2023-12-24 20:31:53,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:31:53,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661040088] [2023-12-24 20:31:53,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:31:53,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:31:53,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:31:53,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:31:53,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 20:31:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:31:54,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-24 20:31:54,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:31:54,513 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 24 treesize of output 12 [2023-12-24 20:31:56,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-24 20:31:57,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-24 20:31:58,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-24 20:31:59,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-12-24 20:32:00,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-12-24 20:32:01,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2023-12-24 20:32:02,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2023-12-24 20:32:03,395 INFO L349 Elim1Store]: treesize reduction 66, result has 17.5 percent of original size [2023-12-24 20:32:03,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 78 [2023-12-24 20:32:04,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:32:04,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 44 [2023-12-24 20:32:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 126 proven. 112 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-24 20:32:04,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:32:37,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:32:37,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661040088] [2023-12-24 20:32:37,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661040088] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:32:37,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1184553852] [2023-12-24 20:32:37,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:32:37,140 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:32:37,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:32:37,189 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-24 20:32:37,190 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-24 20:32:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:32:37,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-24 20:32:37,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:32:38,926 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 24 treesize of output 12 [2023-12-24 20:32:43,208 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 21 treesize of output 20 [2023-12-24 20:32:46,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 20:32:50,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 20:32:52,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 20:32:57,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 20:33:01,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2023-12-24 20:33:04,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2023-12-24 20:33:06,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2023-12-24 20:33:08,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 46 [2023-12-24 20:33:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 144 proven. 88 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-24 20:33:10,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:33:14,222 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem59#1| (_ BitVec 16))) (bvsge (bvsdiv ((_ zero_extend 16) |c_ULTIMATE.start_property_#t~mem57#1|) ((_ zero_extend 24) |c_ULTIMATE.start_property_#t~mem58#1|)) ((_ zero_extend 16) |ULTIMATE.start_property_#t~mem59#1|))) is different from false [2023-12-24 20:33:58,964 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem59#1| (_ BitVec 16)) (v_ArrVal_150 (_ BitVec 32)) (v_ArrVal_153 (_ BitVec 32)) (v_ArrVal_152 (_ BitVec 32))) (bvsge (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_150)))) (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_152))))) (store .cse1 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_153))))) (bvsdiv ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))))) ((_ zero_extend 16) |ULTIMATE.start_property_#t~mem59#1|))) is different from false [2023-12-24 20:34:22,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1184553852] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:34:22,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:34:22,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2023-12-24 20:34:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705472287] [2023-12-24 20:34:22,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:34:22,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-24 20:34:22,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:34:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-24 20:34:22,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=907, Unknown=12, NotChecked=126, Total=1190 [2023-12-24 20:34:22,643 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (26), 8 states have call predecessors, (26), 9 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) [2023-12-24 20:34:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:34:56,807 INFO L93 Difference]: Finished difference Result 336 states and 473 transitions. [2023-12-24 20:34:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 20:34:56,808 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (26), 8 states have call predecessors, (26), 9 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) Word has length 104 [2023-12-24 20:34:56,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:34:56,809 INFO L225 Difference]: With dead ends: 336 [2023-12-24 20:34:56,809 INFO L226 Difference]: Without dead ends: 244 [2023-12-24 20:34:56,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 129.7s TimeCoverageRelationStatistics Valid=387, Invalid=1771, Unknown=12, NotChecked=182, Total=2352 [2023-12-24 20:34:56,811 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1144 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2023-12-24 20:34:56,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 789 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 19.4s Time] [2023-12-24 20:34:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-24 20:34:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 187. [2023-12-24 20:34:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 157 states have internal predecessors, (212), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-24 20:34:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 264 transitions. [2023-12-24 20:34:56,832 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 264 transitions. Word has length 104 [2023-12-24 20:34:56,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:34:56,833 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 264 transitions. [2023-12-24 20:34:56,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (26), 8 states have call predecessors, (26), 9 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) [2023-12-24 20:34:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 264 transitions. [2023-12-24 20:34:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 20:34:56,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:34:56,835 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:34:56,845 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-24 20:34:57,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-24 20:34:57,242 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-24 20:34:57,243 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:34:57,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:34:57,244 INFO L85 PathProgramCache]: Analyzing trace with hash -88427522, now seen corresponding path program 1 times [2023-12-24 20:34:57,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:34:57,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162097855] [2023-12-24 20:34:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:34:57,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:34:57,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:34:57,245 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:34:57,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 20:34:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:34:57,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-24 20:34:57,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:35:03,487 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 15 treesize of output 1 [2023-12-24 20:35:08,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-12-24 20:35:10,883 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 34 treesize of output 18 [2023-12-24 20:35:13,504 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 34 treesize of output 18 [2023-12-24 20:35:16,366 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-12-24 20:35:16,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2023-12-24 20:35:17,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2023-12-24 20:35:18,149 INFO L349 Elim1Store]: treesize reduction 58, result has 19.4 percent of original size [2023-12-24 20:35:18,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 65 [2023-12-24 20:35:19,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:35:19,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 45 [2023-12-24 20:35:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 127 proven. 112 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-12-24 20:35:19,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:35:29,234 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base))) (and (or (not |c_ULTIMATE.start_step_#t~short15#1|) (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.offset ((_ sign_extend 24) (_ bv1 8)))))) (let ((.cse3 (select .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base)) (.cse4 (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base))) (and (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse4 ~WrapperStruct00_var_1_10_Pointer~0.offset))))))) (store .cse1 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32))) (= ((_ extract 7 0) (select (select .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))))) (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (select (select (let ((.cse6 (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse4 ~WrapperStruct00_var_1_10_Pointer~0.offset))))))) (store .cse6 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))) c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))))) (or (= .cse5 (_ bv0 32)) (= .cse5 (_ bv1 32))))) (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse7 (let ((.cse8 (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse4 ~WrapperStruct00_var_1_10_Pointer~0.offset))))))) (store .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse7 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32)) (not (= ((_ extract 7 0) (select (select .cse7 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8)))))))))) (or (let ((.cse12 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.offset ((_ sign_extend 24) (_ bv0 8)))))) (let ((.cse13 (select .cse12 c_~WrapperStruct00_var_1_13_Pointer~0.base)) (.cse14 (select .cse12 c_~WrapperStruct00_var_1_10_Pointer~0.base))) (and (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse10 (let ((.cse11 (store .cse12 c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse14 ~WrapperStruct00_var_1_10_Pointer~0.offset))))))) (store .cse11 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))))) (or (= ((_ extract 7 0) (select (select .cse10 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse10 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32)))))) (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse15 (let ((.cse16 (store .cse12 c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse14 ~WrapperStruct00_var_1_10_Pointer~0.offset))))))) (store .cse16 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse16 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))))) (or (not (= ((_ extract 7 0) (select (select .cse15 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse15 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32))))) (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select (select (let ((.cse18 (store .cse12 c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse14 ~WrapperStruct00_var_1_10_Pointer~0.offset))))))) (store .cse18 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse18 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))) c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))))) (or (= .cse17 (_ bv0 32)) (= .cse17 (_ bv1 32)))))))) |c_ULTIMATE.start_step_#t~short15#1|))) is different from false [2023-12-24 20:35:33,925 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)))) (.cse9 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base))) (and (or (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.offset ((_ sign_extend 24) (_ bv0 8)))))) (let ((.cse3 (select .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base)) (.cse4 (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base))) (and (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse4 ~WrapperStruct00_var_1_10_Pointer~0.offset))))))) (store .cse1 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))))) (or (= ((_ extract 7 0) (select (select .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32)))))) (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse5 (let ((.cse6 (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse4 ~WrapperStruct00_var_1_10_Pointer~0.offset))))))) (store .cse6 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))))) (or (not (= ((_ extract 7 0) (select (select .cse5 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32))))) (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (select (select (let ((.cse8 (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse4 ~WrapperStruct00_var_1_10_Pointer~0.offset))))))) (store .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))) c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))))) (or (= .cse7 (_ bv0 32)) (= .cse7 (_ bv1 32)))))))) (not .cse10)) (or .cse10 (let ((.cse13 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.offset ((_ sign_extend 24) (_ bv1 8)))))) (let ((.cse14 (select .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.base)) (.cse15 (select .cse13 c_~WrapperStruct00_var_1_10_Pointer~0.base))) (and (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse11 (let ((.cse12 (store .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse14 c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse15 ~WrapperStruct00_var_1_10_Pointer~0.offset))))))) (store .cse12 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse12 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse11 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32))) (= ((_ extract 7 0) (select (select .cse11 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))))) (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (select (select (let ((.cse17 (store .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse14 c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse15 ~WrapperStruct00_var_1_10_Pointer~0.offset))))))) (store .cse17 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse17 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))) c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))))) (or (= .cse16 (_ bv0 32)) (= .cse16 (_ bv1 32))))) (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse18 (let ((.cse19 (store .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse14 c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse15 ~WrapperStruct00_var_1_10_Pointer~0.offset))))))) (store .cse19 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse19 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse18 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32)) (not (= ((_ extract 7 0) (select (select .cse18 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8)))))))))))) is different from false [2023-12-24 20:35:39,146 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ sign_extend 24) (_ bv1 8))) (.cse4 ((_ sign_extend 24) (_ bv0 8))) (.cse5 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base))) (and (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32))) (let ((.cse3 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (or (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store .cse3 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse4)))) (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset)))))))) (store .cse1 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))))) (or (not (= ((_ extract 7 0) (select (select .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32))))) (not (= ((_ extract 7 0) (select (select .cse3 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8)))))) (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (or (= ((_ extract 7 0) (select (select .cse6 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8)) (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (select (select (let ((.cse8 (let ((.cse9 (store .cse6 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse10)))) (store .cse9 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse9 c_~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset)))))))) (store .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))) c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))))) (or (= (_ bv0 32) .cse7) (= (_ bv1 32) .cse7))))))) (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32))) (let ((.cse14 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (or (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse11 (let ((.cse12 (let ((.cse13 (store .cse14 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse14 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse10)))) (store .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse13 c_~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset)))))))) (store .cse12 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse12 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))))) (or (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse11 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))))) (= ((_ extract 7 0) (select (select .cse11 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))))) (= ((_ extract 7 0) (select (select .cse14 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))))) (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32))) (let ((.cse15 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (or (= ((_ extract 7 0) (select (select .cse15 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8)) (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse16 (let ((.cse17 (let ((.cse18 (store .cse15 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse15 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse10)))) (store .cse18 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse18 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse18 c_~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset)))))))) (store .cse17 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse17 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))))) (or (not (= ((_ extract 7 0) (select (select .cse16 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse16 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)))))))))) (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32))) (let ((.cse19 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (or (not (= ((_ extract 7 0) (select (select .cse19 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))) (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (select (select (let ((.cse21 (let ((.cse22 (store .cse19 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse19 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse4)))) (store .cse22 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse22 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse22 c_~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset)))))))) (store .cse21 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse21 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))) c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))))) (or (= .cse20 (_ bv1 32)) (= .cse20 (_ bv0 32)))))))) (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32))) (let ((.cse26 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (or (forall ((~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_187 (_ BitVec 32))) (let ((.cse23 (let ((.cse24 (let ((.cse25 (store .cse26 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse26 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse4)))) (store .cse25 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse25 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse25 c_~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset)))))))) (store .cse24 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse24 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_187))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse23 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32))) (= ((_ extract 7 0) (select (select .cse23 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))))) (not (= ((_ extract 7 0) (select (select .cse26 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8)))))))) is different from false [2023-12-24 20:35:41,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:35:41,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162097855] [2023-12-24 20:35:41,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162097855] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:35:41,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1421661382] [2023-12-24 20:35:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:35:41,031 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:35:41,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:35:41,032 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:35:41,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-24 20:35:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:35:41,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-24 20:35:41,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:35:47,220 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 15 treesize of output 1 [2023-12-24 20:35:53,019 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 31 treesize of output 26 [2023-12-24 20:35:56,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-12-24 20:35:59,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2023-12-24 20:36:03,065 INFO L349 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-12-24 20:36:03,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 65 [2023-12-24 20:36:04,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 61 [2023-12-24 20:36:05,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 64 [2023-12-24 20:36:07,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 48 [2023-12-24 20:36:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 143 proven. 112 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-24 20:36:07,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:36:37,021 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 24) (_ bv0 8))) (.cse14 ((_ sign_extend 24) (_ bv1 8))) (.cse5 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base))) (and (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (or (not (= ((_ extract 7 0) (select (select .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))) (forall ((v_ArrVal_219 (_ BitVec 32)) (v_ArrVal_220 (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse4)))) (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_219))))) (store .cse2 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_220))))) (or (= ((_ extract 7 0) (select (select .cse1 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32))))))))) (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (or (not (= ((_ extract 7 0) (select (select .cse6 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))) (forall ((v_ArrVal_219 (_ BitVec 32)) (v_ArrVal_220 (_ BitVec 32))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (select (select (let ((.cse8 (let ((.cse9 (store .cse6 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse4)))) (store .cse9 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_219))))) (store .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_220))) c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))))) (or (= .cse7 (_ bv1 32)) (= .cse7 (_ bv0 32)))))))) (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32))) (let ((.cse13 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (or (forall ((v_ArrVal_219 (_ BitVec 32)) (v_ArrVal_220 (_ BitVec 32))) (let ((.cse10 (let ((.cse11 (let ((.cse12 (store .cse13 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse13 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse14)))) (store .cse12 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse12 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_219))))) (store .cse11 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_220))))) (or (not (= ((_ extract 7 0) (select (select .cse10 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse10 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32))))) (= ((_ extract 7 0) (select (select .cse13 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))))) (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32))) (let ((.cse15 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (or (= ((_ extract 7 0) (select (select .cse15 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8)) (forall ((v_ArrVal_219 (_ BitVec 32)) (v_ArrVal_220 (_ BitVec 32))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (select (select (let ((.cse17 (let ((.cse18 (store .cse15 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse15 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse14)))) (store .cse18 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse18 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_219))))) (store .cse17 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse17 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_220))) c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))))) (or (= .cse16 (_ bv1 32)) (= .cse16 (_ bv0 32)))))))) (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32))) (let ((.cse19 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (or (not (= ((_ extract 7 0) (select (select .cse19 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))) (forall ((v_ArrVal_219 (_ BitVec 32)) (v_ArrVal_220 (_ BitVec 32))) (let ((.cse20 (let ((.cse21 (let ((.cse22 (store .cse19 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse19 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse4)))) (store .cse22 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse22 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_219))))) (store .cse21 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse21 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_220))))) (or (not (= ((_ extract 7 0) (select (select .cse20 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse20 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32)))))))) (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32))) (let ((.cse26 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (or (forall ((v_ArrVal_219 (_ BitVec 32)) (v_ArrVal_220 (_ BitVec 32))) (let ((.cse23 (let ((.cse24 (let ((.cse25 (store .cse26 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse26 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset .cse14)))) (store .cse25 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse25 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_219))))) (store .cse24 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse24 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_220))))) (or (= ((_ extract 7 0) (select (select .cse23 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse23 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (_ bv0 32)))))) (= ((_ extract 7 0) (select (select .cse26 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (_ bv0 8))))))) is different from false [2023-12-24 20:36:38,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1421661382] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:36:38,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:36:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2023-12-24 20:36:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966407430] [2023-12-24 20:36:38,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:36:38,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-24 20:36:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:36:38,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-24 20:36:38,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1807, Unknown=6, NotChecked=356, Total=2352 [2023-12-24 20:36:38,911 INFO L87 Difference]: Start difference. First operand 187 states and 264 transitions. Second operand has 37 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 33 states have internal predecessors, (97), 11 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2023-12-24 20:37:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:37:19,978 INFO L93 Difference]: Finished difference Result 720 states and 982 transitions. [2023-12-24 20:37:19,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-24 20:37:19,980 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 33 states have internal predecessors, (97), 11 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) Word has length 104 [2023-12-24 20:37:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:37:19,986 INFO L225 Difference]: With dead ends: 720 [2023-12-24 20:37:19,989 INFO L226 Difference]: Without dead ends: 534 [2023-12-24 20:37:19,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 75.6s TimeCoverageRelationStatistics Valid=1023, Invalid=5467, Unknown=6, NotChecked=644, Total=7140 [2023-12-24 20:37:19,993 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 1978 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 2824 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1978 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 3031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2023-12-24 20:37:19,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1978 Valid, 1412 Invalid, 3031 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [207 Valid, 2824 Invalid, 0 Unknown, 0 Unchecked, 23.4s Time] [2023-12-24 20:37:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-12-24 20:37:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 303. [2023-12-24 20:37:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 260 states have (on average 1.3346153846153845) internal successors, (347), 261 states have internal predecessors, (347), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-24 20:37:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 409 transitions. [2023-12-24 20:37:20,031 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 409 transitions. Word has length 104 [2023-12-24 20:37:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:37:20,031 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 409 transitions. [2023-12-24 20:37:20,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 33 states have internal predecessors, (97), 11 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2023-12-24 20:37:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 409 transitions. [2023-12-24 20:37:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 20:37:20,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:37:20,033 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:37:20,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-12-24 20:37:20,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 20:37:20,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:37:20,442 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:37:20,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:37:20,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1368291200, now seen corresponding path program 1 times [2023-12-24 20:37:20,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:37:20,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079524835] [2023-12-24 20:37:20,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:37:20,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:37:20,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:37:20,444 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:37:20,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 20:37:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:37:20,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-24 20:37:20,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:37:24,462 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 15 treesize of output 1 [2023-12-24 20:37:29,065 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 31 treesize of output 26 [2023-12-24 20:37:32,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-12-24 20:37:35,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2023-12-24 20:37:39,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2023-12-24 20:37:43,770 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-12-24 20:37:43,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 87 [2023-12-24 20:37:44,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2023-12-24 20:37:45,676 INFO L349 Elim1Store]: treesize reduction 82, result has 14.6 percent of original size [2023-12-24 20:37:45,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 85 treesize of output 98 [2023-12-24 20:37:46,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:37:46,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 93 treesize of output 53 [2023-12-24 20:37:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 157 proven. 124 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-24 20:37:46,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:38:23,904 WARN L854 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_8_Pointer~0.base (_ BitVec 32)) (v_ArrVal_250 (_ BitVec 32)) (~WrapperStruct00_var_1_10_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_8_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_252 (_ BitVec 32))) (not (= ((_ extract 7 0) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset)))))))) (store .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_250))))) (store .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base) ~WrapperStruct00_var_1_10_Pointer~0.offset)))))))) (store .cse0 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_252))) c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) (_ bv0 8)))) is different from false [2023-12-24 20:38:24,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:38:24,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079524835] [2023-12-24 20:38:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079524835] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:38:24,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [642264062] [2023-12-24 20:38:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:38:24,011 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:38:24,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:38:24,013 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:38:24,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-24 20:38:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:38:24,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-24 20:38:24,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:38:28,251 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 12 treesize of output 8 [2023-12-24 20:38:30,844 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 21 treesize of output 20 [2023-12-24 20:38:33,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 20:38:36,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 20:38:39,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 20:38:42,760 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2023-12-24 20:38:42,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 70 [2023-12-24 20:38:44,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2023-12-24 20:38:45,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 63 [2023-12-24 20:38:46,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2023-12-24 20:38:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 176 proven. 88 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-24 20:38:46,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:39:12,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [642264062] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:39:12,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:39:12,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2023-12-24 20:39:12,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192731164] [2023-12-24 20:39:12,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:39:12,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-24 20:39:12,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:39:12,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-24 20:39:12,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1089, Unknown=7, NotChecked=70, Total=1406 [2023-12-24 20:39:12,409 INFO L87 Difference]: Start difference. First operand 303 states and 409 transitions. Second operand has 29 states, 27 states have (on average 3.6666666666666665) internal successors, (99), 26 states have internal predecessors, (99), 12 states have call successors, (26), 11 states have call predecessors, (26), 12 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2023-12-24 20:39:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:39:41,958 INFO L93 Difference]: Finished difference Result 763 states and 1015 transitions. [2023-12-24 20:39:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-24 20:39:41,959 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 3.6666666666666665) internal successors, (99), 26 states have internal predecessors, (99), 12 states have call successors, (26), 11 states have call predecessors, (26), 12 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) Word has length 104 [2023-12-24 20:39:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:39:41,965 INFO L225 Difference]: With dead ends: 763 [2023-12-24 20:39:41,966 INFO L226 Difference]: Without dead ends: 461 [2023-12-24 20:39:41,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 85.9s TimeCoverageRelationStatistics Valid=1002, Invalid=3027, Unknown=7, NotChecked=124, Total=4160 [2023-12-24 20:39:41,968 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1769 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2023-12-24 20:39:41,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1769 Valid, 675 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 16.3s Time] [2023-12-24 20:39:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-12-24 20:39:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 424. [2023-12-24 20:39:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 369 states have (on average 1.3170731707317074) internal successors, (486), 372 states have internal predecessors, (486), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-24 20:39:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 560 transitions. [2023-12-24 20:39:42,033 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 560 transitions. Word has length 104 [2023-12-24 20:39:42,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:39:42,034 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 560 transitions. [2023-12-24 20:39:42,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 3.6666666666666665) internal successors, (99), 26 states have internal predecessors, (99), 12 states have call successors, (26), 11 states have call predecessors, (26), 12 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2023-12-24 20:39:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 560 transitions. [2023-12-24 20:39:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 20:39:42,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:39:42,035 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:39:42,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-24 20:39:42,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 20:39:42,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:39:42,443 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:39:42,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:39:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1394806316, now seen corresponding path program 1 times [2023-12-24 20:39:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:39:42,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224968571] [2023-12-24 20:39:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:39:42,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:39:42,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:39:42,448 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:39:42,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 20:39:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:39:42,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-24 20:39:42,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:39:50,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 20:39:54,008 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 25 treesize of output 13 [2023-12-24 20:39:56,717 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 22 treesize of output 21 [2023-12-24 20:39:59,894 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-12-24 20:39:59,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2023-12-24 20:40:01,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-12-24 20:40:01,651 INFO L349 Elim1Store]: treesize reduction 66, result has 17.5 percent of original size [2023-12-24 20:40:01,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 71 [2023-12-24 20:40:02,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:40:02,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 44 [2023-12-24 20:40:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 90 proven. 94 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-12-24 20:40:03,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:41:27,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:41:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224968571] [2023-12-24 20:41:27,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224968571] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:41:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1076276996] [2023-12-24 20:41:27,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:41:27,042 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:41:27,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:41:27,043 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:41:27,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-24 20:41:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:41:27,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-24 20:41:27,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:41:35,872 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 15 treesize of output 1 [2023-12-24 20:41:40,278 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 22 treesize of output 21 [2023-12-24 20:41:43,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-12-24 20:41:47,250 INFO L349 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-12-24 20:41:47,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 60 [2023-12-24 20:41:48,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2023-12-24 20:41:49,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2023-12-24 20:41:52,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 43 [2023-12-24 20:41:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 90 proven. 94 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-12-24 20:41:52,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:43:52,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1076276996] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:43:52,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:43:52,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2023-12-24 20:43:52,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704987405] [2023-12-24 20:43:52,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:43:52,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-24 20:43:52,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:43:52,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-24 20:43:52,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1331, Unknown=35, NotChecked=0, Total=1560 [2023-12-24 20:43:52,788 INFO L87 Difference]: Start difference. First operand 424 states and 560 transitions. Second operand has 28 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 8 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (26), 7 states have call predecessors, (26), 8 states have call successors, (26) [2023-12-24 20:44:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:30,760 INFO L93 Difference]: Finished difference Result 1256 states and 1639 transitions. [2023-12-24 20:44:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-24 20:44:30,761 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 8 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (26), 7 states have call predecessors, (26), 8 states have call successors, (26) Word has length 104 [2023-12-24 20:44:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:30,765 INFO L225 Difference]: With dead ends: 1256 [2023-12-24 20:44:30,765 INFO L226 Difference]: Without dead ends: 833 [2023-12-24 20:44:30,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 224.4s TimeCoverageRelationStatistics Valid=861, Invalid=3796, Unknown=35, NotChecked=0, Total=4692 [2023-12-24 20:44:30,767 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1376 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 2741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:30,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1374 Invalid, 2741 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [353 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 22.4s Time] [2023-12-24 20:44:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2023-12-24 20:44:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 495. [2023-12-24 20:44:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 433 states have (on average 1.3187066974595842) internal successors, (571), 437 states have internal predecessors, (571), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-24 20:44:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 653 transitions. [2023-12-24 20:44:30,858 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 653 transitions. Word has length 104 [2023-12-24 20:44:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:30,859 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 653 transitions. [2023-12-24 20:44:30,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 8 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (26), 7 states have call predecessors, (26), 8 states have call successors, (26) [2023-12-24 20:44:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 653 transitions. [2023-12-24 20:44:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 20:44:30,860 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:30,860 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:44:30,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:31,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:31,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:31,267 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:31,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1266642549, now seen corresponding path program 1 times [2023-12-24 20:44:31,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:31,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75049594] [2023-12-24 20:44:31,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:31,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:31,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:31,269 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:44:31,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 20:44:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:31,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-24 20:44:31,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:32,126 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 21 treesize of output 20 [2023-12-24 20:44:38,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2023-12-24 20:44:41,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-12-24 20:44:45,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2023-12-24 20:44:49,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2023-12-24 20:44:53,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2023-12-24 20:44:57,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 66 [2023-12-24 20:45:01,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 81 [2023-12-24 20:45:03,389 INFO L349 Elim1Store]: treesize reduction 82, result has 14.6 percent of original size [2023-12-24 20:45:03,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 109 treesize of output 110 [2023-12-24 20:45:05,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:45:05,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 109 treesize of output 65 [2023-12-24 20:45:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 158 proven. 112 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-24 20:45:06,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:45:39,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:45:39,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75049594] [2023-12-24 20:45:39,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75049594] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:45:39,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1681890743] [2023-12-24 20:45:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:45:39,681 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:45:39,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:45:39,682 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:45:39,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-12-24 20:45:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:45:40,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-24 20:45:40,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:45:41,419 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 21 treesize of output 20 [2023-12-24 20:45:46,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 20:45:49,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 20:45:53,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 20:45:57,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2023-12-24 20:46:00,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2023-12-24 20:46:05,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2023-12-24 20:46:08,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2023-12-24 20:46:10,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2023-12-24 20:46:12,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 32 Received shutdown request... [2023-12-24 20:46:13,401 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 (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 20:46:13,402 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 20:46:13,402 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 20:46:13,451 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 20:46:13,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2023-12-24 20:46:13,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-24 20:46:13,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:46:13,853 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 105 with TraceHistMax 13,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 31 known predicates. [2023-12-24 20:46:13,856 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:46:13,859 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 20:46:13,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 08:46:13 BoogieIcfgContainer [2023-12-24 20:46:13,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 20:46:13,861 INFO L158 Benchmark]: Toolchain (without parser) took 863977.16ms. Allocated memory was 206.6MB in the beginning and 362.8MB in the end (delta: 156.2MB). Free memory was 140.8MB in the beginning and 157.2MB in the end (delta: -16.3MB). Peak memory consumption was 140.2MB. Max. memory is 8.0GB. [2023-12-24 20:46:13,862 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 206.6MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 20:46:13,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.30ms. Allocated memory is still 206.6MB. Free memory was 140.8MB in the beginning and 125.1MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-24 20:46:13,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.59ms. Allocated memory is still 206.6MB. Free memory was 125.1MB in the beginning and 122.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 20:46:13,862 INFO L158 Benchmark]: Boogie Preprocessor took 77.98ms. Allocated memory is still 206.6MB. Free memory was 122.0MB in the beginning and 117.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 20:46:13,862 INFO L158 Benchmark]: RCFGBuilder took 844.62ms. Allocated memory was 206.6MB in the beginning and 285.2MB in the end (delta: 78.6MB). Free memory was 117.8MB in the beginning and 231.3MB in the end (delta: -113.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-24 20:46:13,863 INFO L158 Benchmark]: TraceAbstraction took 862640.72ms. Allocated memory was 285.2MB in the beginning and 362.8MB in the end (delta: 77.6MB). Free memory was 230.8MB in the beginning and 157.2MB in the end (delta: 73.6MB). Peak memory consumption was 150.7MB. Max. memory is 8.0GB. [2023-12-24 20:46:13,864 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 206.6MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.30ms. Allocated memory is still 206.6MB. Free memory was 140.8MB in the beginning and 125.1MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.59ms. Allocated memory is still 206.6MB. Free memory was 125.1MB in the beginning and 122.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 77.98ms. Allocated memory is still 206.6MB. Free memory was 122.0MB in the beginning and 117.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 844.62ms. Allocated memory was 206.6MB in the beginning and 285.2MB in the end (delta: 78.6MB). Free memory was 117.8MB in the beginning and 231.3MB in the end (delta: -113.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 862640.72ms. Allocated memory was 285.2MB in the beginning and 362.8MB in the end (delta: 77.6MB). Free memory was 230.8MB in the beginning and 157.2MB in the end (delta: 73.6MB). Peak memory consumption was 150.7MB. 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: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 105 with TraceHistMax 13,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 31 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 862.6s, OverallIterations: 9, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 143.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6402 SdHoareTripleChecker+Valid, 81.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6402 mSDsluCounter, 6062 SdHoareTripleChecker+Invalid, 78.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5345 mSDsCounter, 1101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7962 IncrementalHoareTripleChecker+Invalid, 9063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1101 mSolverCounterUnsat, 717 mSDtfsCounter, 7962 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1569 GetRequests, 1277 SyntacticMatches, 1 SemanticMatches, 291 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3819 ImplicationChecksByTransitivity, 515.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=495occurred in iteration=8, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 715 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 609.5s InterpolantComputationTime, 1248 NumberOfCodeBlocks, 1248 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1236 ConstructedInterpolants, 338 QuantifiedInterpolants, 38831 SizeOfPredicates, 190 NumberOfNonLiveVariables, 2819 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 2920/3744 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