/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/forester-heap/sll-rb-sentinel-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:17:35,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:17:35,643 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:17:35,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:17:35,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:17:35,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:17:35,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:17:35,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:17:35,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:17:35,667 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:17:35,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:17:35,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:17:35,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:17:35,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:17:35,669 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:17:35,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:17:35,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:17:35,670 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:17:35,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:17:35,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:17:35,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:17:35,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:17:35,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:17:35,672 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:17:35,672 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:17:35,672 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:17:35,672 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:17:35,672 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:17:35,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:17:35,673 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:17:35,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:17:35,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:17:35,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:17:35,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:17:35,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:17:35,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:17:35,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:17:35,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:17:35,675 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:17:35,675 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:17:35,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:17:35,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:17:35,676 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:17:35,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:17:35,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:17:35,677 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:17:35,677 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:17:35,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:17:35,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:17:35,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:17:35,872 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:17:35,872 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:17:35,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i [2023-12-16 16:17:37,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:17:37,281 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:17:37,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i [2023-12-16 16:17:37,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78efc7434/e02b568e953e42ac9d9e843957a91fed/FLAG626697855 [2023-12-16 16:17:37,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78efc7434/e02b568e953e42ac9d9e843957a91fed [2023-12-16 16:17:37,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:17:37,310 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:17:37,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:17:37,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:17:37,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:17:37,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:17:37" (1/1) ... [2023-12-16 16:17:37,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5560a46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37, skipping insertion in model container [2023-12-16 16:17:37,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:17:37" (1/1) ... [2023-12-16 16:17:37,369 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:17:37,611 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22534,22547] [2023-12-16 16:17:37,615 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22606,22619] [2023-12-16 16:17:37,617 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22746,22759] [2023-12-16 16:17:37,617 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22820,22833] [2023-12-16 16:17:37,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:17:37,633 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:17:37,675 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22534,22547] [2023-12-16 16:17:37,676 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22606,22619] [2023-12-16 16:17:37,677 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22746,22759] [2023-12-16 16:17:37,678 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22820,22833] [2023-12-16 16:17:37,681 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:17:37,707 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:17:37,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37 WrapperNode [2023-12-16 16:17:37,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:17:37,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:17:37,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:17:37,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:17:37,715 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:17:37" (1/1) ... [2023-12-16 16:17:37,741 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:17:37" (1/1) ... [2023-12-16 16:17:37,773 INFO L138 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2023-12-16 16:17:37,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:17:37,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:17:37,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:17:37,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:17:37,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37" (1/1) ... [2023-12-16 16:17:37,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37" (1/1) ... [2023-12-16 16:17:37,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37" (1/1) ... [2023-12-16 16:17:37,804 INFO L175 MemorySlicer]: Split 24 memory accesses to 2 slices as follows [2, 22]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2023-12-16 16:17:37,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37" (1/1) ... [2023-12-16 16:17:37,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37" (1/1) ... [2023-12-16 16:17:37,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37" (1/1) ... [2023-12-16 16:17:37,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37" (1/1) ... [2023-12-16 16:17:37,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37" (1/1) ... [2023-12-16 16:17:37,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37" (1/1) ... [2023-12-16 16:17:37,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:17:37,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:17:37,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:17:37,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:17:37,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37" (1/1) ... [2023-12-16 16:17:37,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:17:37,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:17:37,861 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:17:37,884 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:17:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:17:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:17:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:17:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:17:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 16:17:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 16:17:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 16:17:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 16:17:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:17:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:17:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:17:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:17:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:17:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:17:37,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:17:38,013 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:17:38,015 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:17:38,585 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:17:38,631 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:17:38,631 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-12-16 16:17:38,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:17:38 BoogieIcfgContainer [2023-12-16 16:17:38,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:17:38,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:17:38,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:17:38,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:17:38,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:17:37" (1/3) ... [2023-12-16 16:17:38,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a0248f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:17:38, skipping insertion in model container [2023-12-16 16:17:38,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:37" (2/3) ... [2023-12-16 16:17:38,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a0248f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:17:38, skipping insertion in model container [2023-12-16 16:17:38,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:17:38" (3/3) ... [2023-12-16 16:17:38,639 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-1.i [2023-12-16 16:17:38,657 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:17:38,658 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-16 16:17:38,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:17:38,695 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;@1a7dcb0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:17:38,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-16 16:17:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 2.0) internal successors, (50), 29 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-16 16:17:38,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:38,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-16 16:17:38,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-16 16:17:38,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash 154845866, now seen corresponding path program 1 times [2023-12-16 16:17:38,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:38,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719190374] [2023-12-16 16:17:38,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:38,719 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:17:38,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:38,720 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:17:38,733 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:17:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:38,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:17:38,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:38,846 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:17:38,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:17:38,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:38,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719190374] [2023-12-16 16:17:38,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719190374] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:17:38,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:17:38,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:17:38,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095500027] [2023-12-16 16:17:38,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:17:38,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:17:38,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:38,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:17:38,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:17:38,892 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 2.0) internal successors, (50), 29 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:38,969 INFO L93 Difference]: Finished difference Result 56 states and 93 transitions. [2023-12-16 16:17:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:17:38,971 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-16 16:17:38,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:38,976 INFO L225 Difference]: With dead ends: 56 [2023-12-16 16:17:38,976 INFO L226 Difference]: Without dead ends: 26 [2023-12-16 16:17:38,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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:17:38,980 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:38,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:17:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-16 16:17:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-16 16:17:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-16 16:17:39,009 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 5 [2023-12-16 16:17:39,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:39,009 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-16 16:17:39,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-16 16:17:39,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 16:17:39,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:39,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 16:17:39,013 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:17:39,210 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:17:39,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-16 16:17:39,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:39,211 INFO L85 PathProgramCache]: Analyzing trace with hash 492885517, now seen corresponding path program 1 times [2023-12-16 16:17:39,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:39,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607034407] [2023-12-16 16:17:39,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:39,214 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:17:39,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:39,215 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:17:39,245 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:17:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:39,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:17:39,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:39,379 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 10 treesize of output 8 [2023-12-16 16:17:39,416 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:17:39,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:17:39,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:39,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607034407] [2023-12-16 16:17:39,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607034407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:17:39,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:17:39,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:17:39,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040085258] [2023-12-16 16:17:39,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:17:39,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:17:39,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:39,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:17:39,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:17:39,422 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:39,842 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2023-12-16 16:17:39,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:17:39,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-16 16:17:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:39,843 INFO L225 Difference]: With dead ends: 32 [2023-12-16 16:17:39,843 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 16:17:39,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:17:39,845 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:39,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 25 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 16:17:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 16:17:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2023-12-16 16:17:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-12-16 16:17:39,850 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2023-12-16 16:17:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:39,851 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-12-16 16:17:39,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-12-16 16:17:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 16:17:39,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:39,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:17:39,860 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:17:40,052 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:17:40,053 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-16 16:17:40,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:40,053 INFO L85 PathProgramCache]: Analyzing trace with hash -936802660, now seen corresponding path program 1 times [2023-12-16 16:17:40,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:40,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418691838] [2023-12-16 16:17:40,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:40,054 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:17:40,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:40,056 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:17:40,066 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:17:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:40,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:17:40,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:40,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-16 16:17:40,224 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:17:40,224 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:17:40,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418691838] [2023-12-16 16:17:40,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418691838] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:17:40,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:17:40,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:17:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870110827] [2023-12-16 16:17:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:17:40,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:17:40,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:40,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:17:40,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:17:40,230 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:40,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:40,898 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-12-16 16:17:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:17:40,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-16 16:17:40,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:40,901 INFO L225 Difference]: With dead ends: 49 [2023-12-16 16:17:40,901 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 16:17:40,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:17:40,902 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:40,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 64 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 16:17:40,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 16:17:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2023-12-16 16:17:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-12-16 16:17:40,915 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 9 [2023-12-16 16:17:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:40,916 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-12-16 16:17:40,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-12-16 16:17:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 16:17:40,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:40,919 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:17:40,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:17:41,122 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:17:41,123 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-16 16:17:41,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1923452346, now seen corresponding path program 1 times [2023-12-16 16:17:41,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:41,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156261180] [2023-12-16 16:17:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:41,125 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:17:41,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:41,127 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:17:41,135 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:17:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:41,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 16:17:41,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:41,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:17:41,324 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:17:41,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:17:41,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-12-16 16:17:41,422 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 35 treesize of output 18 [2023-12-16 16:17:41,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 11 [2023-12-16 16:17:41,440 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 26 treesize of output 14 [2023-12-16 16:17:41,462 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:17:41,463 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 13 treesize of output 13 [2023-12-16 16:17:41,508 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 17 treesize of output 19 [2023-12-16 16:17:41,514 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 8 treesize of output 7 [2023-12-16 16:17:41,561 INFO L349 Elim1Store]: treesize reduction 14, result has 39.1 percent of original size [2023-12-16 16:17:41,564 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 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-16 16:17:41,582 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 8 treesize of output 7 [2023-12-16 16:17:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:17:41,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:17:41,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:17:41,778 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 18 treesize of output 22 [2023-12-16 16:17:41,796 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_148 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_34| (_ BitVec 32))) (or (not (= (select v_arrayElimArr_1 (_ bv4 32)) (_ bv1 32))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_148) |v_ULTIMATE.start_main_~end~0#1.base_34| v_arrayElimArr_1) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 32)))) is different from false [2023-12-16 16:17:41,850 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_144 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_35| (_ BitVec 32)) (v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_34| (_ BitVec 32))) (or (not (= (select v_arrayElimArr_1 (_ bv4 32)) (_ bv1 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_35|) (_ bv0 1))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_144) |v_ULTIMATE.start_main_~end~0#1.base_35| v_ArrVal_148) |v_ULTIMATE.start_main_~end~0#1.base_34| v_arrayElimArr_1) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 32)) (not (= v_ArrVal_144 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_144 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) is different from false [2023-12-16 16:17:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-16 16:17:41,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:41,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156261180] [2023-12-16 16:17:41,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156261180] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:17:41,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:17:41,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-16 16:17:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686561623] [2023-12-16 16:17:41,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:17:41,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 16:17:41,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:41,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 16:17:41,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=51, Unknown=2, NotChecked=30, Total=110 [2023-12-16 16:17:41,896 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:43,294 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2023-12-16 16:17:43,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 16:17:43,295 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-16 16:17:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:43,295 INFO L225 Difference]: With dead ends: 71 [2023-12-16 16:17:43,296 INFO L226 Difference]: Without dead ends: 69 [2023-12-16 16:17:43,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=120, Unknown=2, NotChecked=50, Total=240 [2023-12-16 16:17:43,297 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 93 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:43,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 118 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 0 Unknown, 137 Unchecked, 1.2s Time] [2023-12-16 16:17:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-16 16:17:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 37. [2023-12-16 16:17:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:43,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-12-16 16:17:43,308 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 12 [2023-12-16 16:17:43,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:43,308 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-12-16 16:17:43,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-12-16 16:17:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 16:17:43,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:43,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:17:43,319 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:17:43,515 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:17:43,515 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-16 16:17:43,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash -69079933, now seen corresponding path program 1 times [2023-12-16 16:17:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:43,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144221917] [2023-12-16 16:17:43,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:43,517 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:17:43,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:43,518 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:17:43,523 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:17:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:43,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 16:17:43,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:43,605 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:17:43,666 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:17:43,666 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:17:43,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:43,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144221917] [2023-12-16 16:17:43,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144221917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:17:43,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:17:43,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:17:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23888322] [2023-12-16 16:17:43,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:17:43,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:17:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:43,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:17:43,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:17:43,668 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:44,519 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2023-12-16 16:17:44,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:17:44,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-16 16:17:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:44,520 INFO L225 Difference]: With dead ends: 77 [2023-12-16 16:17:44,520 INFO L226 Difference]: Without dead ends: 65 [2023-12-16 16:17:44,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:17:44,521 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:44,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 64 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 16:17:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-16 16:17:44,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2023-12-16 16:17:44,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2023-12-16 16:17:44,533 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 13 [2023-12-16 16:17:44,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:44,533 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2023-12-16 16:17:44,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2023-12-16 16:17:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 16:17:44,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:44,534 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:17:44,542 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:17:44,739 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:17:44,739 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-16 16:17:44,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:44,740 INFO L85 PathProgramCache]: Analyzing trace with hash -370816548, now seen corresponding path program 2 times [2023-12-16 16:17:44,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:44,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933760953] [2023-12-16 16:17:44,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:17:44,740 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:17:44,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:44,741 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:17:44,742 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:17:44,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:17:44,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:17:44,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-16 16:17:44,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:45,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2023-12-16 16:17:45,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:17:45,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2023-12-16 16:17:45,016 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:17:45,074 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:17:45,074 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:17:45,089 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-12-16 16:17:45,095 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:17:45,163 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-16 16:17:45,163 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 16 treesize of output 15 [2023-12-16 16:17:45,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:17:45,183 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 21 treesize of output 11 [2023-12-16 16:17:45,213 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-16 16:17:45,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 32 [2023-12-16 16:17:45,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:17:45,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-12-16 16:17:45,370 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-12-16 16:17:45,371 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 20 treesize of output 22 [2023-12-16 16:17:45,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2023-12-16 16:17:45,399 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:17:45,452 INFO L349 Elim1Store]: treesize reduction 14, result has 39.1 percent of original size [2023-12-16 16:17:45,453 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 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-16 16:17:45,459 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 8 treesize of output 7 [2023-12-16 16:17:45,479 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 17 treesize of output 19 [2023-12-16 16:17:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:17:45,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:17:45,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:17:45,612 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 18 treesize of output 22 [2023-12-16 16:17:49,718 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_289 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_41| (_ BitVec 32)) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_42| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_42|) (_ bv0 1))) (not (= (select v_arrayElimArr_3 (_ bv4 32)) (_ bv1 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_289) |v_ULTIMATE.start_main_~end~0#1.base_42| v_ArrVal_292) |v_ULTIMATE.start_main_~end~0#1.base_41| v_arrayElimArr_3) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 32)))) is different from false [2023-12-16 16:17:49,827 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_289 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_41| (_ BitVec 32)) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_284 (_ BitVec 1)) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_42| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_43| (_ BitVec 32))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_43| v_ArrVal_284) |v_ULTIMATE.start_main_~end~0#1.base_42|) (_ bv0 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_43|) (_ bv0 1))) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_285) |v_ULTIMATE.start_main_~end~0#1.base_43| v_ArrVal_289) |v_ULTIMATE.start_main_~end~0#1.base_42| v_ArrVal_292) |v_ULTIMATE.start_main_~end~0#1.base_41| v_arrayElimArr_3) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 32)) (not (= (select v_arrayElimArr_3 (_ bv4 32)) (_ bv1 32))))) is different from false [2023-12-16 16:17:53,890 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_41| (_ BitVec 32)) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_284 (_ BitVec 1)) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_42| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_44| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_44| (_ bv1 1)))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~end~0#1.base_43|) (_ bv0 1))) (not (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~end~0#1.base_43| v_ArrVal_284) |v_ULTIMATE.start_main_~end~0#1.base_42|))) (not (= (select v_arrayElimArr_3 (_ bv4 32)) (_ bv1 32))) (= (_ bv1 32) (select (select (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_281)) |v_ULTIMATE.start_main_~end~0#1.base_44| v_ArrVal_285) |v_ULTIMATE.start_main_~end~0#1.base_43| v_ArrVal_289) |v_ULTIMATE.start_main_~end~0#1.base_42| v_ArrVal_292) |v_ULTIMATE.start_main_~end~0#1.base_41| v_arrayElimArr_3) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_44|)))))) is different from false [2023-12-16 16:17:53,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-12-16 16:17:53,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:53,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933760953] [2023-12-16 16:17:53,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933760953] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:17:53,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:17:53,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-16 16:17:53,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089256604] [2023-12-16 16:17:53,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:17:53,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 16:17:53,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:53,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 16:17:53,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=93, Unknown=7, NotChecked=66, Total=210 [2023-12-16 16:17:53,939 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:56,200 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2023-12-16 16:17:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 16:17:56,200 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 16:17:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:56,201 INFO L225 Difference]: With dead ends: 55 [2023-12-16 16:17:56,201 INFO L226 Difference]: Without dead ends: 53 [2023-12-16 16:17:56,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=92, Invalid=185, Unknown=7, NotChecked=96, Total=380 [2023-12-16 16:17:56,202 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 70 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:56,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 83 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 92 Invalid, 0 Unknown, 124 Unchecked, 2.0s Time] [2023-12-16 16:17:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-16 16:17:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2023-12-16 16:17:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-12-16 16:17:56,215 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 15 [2023-12-16 16:17:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:56,216 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-12-16 16:17:56,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-12-16 16:17:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 16:17:56,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:56,216 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:17:56,228 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:17:56,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:17:56,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-16 16:17:56,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash 448129033, now seen corresponding path program 1 times [2023-12-16 16:17:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:56,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679983071] [2023-12-16 16:17:56,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:56,427 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:17:56,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:56,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:17:56,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 (8)] Waiting until timeout for monitored process [2023-12-16 16:17:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:56,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 16:17:56,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:56,598 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-12-16 16:17:56,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 86 [2023-12-16 16:17:56,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 23 [2023-12-16 16:17:56,645 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 16:17:56,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 7 [2023-12-16 16:17:56,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:17:56,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2023-12-16 16:17:56,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2023-12-16 16:17:56,751 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 0 case distinctions, treesize of input 45 treesize of output 44 [2023-12-16 16:17:56,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 37 [2023-12-16 16:17:56,778 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2023-12-16 16:17:56,811 INFO L349 Elim1Store]: treesize reduction 38, result has 29.6 percent of original size [2023-12-16 16:17:56,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 22 treesize of output 24 [2023-12-16 16:17:57,033 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (or (exists ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (= .cse0 (store (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~null~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~null~0#1.base|) .cse1 (select .cse0 .cse1)))) (= (select v_arrayElimArr_7 (_ bv0 32)) (_ bv0 32)))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~null~0#1.base|))) (and (= |c_ULTIMATE.start_main_~null~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) (or (= (select .cse2 (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) .cse1) (= |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32))) (= |c_ULTIMATE.start_main_~null~0#1.base| (select .cse2 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) is different from true [2023-12-16 16:17:57,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:17:57,371 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 90 treesize of output 84 [2023-12-16 16:17:57,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 70 treesize of output 75 [2023-12-16 16:17:57,421 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2023-12-16 16:17:57,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 75 [2023-12-16 16:17:57,434 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:17:57,527 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 17 treesize of output 11 [2023-12-16 16:17:57,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:17:57,603 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 65 treesize of output 75 [2023-12-16 16:17:57,659 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 7 [2023-12-16 16:17:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-16 16:17:57,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:17:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:17:57,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:57,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679983071] [2023-12-16 16:17:57,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679983071] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:17:57,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:17:57,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 16:17:57,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827627630] [2023-12-16 16:17:57,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:17:57,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:17:57,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:57,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:17:57,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=29, Unknown=2, NotChecked=10, Total=56 [2023-12-16 16:17:57,783 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:58,775 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2023-12-16 16:17:58,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:17:58,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-16 16:17:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:58,776 INFO L225 Difference]: With dead ends: 57 [2023-12-16 16:17:58,776 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 16:17:58,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=59, Unknown=3, NotChecked=16, Total=110 [2023-12-16 16:17:58,777 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:58,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 52 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 29 Unchecked, 0.8s Time] [2023-12-16 16:17:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 16:17:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-16 16:17:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-12-16 16:17:58,785 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2023-12-16 16:17:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:58,785 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-12-16 16:17:58,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-12-16 16:17:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 16:17:58,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:58,786 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:17:58,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-16 16:17:58,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:17:58,990 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-16 16:17:58,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1823028385, now seen corresponding path program 1 times [2023-12-16 16:17:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:58,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857636778] [2023-12-16 16:17:58,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:58,991 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:17:58,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:58,992 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:17:58,993 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:17:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:17:59,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:17:59,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:17:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 16:17:59,118 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:17:59,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:17:59,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857636778] [2023-12-16 16:17:59,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857636778] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:17:59,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:17:59,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:17:59,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874801805] [2023-12-16 16:17:59,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:17:59,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:17:59,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:17:59,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:17:59,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:17:59,119 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:17:59,600 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2023-12-16 16:17:59,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:17:59,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-16 16:17:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:17:59,600 INFO L225 Difference]: With dead ends: 50 [2023-12-16 16:17:59,601 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 16:17:59,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:17:59,601 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:17:59,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 16:17:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 16:17:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2023-12-16 16:17:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-16 16:17:59,608 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2023-12-16 16:17:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:17:59,608 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-16 16:17:59,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:17:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-16 16:17:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 16:17:59,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:17:59,609 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:17:59,615 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:17:59,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:17:59,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-16 16:17:59,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:17:59,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1096237867, now seen corresponding path program 1 times [2023-12-16 16:17:59,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:17:59,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506743737] [2023-12-16 16:17:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:17:59,813 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:17:59,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:17:59,814 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:17:59,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:18:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:18:00,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-16 16:18:00,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:18:00,047 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-16 16:18:00,048 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-12-16 16:18:00,105 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-16 16:18:00,120 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-16 16:18:00,120 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 16 treesize of output 15 [2023-12-16 16:18:00,128 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 5 treesize of output 3 [2023-12-16 16:18:00,162 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-16 16:18:00,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-16 16:18:00,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 treesize of output 16 [2023-12-16 16:18:00,193 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 16 treesize of output 11 [2023-12-16 16:18:00,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:18:00,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2023-12-16 16:18:00,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2023-12-16 16:18:00,321 INFO L349 Elim1Store]: treesize reduction 82, result has 5.7 percent of original size [2023-12-16 16:18:00,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 3 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 105 [2023-12-16 16:18:00,350 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2023-12-16 16:18:00,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 51 [2023-12-16 16:18:00,370 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 14 treesize of output 8 [2023-12-16 16:18:00,711 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 60 treesize of output 44 [2023-12-16 16:18:00,809 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-16 16:18:00,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 27 [2023-12-16 16:18:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:18:00,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:18:01,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:01,051 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 40 treesize of output 41 [2023-12-16 16:18:01,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:01,136 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 65 [2023-12-16 16:18:01,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:01,149 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2023-12-16 16:18:01,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:01,295 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 2044 treesize of output 1629 [2023-12-16 16:18:01,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:01,385 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 2758 treesize of output 2173 [2023-12-16 16:18:01,470 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 1365 treesize of output 1343 [2023-12-16 16:18:01,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:01,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1376 treesize of output 1246 [2023-12-16 16:18:01,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:18:01,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 935 treesize of output 905 [2023-12-16 16:18:01,904 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 395 treesize of output 357 Received shutdown request... [2023-12-16 16:18:46,313 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:18:46,333 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-12-16 16:18:46,336 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 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:18:46,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:18:46,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:46,540 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-23-3-4-7-5-7-4-6-3-5-3-5-3-3-2-3-3-2-1 context. [2023-12-16 16:18:46,542 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-12-16 16:18:46,542 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-12-16 16:18:46,542 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-12-16 16:18:46,545 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:18:46,547 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:18:46,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:18:46 BoogieIcfgContainer [2023-12-16 16:18:46,550 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:18:46,551 INFO L158 Benchmark]: Toolchain (without parser) took 69240.86ms. Allocated memory was 270.5MB in the beginning and 676.3MB in the end (delta: 405.8MB). Free memory was 217.4MB in the beginning and 385.9MB in the end (delta: -168.5MB). Peak memory consumption was 398.4MB. Max. memory is 8.0GB. [2023-12-16 16:18:46,551 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 194.0MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:18:46,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.25ms. Allocated memory is still 270.5MB. Free memory was 216.9MB in the beginning and 197.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 16:18:46,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.92ms. Allocated memory is still 270.5MB. Free memory was 197.5MB in the beginning and 194.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:18:46,552 INFO L158 Benchmark]: Boogie Preprocessor took 54.47ms. Allocated memory is still 270.5MB. Free memory was 194.9MB in the beginning and 192.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:18:46,552 INFO L158 Benchmark]: RCFGBuilder took 802.20ms. Allocated memory is still 270.5MB. Free memory was 192.3MB in the beginning and 172.9MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-16 16:18:46,552 INFO L158 Benchmark]: TraceAbstraction took 67916.81ms. Allocated memory was 270.5MB in the beginning and 676.3MB in the end (delta: 405.8MB). Free memory was 171.8MB in the beginning and 385.9MB in the end (delta: -214.1MB). Peak memory consumption was 352.3MB. Max. memory is 8.0GB. [2023-12-16 16:18:46,553 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.18ms. Allocated memory is still 194.0MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 397.25ms. Allocated memory is still 270.5MB. Free memory was 216.9MB in the beginning and 197.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.92ms. Allocated memory is still 270.5MB. Free memory was 197.5MB in the beginning and 194.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.47ms. Allocated memory is still 270.5MB. Free memory was 194.9MB in the beginning and 192.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 802.20ms. Allocated memory is still 270.5MB. Free memory was 192.3MB in the beginning and 172.9MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 67916.81ms. Allocated memory was 270.5MB in the beginning and 676.3MB in the end (delta: 405.8MB). Free memory was 171.8MB in the beginning and 385.9MB in the end (delta: -214.1MB). Peak memory consumption was 352.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: 1049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1049). Cancelled while NwaCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-23-3-4-7-5-7-4-6-3-5-3-5-3-3-2-3-3-2-1 context. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1041). Cancelled while NwaCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-23-3-4-7-5-7-4-6-3-5-3-5-3-3-2-3-3-2-1 context. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1042). Cancelled while NwaCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-23-3-4-7-5-7-4-6-3-5-3-5-3-3-2-3-3-2-1 context. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1050). Cancelled while NwaCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-23-3-4-7-5-7-4-6-3-5-3-5-3-3-2-3-3-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 67.9s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 494 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 290 IncrementalHoareTripleChecker+Unchecked, 344 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 355 IncrementalHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 150 mSDtfsCounter, 355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 102 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 124 ConstructedInterpolants, 22 QuantifiedInterpolants, 2072 SizeOfPredicates, 36 NumberOfNonLiveVariables, 788 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 4/24 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