/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/list-simple/sll2n_prepend_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:21:56,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:21:56,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:21:56,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:21:56,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:21:56,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:21:56,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:21:56,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:21:56,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:21:56,853 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:21:56,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:21:56,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:21:56,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:21:56,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:21:56,854 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:21:56,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:21:56,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:21:56,855 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:21:56,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:21:56,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:21:56,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:21:56,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:21:56,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:21:56,859 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:21:56,859 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:21:56,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:21:56,859 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:21:56,860 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:21:56,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:21:56,860 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:21:56,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:21:56,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:21:56,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:21:56,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:21:56,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:21:56,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:21:56,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:21:56,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:21:56,862 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:21:56,862 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:21:56,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:21:56,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:21:56,862 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:21:56,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:21:56,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:21:56,863 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:21:56,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 16:21:57,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:21:57,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:21:57,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:21:57,047 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:21:57,048 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:21:57,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_unequal.i [2023-12-16 16:21:58,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:21:58,203 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:21:58,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_unequal.i [2023-12-16 16:21:58,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffdb5f1a5/1b0a7b29c7cb49f2bc36b68504089dcf/FLAG6fe2cb451 [2023-12-16 16:21:58,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffdb5f1a5/1b0a7b29c7cb49f2bc36b68504089dcf [2023-12-16 16:21:58,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:21:58,224 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:21:58,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:21:58,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:21:58,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:21:58,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc1c3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58, skipping insertion in model container [2023-12-16 16:21:58,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,275 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:21:58,491 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_unequal.i[24165,24178] [2023-12-16 16:21:58,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:21:58,505 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:21:58,545 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_unequal.i[24165,24178] [2023-12-16 16:21:58,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:21:58,566 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:21:58,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58 WrapperNode [2023-12-16 16:21:58,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:21:58,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:21:58,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:21:58,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:21:58,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,601 INFO L138 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2023-12-16 16:21:58,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:21:58,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:21:58,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:21:58,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:21:58,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,634 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 5, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2023-12-16 16:21:58,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:21:58,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:21:58,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:21:58,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:21:58,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (1/1) ... [2023-12-16 16:21:58,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:21:58,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:21:58,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:21:58,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:21:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:21:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:21:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 16:21:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-16 16:21:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-16 16:21:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:21:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:21:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 16:21:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 16:21:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 16:21:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 16:21:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 16:21:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 16:21:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 16:21:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:21:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:21:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:21:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 16:21:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 16:21:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 16:21:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-16 16:21:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:21:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:21:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 16:21:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:21:58,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:21:58,801 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:21:58,802 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:21:59,028 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:21:59,063 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:21:59,064 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-16 16:21:59,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:21:59 BoogieIcfgContainer [2023-12-16 16:21:59,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:21:59,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:21:59,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:21:59,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:21:59,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:21:58" (1/3) ... [2023-12-16 16:21:59,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2ca44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:21:59, skipping insertion in model container [2023-12-16 16:21:59,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:58" (2/3) ... [2023-12-16 16:21:59,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2ca44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:21:59, skipping insertion in model container [2023-12-16 16:21:59,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:21:59" (3/3) ... [2023-12-16 16:21:59,070 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2023-12-16 16:21:59,081 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:21:59,081 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:21:59,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:21:59,112 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;@41163bed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:21:59,113 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:21:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:21:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:21:59,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:59,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:59,124 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:59,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:59,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1027000244, now seen corresponding path program 1 times [2023-12-16 16:21:59,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:59,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318264931] [2023-12-16 16:21:59,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:21:59,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:59,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:59,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:59,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:21:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:21:59,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:21:59,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:21:59,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:21:59,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:59,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318264931] [2023-12-16 16:21:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318264931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:21:59,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:21:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:21:59,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449376590] [2023-12-16 16:21:59,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:21:59,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:21:59,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:59,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:21:59,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:21:59,311 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 16:21:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:59,371 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2023-12-16 16:21:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:21:59,373 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-16 16:21:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:59,378 INFO L225 Difference]: With dead ends: 38 [2023-12-16 16:21:59,378 INFO L226 Difference]: Without dead ends: 16 [2023-12-16 16:21:59,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:21:59,382 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:59,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:21:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-16 16:21:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-16 16:21:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:21:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-12-16 16:21:59,403 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2023-12-16 16:21:59,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:59,404 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-12-16 16:21:59,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 16:21:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-12-16 16:21:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:21:59,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:59,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:59,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 16:21:59,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:59,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:59,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:59,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1693233236, now seen corresponding path program 1 times [2023-12-16 16:21:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:59,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106001514] [2023-12-16 16:21:59,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:21:59,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:59,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:59,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:59,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:21:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:21:59,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:21:59,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:21:59,755 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:21:59,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:59,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106001514] [2023-12-16 16:21:59,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106001514] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:21:59,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:21:59,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:21:59,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152572390] [2023-12-16 16:21:59,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:21:59,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:21:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:59,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:21:59,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:21:59,761 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 16:21:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:59,828 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2023-12-16 16:21:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:21:59,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-16 16:21:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:59,830 INFO L225 Difference]: With dead ends: 31 [2023-12-16 16:21:59,830 INFO L226 Difference]: Without dead ends: 19 [2023-12-16 16:21:59,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:21:59,831 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:59,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:21:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-16 16:21:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-12-16 16:21:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:21:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-16 16:21:59,836 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2023-12-16 16:21:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:59,836 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-16 16:21:59,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 16:21:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-16 16:21:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 16:21:59,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:59,837 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:59,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:22:00,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:22:00,040 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:22:00,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:22:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash 387079308, now seen corresponding path program 1 times [2023-12-16 16:22:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:22:00,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748075377] [2023-12-16 16:22:00,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:22:00,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:22:00,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:22:00,042 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:22:00,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:22:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:22:00,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:22:00,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:22:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:22:00,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:22:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 16:22:00,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:22:00,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748075377] [2023-12-16 16:22:00,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748075377] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:22:00,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:22:00,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 16:22:00,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639498983] [2023-12-16 16:22:00,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:22:00,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:22:00,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:22:00,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:22:00,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:22:00,230 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 16:22:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:22:00,413 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-12-16 16:22:00,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:22:00,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16 [2023-12-16 16:22:00,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:22:00,416 INFO L225 Difference]: With dead ends: 34 [2023-12-16 16:22:00,416 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 16:22:00,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:22:00,417 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:22:00,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:22:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 16:22:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-12-16 16:22:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:22:00,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-12-16 16:22:00,420 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 16 [2023-12-16 16:22:00,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:22:00,421 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-12-16 16:22:00,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 16:22:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-12-16 16:22:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 16:22:00,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:22:00,421 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:22:00,427 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 (4)] Ended with exit code 0 [2023-12-16 16:22:00,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:22:00,625 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:22:00,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:22:00,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1812742508, now seen corresponding path program 2 times [2023-12-16 16:22:00,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:22:00,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926498456] [2023-12-16 16:22:00,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:22:00,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:22:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:22:00,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:22:00,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:22:00,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 16:22:00,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:22:00,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-16 16:22:00,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:22:00,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:22:00,900 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 23 treesize of output 11 [2023-12-16 16:22:00,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 16:22:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 16:22:00,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:22:00,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:22:00,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926498456] [2023-12-16 16:22:00,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926498456] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:22:00,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:22:00,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 16:22:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216703131] [2023-12-16 16:22:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:22:00,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 16:22:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:22:00,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 16:22:00,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:22:00,924 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:22:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:22:01,215 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2023-12-16 16:22:01,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:22:01,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-12-16 16:22:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:22:01,219 INFO L225 Difference]: With dead ends: 22 [2023-12-16 16:22:01,219 INFO L226 Difference]: Without dead ends: 20 [2023-12-16 16:22:01,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:22:01,220 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:22:01,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:22:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-16 16:22:01,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-16 16:22:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:22:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-16 16:22:01,225 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 22 [2023-12-16 16:22:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:22:01,226 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-16 16:22:01,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:22:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-16 16:22:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 16:22:01,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:22:01,227 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:22:01,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:22:01,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:22:01,427 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:22:01,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:22:01,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1711139651, now seen corresponding path program 1 times [2023-12-16 16:22:01,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:22:01,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937648755] [2023-12-16 16:22:01,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:22:01,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:22:01,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:22:01,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:22:01,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:22:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:22:01,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 16:22:01,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:22:01,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:22:01,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2023-12-16 16:22:01,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 16:22:01,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 16:22:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 16:22:01,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:22:01,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2023-12-16 16:22:01,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-12-16 16:22:01,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:22:01,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:22:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:22:01,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:22:01,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937648755] [2023-12-16 16:22:01,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937648755] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:22:01,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:22:01,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2023-12-16 16:22:01,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222867637] [2023-12-16 16:22:01,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:22:01,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 16:22:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:22:01,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 16:22:01,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:22:01,977 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:22:05,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 16:22:10,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 16:22:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:22:10,600 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-12-16 16:22:10,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 16:22:10,612 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2023-12-16 16:22:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:22:10,613 INFO L225 Difference]: With dead ends: 30 [2023-12-16 16:22:10,613 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:22:10,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:22:10,614 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:22:10,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 134 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2023-12-16 16:22:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:22:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2023-12-16 16:22:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:22:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-12-16 16:22:10,618 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 24 [2023-12-16 16:22:10,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:22:10,618 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-12-16 16:22:10,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:22:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-12-16 16:22:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 16:22:10,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:22:10,619 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:22:10,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:22:10,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:22:10,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:22:10,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:22:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1711137977, now seen corresponding path program 1 times [2023-12-16 16:22:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:22:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573015755] [2023-12-16 16:22:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:22:10,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:22:10,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:22:10,828 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:22:10,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:22:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:22:11,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-16 16:22:11,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:22:11,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:22:11,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:22:11,124 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 23 treesize of output 11 [2023-12-16 16:22:11,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-16 16:22:11,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-16 16:22:11,349 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-16 16:22:11,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-12-16 16:22:11,358 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 20 treesize of output 15 [2023-12-16 16:22:11,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2023-12-16 16:22:11,466 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 20 treesize of output 15 [2023-12-16 16:22:11,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 16:22:11,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:22:11,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-16 16:22:11,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-16 16:22:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 16:22:11,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:22:11,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 178 [2023-12-16 16:22:11,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 254 [2023-12-16 16:22:12,413 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse6 (select .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse2 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse0 (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_299) v_arrayElimCell_18))) (or (= (select .cse1 .cse2) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 v_arrayElimCell_19))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_299) v_arrayElimCell_18) v_arrayElimCell_19))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse4 (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_299) v_arrayElimCell_18))) (or (= (select .cse4 .cse2) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 v_arrayElimCell_19))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_299))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 v_arrayElimCell_18) v_arrayElimCell_19)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 .cse6) .cse2))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_299))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 .cse6) .cse2)) (forall ((v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse8 (select .cse7 v_arrayElimCell_18))) (or (= (select .cse8 .cse2) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 v_arrayElimCell_19)))))))))) (or (not .cse0) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_299) .cse6) .cse2))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_299) v_arrayElimCell_18) v_arrayElimCell_19))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (or (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_299))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 v_arrayElimCell_18) v_arrayElimCell_19)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 .cse6) .cse2))))) .cse0)))) is different from false [2023-12-16 16:22:12,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:22:12,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573015755] [2023-12-16 16:22:12,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573015755] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:22:12,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1723197334] [2023-12-16 16:22:12,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:22:12,466 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 16:22:12,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 16:22:12,505 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 16:22:12,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-16 16:22:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:22:12,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-16 16:22:12,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:22:12,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:22:12,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:22:12,856 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 23 treesize of output 11 [2023-12-16 16:22:13,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-16 16:22:13,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-16 16:22:17,321 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 16:22:17,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-16 16:22:17,344 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-16 16:22:17,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-12-16 16:22:17,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 16:22:17,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-16 16:22:17,491 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 20 treesize of output 15 [2023-12-16 16:22:17,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:22:17,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-16 16:22:17,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-16 16:22:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 16:22:17,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:22:17,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 178 [2023-12-16 16:22:17,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 254 [2023-12-16 16:22:17,712 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse1 (select .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse6 (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_376))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_arrayElimCell_30) v_arrayElimCell_31)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 .cse3) .cse1)))))) (.cse5 (and (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_376) v_arrayElimCell_30) v_arrayElimCell_31))) (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse10 (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_376) v_arrayElimCell_30))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 v_arrayElimCell_31)) (= (select .cse10 .cse1) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse4 (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse7 (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|))) (and (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_376))) (or (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse0 (select .cse2 v_arrayElimCell_30))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 v_arrayElimCell_31)) (= (select .cse0 .cse1) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 .cse3) .cse1))))) (or .cse4 .cse5) (or .cse4 .cse6) (or .cse6 .cse7) (or .cse7 .cse5) (or (not .cse4) (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_376) .cse3) .cse1))) (not .cse7)))))) is different from false [2023-12-16 16:22:18,002 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse3 (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (.cse1 (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse2 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (and (or (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| v_ArrVal_376))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26|))) (= (select (select .cse0 v_arrayElimCell_30) v_arrayElimCell_31) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) .cse2))))) .cse3) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26|))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| v_ArrVal_376))) (or (= (select (select .cse5 v_arrayElimCell_30) v_arrayElimCell_31) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 .cse1) .cse2))))))) (or (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26|))) (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse6 (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| v_ArrVal_376) v_arrayElimCell_30))) (or (= (select .cse6 .cse2) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse6 v_arrayElimCell_31) |c_ULTIMATE.start_main_~data~0#1|)))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26|))) (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (= (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| v_ArrVal_376) v_arrayElimCell_30) v_arrayElimCell_31) |c_ULTIMATE.start_main_~data~0#1|))))) .cse3) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26|))) (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (= (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| v_ArrVal_376) v_arrayElimCell_30) v_arrayElimCell_31) |c_ULTIMATE.start_main_~data~0#1|)) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26|))) (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| v_ArrVal_376))) (or (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse7 (select .cse8 v_arrayElimCell_30))) (or (= (select .cse7 .cse2) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse7 v_arrayElimCell_31) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse1) .cse2))))))) (or (not .cse3) (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| v_ArrVal_376) .cse1) .cse2)) (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26|))) (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse9 (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| v_ArrVal_376) v_arrayElimCell_30))) (or (= (select .cse9 .cse2) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse9 v_arrayElimCell_31) |c_ULTIMATE.start_main_~data~0#1|)))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_26|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-12-16 16:22:18,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1723197334] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:22:18,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:22:18,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2023-12-16 16:22:18,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012488468] [2023-12-16 16:22:18,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:22:18,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 16:22:18,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:22:18,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 16:22:18,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=629, Unknown=15, NotChecked=156, Total=870 [2023-12-16 16:22:18,016 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 16:22:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:22:19,493 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-12-16 16:22:19,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 16:22:19,493 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-12-16 16:22:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:22:19,494 INFO L225 Difference]: With dead ends: 27 [2023-12-16 16:22:19,494 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 16:22:19,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=104, Invalid=949, Unknown=15, NotChecked=192, Total=1260 [2023-12-16 16:22:19,495 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:22:19,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 133 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 16:22:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 16:22:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-16 16:22:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:22:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-12-16 16:22:19,499 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 24 [2023-12-16 16:22:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:22:19,499 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-12-16 16:22:19,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 16:22:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-12-16 16:22:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:22:19,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:22:19,500 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:22:19,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:22:19,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-16 16:22:19,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 16:22:19,905 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:22:19,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:22:19,905 INFO L85 PathProgramCache]: Analyzing trace with hash 568910808, now seen corresponding path program 1 times [2023-12-16 16:22:19,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:22:19,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847334176] [2023-12-16 16:22:19,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:22:19,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:22:19,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:22:19,906 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:22:19,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 16:22:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:22:20,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-16 16:22:20,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:22:20,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 16:22:20,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2023-12-16 16:22:20,342 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 16:22:20,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2023-12-16 16:22:20,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:22:20,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-12-16 16:22:20,448 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-12-16 16:22:20,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2023-12-16 16:22:20,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-16 16:22:20,654 INFO L349 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2023-12-16 16:22:20,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 69 [2023-12-16 16:22:20,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:22:20,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 50 [2023-12-16 16:22:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:22:21,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:22:21,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:22:21,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 132 [2023-12-16 16:22:21,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 431 treesize of output 371 [2023-12-16 16:22:23,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:22:23,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2023-12-16 16:22:23,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:22:23,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2023-12-16 16:22:23,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:22:23,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 174 [2023-12-16 16:22:24,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:22:24,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 207 [2023-12-16 16:22:24,524 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse29 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse29 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse6 (select .cse29 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse18 (= .cse13 (_ bv0 32)))) (let ((.cse7 (not .cse18)) (.cse10 (bvadd .cse6 (_ bv4 32))) (.cse0 (select .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) .cse13))) (and (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_4 (_ bv4 32)) .cse0)) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_33| (_ BitVec 32))) (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_33| v_arrayElimArr_4)) (.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_33|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse1 .cse3) .cse4))) (or (not (= (select (select .cse1 .cse2) (bvadd (_ bv4 32) v_arrayElimCell_46)) (_ bv0 32))) (= .cse3 .cse2) (= .cse3 |v_node_create_~temp~0#1.base_33|))))))) (or (= .cse6 (_ bv0 32)) (and (or .cse7 (forall ((|v_node_create_~temp~0#1.base_33| (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_33|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse8 |v_node_create_~temp~0#1.base_33|)) (not (= (select (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_33| v_arrayElimArr_3))) (select .cse9 (select (select .cse9 .cse8) (_ bv4 32)))) .cse10) (_ bv0 32))) (not (= (select v_arrayElimArr_3 (_ bv4 32)) .cse0)))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (or (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_node_create_~temp~0#1.base_33| (_ BitVec 32))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_33|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_33| v_arrayElimArr_3))) (select .cse11 (select (select .cse11 .cse12) .cse4))) (bvadd (_ bv4 32) v_arrayElimCell_46)) (_ bv0 32))) (= .cse12 |v_node_create_~temp~0#1.base_33|)))) (not (= (select v_arrayElimArr_3 (_ bv4 32)) .cse0)))) (= v_arrayElimCell_46 .cse13))))) (forall ((|v_node_create_~temp~0#1.base_33| (_ BitVec 32))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_33|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_3 (_ bv4 32)) .cse0)) (= v_arrayElimCell_46 .cse13) (not (= (select (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_33| v_arrayElimArr_3))) (select .cse14 (select (select .cse14 .cse15) .cse4))) (bvadd (_ bv4 32) v_arrayElimCell_46)) (_ bv0 32))))) (= .cse15 |v_node_create_~temp~0#1.base_33|)))) (or (and (or .cse7 (forall ((|v_node_create_~temp~0#1.base_33| (_ BitVec 32)) (v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_33|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse16 |v_node_create_~temp~0#1.base_33|)) (not (= (select v_arrayElimArr_1 (_ bv4 32)) .cse0)) (not (= (_ bv0 32) (select (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_33| v_arrayElimArr_1))) (select .cse17 (select (select .cse17 .cse16) (_ bv4 32)))) .cse10))))))) (or .cse18 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_33| (_ BitVec 32)) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_2 (_ bv4 32)) .cse0)) (not (= (select (let ((.cse19 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_33| v_arrayElimArr_2))) (select .cse19 (select (select .cse19 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_33|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4))) (bvadd (_ bv4 32) v_arrayElimCell_46)) (_ bv0 32)))))) (forall ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_33| (_ BitVec 32))) (let ((.cse21 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_33|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (let ((.cse20 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_33| v_arrayElimArr_2))) (select .cse20 (select (select .cse20 .cse21) .cse4))) (bvadd (_ bv4 32) v_arrayElimCell_46)) (_ bv0 32))) (= .cse21 |v_node_create_~temp~0#1.base_33|)))) (not (= (select v_arrayElimArr_2 (_ bv4 32)) .cse0))))) (not (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_main_~uneq~0#1|))) (or .cse7 (forall ((|v_node_create_~temp~0#1.base_33| (_ BitVec 32)) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_33| v_arrayElimArr_4)) (.cse22 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_33|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse24 (select (select .cse23 .cse22) (_ bv4 32)))) (or (not (= .cse22 |v_node_create_~temp~0#1.base_33|)) (not (= (select v_arrayElimArr_4 (_ bv4 32)) .cse0)) (not (= (select (select .cse23 .cse24) .cse10) (_ bv0 32))) (= .cse22 .cse24)))))) (or .cse18 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_33| (_ BitVec 32)) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_33| v_arrayElimArr_4)) (.cse27 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_33|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (select (select .cse25 .cse27) .cse4))) (or (not (= (select v_arrayElimArr_4 (_ bv4 32)) .cse0)) (not (= (select (select .cse25 .cse26) (bvadd (_ bv4 32) v_arrayElimCell_46)) (_ bv0 32))) (= .cse27 .cse26)))))) (or .cse18 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_33| (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_3 (_ bv4 32)) .cse0)) (= v_arrayElimCell_46 .cse13) (not (= (select (let ((.cse28 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_33| v_arrayElimArr_3))) (select .cse28 (select (select .cse28 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_33|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4))) (bvadd (_ bv4 32) v_arrayElimCell_46)) (_ bv0 32))))))))))) is different from false [2023-12-16 16:22:25,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:22:25,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847334176] [2023-12-16 16:22:25,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847334176] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:22:25,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1986082300] [2023-12-16 16:22:25,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:22:25,606 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 16:22:25,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 16:22:25,607 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 16:22:25,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-16 16:22:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:22:25,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-16 16:22:25,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:22:25,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:22:26,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 16:22:26,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-16 16:22:26,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2023-12-16 16:22:26,532 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-16 16:22:26,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-12-16 16:22:26,544 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 16 [2023-12-16 16:22:26,648 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 28 treesize of output 27 [2023-12-16 16:22:26,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-12-16 16:22:26,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:22:26,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-16 16:22:26,838 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 16:22:26,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2023-12-16 16:22:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:22:26,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:22:27,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 206 [2023-12-16 16:22:27,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:22:27,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 159 [2023-12-16 16:22:27,877 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse10 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (bvadd (_ bv4 32) .cse10)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse0 (= .cse10 (_ bv0 32)))) (and (or (not .cse0) (forall ((|v_node_create_~temp~0#1.base_36| (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_36|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |v_node_create_~temp~0#1.base_36|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_36|) (_ bv0 1))) (not (= (_ bv0 32) (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_36| v_arrayElimArr_5))) (select .cse2 (select (select .cse2 .cse1) (_ bv4 32)))) (bvadd (select .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (_ bv4 32))))) (not (= (select v_arrayElimArr_5 (_ bv4 32)) .cse4)))))) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_node_create_~temp~0#1.base_36| (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_36|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_36|) (_ bv0 1))) (not (= (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_36| v_arrayElimArr_5))) (select .cse6 (select (select .cse6 .cse7) .cse8))) (bvadd (_ bv4 32) v_arrayElimCell_57)) (_ bv0 32))) (= .cse7 |v_node_create_~temp~0#1.base_36|)))) (not (= (select v_arrayElimArr_5 (_ bv4 32)) .cse4)))) (or (forall ((|v_node_create_~temp~0#1.base_36| (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_36|) (_ bv0 1))) (not (= (select (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_36| v_arrayElimArr_5))) (select .cse9 (select (select .cse9 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_36|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse8))) (bvadd (_ bv4 32) v_arrayElimCell_57)) (_ bv0 32))) (not (= (select v_arrayElimArr_5 (_ bv4 32)) .cse4)))) .cse0))))) is different from false [2023-12-16 16:22:27,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1986082300] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:22:27,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:22:27,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2023-12-16 16:22:27,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578506964] [2023-12-16 16:22:27,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:22:27,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-16 16:22:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:22:27,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-16 16:22:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1600, Unknown=2, NotChecked=162, Total=1892 [2023-12-16 16:22:27,915 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 35 states, 28 states have (on average 1.25) internal successors, (35), 26 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 16:22:34,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 16:22:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:22:34,719 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-12-16 16:22:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 16:22:34,720 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 1.25) internal successors, (35), 26 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-12-16 16:22:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:22:34,722 INFO L225 Difference]: With dead ends: 33 [2023-12-16 16:22:34,722 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 16:22:34,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=261, Invalid=2937, Unknown=2, NotChecked=222, Total=3422 [2023-12-16 16:22:34,724 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-16 16:22:34,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 293 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 404 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2023-12-16 16:22:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 16:22:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2023-12-16 16:22:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:22:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-16 16:22:34,728 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 26 [2023-12-16 16:22:34,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:22:34,729 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-16 16:22:34,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 1.25) internal successors, (35), 26 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 16:22:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-16 16:22:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:22:34,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:22:34,729 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:22:34,737 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 (9)] Ended with exit code 0 [2023-12-16 16:22:34,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-16 16:22:35,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 16:22:35,130 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:22:35,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:22:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash 568912482, now seen corresponding path program 1 times [2023-12-16 16:22:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:22:35,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961927265] [2023-12-16 16:22:35,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:22:35,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:22:35,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:22:35,132 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:22:35,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 16:22:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:22:35,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 94 conjunts are in the unsatisfiable core [2023-12-16 16:22:35,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:22:35,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:22:35,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:22:35,470 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 23 treesize of output 11 [2023-12-16 16:22:35,583 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-16 16:22:35,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-12-16 16:22:35,596 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 16 treesize of output 11 [2023-12-16 16:22:35,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:22:35,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 16:22:35,692 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 20 treesize of output 15 [2023-12-16 16:22:35,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-12-16 16:22:35,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2023-12-16 16:22:35,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-12-16 16:22:35,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-16 16:22:36,107 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 16:22:36,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-16 16:22:36,149 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 16:22:36,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2023-12-16 16:22:36,166 INFO L349 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2023-12-16 16:22:36,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-16 16:22:36,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-16 16:22:36,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2023-12-16 16:22:36,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 91 [2023-12-16 16:22:36,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 121 [2023-12-16 16:22:36,413 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-12-16 16:22:36,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2023-12-16 16:22:36,497 INFO L349 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2023-12-16 16:22:36,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 87 [2023-12-16 16:22:36,532 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-12-16 16:22:36,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 65 [2023-12-16 16:22:37,377 INFO L349 Elim1Store]: treesize reduction 8, result has 90.1 percent of original size [2023-12-16 16:22:37,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 145 treesize of output 172 [2023-12-16 16:22:37,740 INFO L349 Elim1Store]: treesize reduction 8, result has 90.1 percent of original size [2023-12-16 16:22:37,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 153 [2023-12-16 16:23:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:23:01,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:23:02,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:23:02,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 276 [2023-12-16 16:23:02,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:23:02,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 248 [2023-12-16 16:23:03,363 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_39| (_ BitVec 32)) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_39| v_arrayElimArr_7)) (.cse4 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_39| v_arrayElimArr_6)) (.cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_node_create_~temp~0#1.base_39|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (bvadd (_ bv4 32) .cse9))) (let ((.cse1 (select (select .cse4 .cse8) .cse10)) (.cse2 (select (select .cse6 .cse8) .cse10)) (.cse0 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_39| v_ArrVal_607))) (or (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) .cse2))) (not (= (select .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (select v_arrayElimArr_7 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (bvadd (_ bv4 32) .cse2))) (select (select .cse0 (select (select .cse4 .cse1) .cse5)) (select (select .cse6 .cse1) .cse5)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_39|))) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (not (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse0 .cse8) .cse9))))))))) is different from false [2023-12-16 16:23:03,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:23:03,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961927265] [2023-12-16 16:23:03,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961927265] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:23:03,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1481622279] [2023-12-16 16:23:03,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:23:03,389 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 16:23:03,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 16:23:03,390 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 16:23:03,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-16 16:23:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:23:03,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 90 conjunts are in the unsatisfiable core [2023-12-16 16:23:03,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:23:03,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:23:03,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:23:03,875 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 23 treesize of output 11 [2023-12-16 16:23:04,165 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:23:04,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-16 16:23:04,182 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 16 treesize of output 11 [2023-12-16 16:23:04,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:23:04,334 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 20 treesize of output 15 [2023-12-16 16:23:04,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 16:23:04,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-12-16 16:23:04,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2023-12-16 16:23:04,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-16 16:23:04,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 16:23:09,168 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 16:23:09,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-16 16:23:09,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:23:09,200 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 55 treesize of output 38 [2023-12-16 16:23:09,234 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-16 16:23:09,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-16 16:23:09,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-16 16:23:09,460 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 59 treesize of output 42 [2023-12-16 16:23:09,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 46 [2023-12-16 16:23:09,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-16 16:23:09,487 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 23 treesize of output 22 [2023-12-16 16:23:09,831 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 16:23:09,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2023-12-16 16:23:09,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 16:23:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:23:10,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-16 16:23:11,938 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:23:11,955 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:23:11,961 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:23:11,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 16:23:11,983 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:23:12,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2023-12-16 16:23:12,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 16:23:12,356 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 48 known predicates. [2023-12-16 16:23:12,360 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-12-16 16:23:12,361 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:23:12,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:23:12 BoogieIcfgContainer [2023-12-16 16:23:12,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:23:12,362 INFO L158 Benchmark]: Toolchain (without parser) took 74138.89ms. Allocated memory was 185.6MB in the beginning and 281.0MB in the end (delta: 95.4MB). Free memory was 139.9MB in the beginning and 242.8MB in the end (delta: -102.9MB). Peak memory consumption was 152.4MB. Max. memory is 8.0GB. [2023-12-16 16:23:12,363 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:23:12,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.00ms. Allocated memory is still 185.6MB. Free memory was 139.4MB in the beginning and 120.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 16:23:12,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.66ms. Allocated memory is still 185.6MB. Free memory was 120.5MB in the beginning and 117.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:23:12,363 INFO L158 Benchmark]: Boogie Preprocessor took 60.79ms. Allocated memory is still 185.6MB. Free memory was 117.9MB in the beginning and 114.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:23:12,363 INFO L158 Benchmark]: RCFGBuilder took 400.77ms. Allocated memory is still 185.6MB. Free memory was 114.7MB in the beginning and 93.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-16 16:23:12,363 INFO L158 Benchmark]: TraceAbstraction took 73296.86ms. Allocated memory was 185.6MB in the beginning and 281.0MB in the end (delta: 95.4MB). Free memory was 93.2MB in the beginning and 242.8MB in the end (delta: -149.6MB). Peak memory consumption was 106.3MB. Max. memory is 8.0GB. [2023-12-16 16:23:12,365 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.11ms. Allocated memory is still 185.6MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 342.00ms. Allocated memory is still 185.6MB. Free memory was 139.4MB in the beginning and 120.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.66ms. Allocated memory is still 185.6MB. Free memory was 120.5MB in the beginning and 117.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.79ms. Allocated memory is still 185.6MB. Free memory was 117.9MB in the beginning and 114.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 400.77ms. Allocated memory is still 185.6MB. Free memory was 114.7MB in the beginning and 93.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 73296.86ms. Allocated memory was 185.6MB in the beginning and 281.0MB in the end (delta: 95.4MB). Free memory was 93.2MB in the beginning and 242.8MB in the end (delta: -149.6MB). Peak memory consumption was 106.3MB. 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: 629]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 629). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 48 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.3s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 16.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 15.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 618 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868 IncrementalHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 103 mSDtfsCounter, 868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=7, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 182 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 211 ConstructedInterpolants, 22 QuantifiedInterpolants, 1722 SizeOfPredicates, 126 NumberOfNonLiveVariables, 1553 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 76/108 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