/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/verifythis/duplets.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:55:57,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:55:58,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:55:58,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:55:58,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:55:58,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:55:58,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:55:58,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:55:58,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:55:58,054 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:55:58,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:55:58,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:55:58,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:55:58,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:55:58,055 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:55:58,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:55:58,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:55:58,056 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:55:58,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:55:58,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:55:58,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:55:58,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:55:58,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:55:58,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:55:58,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:55:58,058 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:55:58,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:55:58,058 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:55:58,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:55:58,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:55:58,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:55:58,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:55:58,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:55:58,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:55:58,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:55:58,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:55:58,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:55:58,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:55:58,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:55:58,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:55:58,061 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:55:58,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:55:58,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:55:58,061 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:55:58,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:55:58,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:55:58,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:55:58,270 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:55:58,273 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:55:58,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/duplets.c [2023-12-16 04:55:59,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:55:59,380 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:55:59,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c [2023-12-16 04:55:59,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf554b89/0c6953ece45249f4a0465577a80e6947/FLAG50252f62f [2023-12-16 04:55:59,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf554b89/0c6953ece45249f4a0465577a80e6947 [2023-12-16 04:55:59,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:55:59,401 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:55:59,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:55:59,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:55:59,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:55:59,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:55:59" (1/1) ... [2023-12-16 04:55:59,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1e8380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59, skipping insertion in model container [2023-12-16 04:55:59,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:55:59" (1/1) ... [2023-12-16 04:55:59,428 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:55:59,542 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2023-12-16 04:55:59,561 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:55:59,573 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:55:59,580 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2023-12-16 04:55:59,588 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:55:59,599 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:55:59,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59 WrapperNode [2023-12-16 04:55:59,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:55:59,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:55:59,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:55:59,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:55:59,605 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:55:59" (1/1) ... [2023-12-16 04:55:59,611 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:55:59" (1/1) ... [2023-12-16 04:55:59,625 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-12-16 04:55:59,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:55:59,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:55:59,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:55:59,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:55:59,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59" (1/1) ... [2023-12-16 04:55:59,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59" (1/1) ... [2023-12-16 04:55:59,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59" (1/1) ... [2023-12-16 04:55:59,664 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 7, 5, 5]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 3, 1, 1]. [2023-12-16 04:55:59,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59" (1/1) ... [2023-12-16 04:55:59,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59" (1/1) ... [2023-12-16 04:55:59,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59" (1/1) ... [2023-12-16 04:55:59,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59" (1/1) ... [2023-12-16 04:55:59,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59" (1/1) ... [2023-12-16 04:55:59,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59" (1/1) ... [2023-12-16 04:55:59,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:55:59,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:55:59,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:55:59,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:55:59,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59" (1/1) ... [2023-12-16 04:55:59,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:55:59,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:55:59,706 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 04:55:59,708 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 04:55:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:55:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:55:59,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:55:59,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:55:59,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:55:59,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:55:59,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:55:59,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 04:55:59,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:55:59,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:55:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:55:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:55:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 04:55:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:55:59,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:55:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:55:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:55:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:55:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:55:59,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 04:55:59,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 04:55:59,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 04:55:59,802 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:55:59,803 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:55:59,950 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:55:59,993 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:55:59,993 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 04:55:59,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:55:59 BoogieIcfgContainer [2023-12-16 04:55:59,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:55:59,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:55:59,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:55:59,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:55:59,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:55:59" (1/3) ... [2023-12-16 04:55:59,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfc115d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:55:59, skipping insertion in model container [2023-12-16 04:55:59,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:55:59" (2/3) ... [2023-12-16 04:55:59,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfc115d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:55:59, skipping insertion in model container [2023-12-16 04:55:59,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:55:59" (3/3) ... [2023-12-16 04:56:00,000 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2023-12-16 04:56:00,014 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:56:00,014 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:56:00,062 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:56:00,067 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;@24d67d51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:56:00,068 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:56:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 04:56:00,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 04:56:00,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:00,078 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:00,078 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:00,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:00,083 INFO L85 PathProgramCache]: Analyzing trace with hash -412634609, now seen corresponding path program 1 times [2023-12-16 04:56:00,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:00,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403731247] [2023-12-16 04:56:00,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:00,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:00,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:00,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:00,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:00,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 04:56:00,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403731247] [2023-12-16 04:56:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403731247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:56:00,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:56:00,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:56:00,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22201258] [2023-12-16 04:56:00,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:56:00,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:56:00,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:00,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:56:00,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:56:00,278 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 04:56:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:00,304 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2023-12-16 04:56:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:56:00,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2023-12-16 04:56:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:00,311 INFO L225 Difference]: With dead ends: 71 [2023-12-16 04:56:00,311 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 04:56:00,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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 04:56:00,316 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:00,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:56:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 04:56:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-16 04:56:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 04:56:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2023-12-16 04:56:00,345 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 31 [2023-12-16 04:56:00,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:00,345 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2023-12-16 04:56:00,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 04:56:00,345 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2023-12-16 04:56:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 04:56:00,347 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:00,347 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:00,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:56:00,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:00,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1613291475, now seen corresponding path program 1 times [2023-12-16 04:56:00,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:00,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463397630] [2023-12-16 04:56:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:00,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:00,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:00,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:00,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:00,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:56:00,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:00,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463397630] [2023-12-16 04:56:00,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463397630] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:56:00,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049463605] [2023-12-16 04:56:00,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:00,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:00,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:56:00,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:56:00,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:56:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:00,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 04:56:00,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:56:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:56:00,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:56:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:56:01,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049463605] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:56:01,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:56:01,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-12-16 04:56:01,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610373543] [2023-12-16 04:56:01,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:56:01,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:56:01,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:01,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:56:01,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:56:01,052 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-16 04:56:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:01,164 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2023-12-16 04:56:01,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:56:01,165 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 31 [2023-12-16 04:56:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:01,166 INFO L225 Difference]: With dead ends: 60 [2023-12-16 04:56:01,166 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 04:56:01,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:56:01,167 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 70 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:01,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 128 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:56:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 04:56:01,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2023-12-16 04:56:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 04:56:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2023-12-16 04:56:01,182 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 31 [2023-12-16 04:56:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:01,183 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2023-12-16 04:56:01,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-16 04:56:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2023-12-16 04:56:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 04:56:01,184 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:01,184 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:01,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:56:01,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:01,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:01,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1089485891, now seen corresponding path program 1 times [2023-12-16 04:56:01,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:01,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027916850] [2023-12-16 04:56:01,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:01,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:01,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:01,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 04:56:01,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:01,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027916850] [2023-12-16 04:56:01,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027916850] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:56:01,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:56:01,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:56:01,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460446451] [2023-12-16 04:56:01,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:56:01,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:56:01,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:01,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:56:01,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:56:01,467 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-16 04:56:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:01,529 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-12-16 04:56:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:56:01,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2023-12-16 04:56:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:01,532 INFO L225 Difference]: With dead ends: 54 [2023-12-16 04:56:01,532 INFO L226 Difference]: Without dead ends: 52 [2023-12-16 04:56:01,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:56:01,534 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:01,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 226 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:56:01,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-16 04:56:01,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2023-12-16 04:56:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 04:56:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2023-12-16 04:56:01,549 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 32 [2023-12-16 04:56:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:01,549 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2023-12-16 04:56:01,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-16 04:56:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2023-12-16 04:56:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 04:56:01,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:01,554 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:01,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:56:01,554 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:01,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:01,555 INFO L85 PathProgramCache]: Analyzing trace with hash -131858816, now seen corresponding path program 1 times [2023-12-16 04:56:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:01,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965656635] [2023-12-16 04:56:01,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:01,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:01,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:01,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:56:02,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:02,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965656635] [2023-12-16 04:56:02,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965656635] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:56:02,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:56:02,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:56:02,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679125764] [2023-12-16 04:56:02,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:56:02,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:56:02,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:02,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:56:02,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:56:02,027 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 10 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 04:56:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:02,182 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2023-12-16 04:56:02,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:56:02,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2023-12-16 04:56:02,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:02,184 INFO L225 Difference]: With dead ends: 76 [2023-12-16 04:56:02,184 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 04:56:02,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:56:02,185 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:02,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 239 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:56:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 04:56:02,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2023-12-16 04:56:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 04:56:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2023-12-16 04:56:02,191 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 34 [2023-12-16 04:56:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:02,191 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2023-12-16 04:56:02,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 04:56:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2023-12-16 04:56:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 04:56:02,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:02,192 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:02,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:56:02,193 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:02,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:02,193 INFO L85 PathProgramCache]: Analyzing trace with hash -839024780, now seen corresponding path program 1 times [2023-12-16 04:56:02,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:02,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174238292] [2023-12-16 04:56:02,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:02,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 04:56:02,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:02,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174238292] [2023-12-16 04:56:02,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174238292] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:56:02,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495744334] [2023-12-16 04:56:02,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:02,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:02,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:56:02,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:56:02,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:56:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 04:56:02,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:56:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 04:56:02,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:56:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 04:56:02,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495744334] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:56:02,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:56:02,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-12-16 04:56:02,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718351138] [2023-12-16 04:56:02,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:56:02,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:56:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:02,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:56:02,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:56:02,360 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-16 04:56:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:02,403 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-12-16 04:56:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:56:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2023-12-16 04:56:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:02,405 INFO L225 Difference]: With dead ends: 65 [2023-12-16 04:56:02,405 INFO L226 Difference]: Without dead ends: 46 [2023-12-16 04:56:02,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:56:02,405 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:02,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 147 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:56:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-16 04:56:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-16 04:56:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 04:56:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2023-12-16 04:56:02,413 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 36 [2023-12-16 04:56:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:02,414 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2023-12-16 04:56:02,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-16 04:56:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2023-12-16 04:56:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 04:56:02,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:02,417 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:02,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:56:02,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:02,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:02,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:02,625 INFO L85 PathProgramCache]: Analyzing trace with hash 156316756, now seen corresponding path program 1 times [2023-12-16 04:56:02,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:02,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834892412] [2023-12-16 04:56:02,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-16 04:56:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 04:56:02,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:02,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834892412] [2023-12-16 04:56:02,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834892412] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:56:02,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:56:02,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:56:02,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957724401] [2023-12-16 04:56:02,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:56:02,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:56:02,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:02,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:56:02,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:56:02,842 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 04:56:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:02,998 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2023-12-16 04:56:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:56:02,999 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2023-12-16 04:56:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:02,999 INFO L225 Difference]: With dead ends: 79 [2023-12-16 04:56:03,000 INFO L226 Difference]: Without dead ends: 65 [2023-12-16 04:56:03,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:56:03,000 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:03,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 229 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:56:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-16 04:56:03,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2023-12-16 04:56:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:56:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2023-12-16 04:56:03,007 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 39 [2023-12-16 04:56:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:03,007 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2023-12-16 04:56:03,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 04:56:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2023-12-16 04:56:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 04:56:03,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:03,008 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:03,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:56:03,008 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:03,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash 308293439, now seen corresponding path program 2 times [2023-12-16 04:56:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:03,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049525459] [2023-12-16 04:56:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:03,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:03,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:03,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 04:56:03,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:03,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049525459] [2023-12-16 04:56:03,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049525459] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:56:03,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239015836] [2023-12-16 04:56:03,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:56:03,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:03,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:56:03,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:56:03,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:56:03,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:56:03,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:56:03,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-16 04:56:03,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:56:03,962 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-12-16 04:56:03,962 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 1 case distinctions, treesize of input 38 treesize of output 19 [2023-12-16 04:56:04,124 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-12-16 04:56:04,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 46 [2023-12-16 04:56:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 04:56:04,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:56:04,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:56:04,392 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 515 treesize of output 447 [2023-12-16 04:56:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 04:56:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239015836] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:56:06,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:56:06,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2023-12-16 04:56:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390625603] [2023-12-16 04:56:06,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:56:06,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-16 04:56:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:06,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-16 04:56:06,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2023-12-16 04:56:06,289 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand has 29 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 04:56:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:06,809 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2023-12-16 04:56:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:56:06,809 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 39 [2023-12-16 04:56:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:06,810 INFO L225 Difference]: With dead ends: 95 [2023-12-16 04:56:06,810 INFO L226 Difference]: Without dead ends: 63 [2023-12-16 04:56:06,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2023-12-16 04:56:06,811 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 36 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:06,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 622 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:56:06,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-16 04:56:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2023-12-16 04:56:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 45 states have internal predecessors, (53), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:56:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2023-12-16 04:56:06,818 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 39 [2023-12-16 04:56:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:06,818 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2023-12-16 04:56:06,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 04:56:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2023-12-16 04:56:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 04:56:06,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:06,819 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:06,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:56:07,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:07,028 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:07,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:07,029 INFO L85 PathProgramCache]: Analyzing trace with hash 148186827, now seen corresponding path program 3 times [2023-12-16 04:56:07,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:07,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735536391] [2023-12-16 04:56:07,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:07,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:07,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:07,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:07,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:07,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 04:56:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735536391] [2023-12-16 04:56:07,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735536391] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:56:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176027467] [2023-12-16 04:56:07,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 04:56:07,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:07,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:56:07,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:56:07,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:56:07,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 04:56:07,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:56:07,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 04:56:07,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:56:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 04:56:07,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:56:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 04:56:07,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176027467] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:56:07,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:56:07,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2023-12-16 04:56:07,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333038619] [2023-12-16 04:56:07,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:56:07,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:56:07,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:07,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:56:07,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:56:07,228 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-16 04:56:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:07,297 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2023-12-16 04:56:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:56:07,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2023-12-16 04:56:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:07,298 INFO L225 Difference]: With dead ends: 98 [2023-12-16 04:56:07,298 INFO L226 Difference]: Without dead ends: 66 [2023-12-16 04:56:07,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:56:07,299 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:07,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 220 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:56:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-16 04:56:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2023-12-16 04:56:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:56:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2023-12-16 04:56:07,306 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 41 [2023-12-16 04:56:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:07,306 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2023-12-16 04:56:07,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-16 04:56:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2023-12-16 04:56:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 04:56:07,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:07,326 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:07,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 04:56:07,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:07,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:07,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1774053533, now seen corresponding path program 1 times [2023-12-16 04:56:07,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:07,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825497434] [2023-12-16 04:56:07,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:07,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:07,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:07,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:07,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:07,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:07,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-16 04:56:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:07,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:56:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 04:56:07,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:07,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825497434] [2023-12-16 04:56:07,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825497434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:56:07,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:56:07,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:56:07,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962327460] [2023-12-16 04:56:07,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:56:07,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:56:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:56:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:56:07,752 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 04:56:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:07,884 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2023-12-16 04:56:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:56:07,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2023-12-16 04:56:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:07,885 INFO L225 Difference]: With dead ends: 82 [2023-12-16 04:56:07,886 INFO L226 Difference]: Without dead ends: 80 [2023-12-16 04:56:07,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:56:07,886 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:07,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 211 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:56:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-16 04:56:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2023-12-16 04:56:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 57 states have internal predecessors, (69), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 04:56:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2023-12-16 04:56:07,898 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 46 [2023-12-16 04:56:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:07,898 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2023-12-16 04:56:07,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 04:56:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2023-12-16 04:56:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 04:56:07,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:07,899 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:07,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:56:07,899 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:07,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1772206491, now seen corresponding path program 1 times [2023-12-16 04:56:07,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:07,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453864565] [2023-12-16 04:56:07,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:07,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-16 04:56:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:56:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 04:56:08,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:08,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453864565] [2023-12-16 04:56:08,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453864565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:56:08,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:56:08,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:56:08,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946229012] [2023-12-16 04:56:08,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:56:08,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:56:08,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:08,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:56:08,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:56:08,040 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 04:56:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:08,124 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2023-12-16 04:56:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:56:08,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2023-12-16 04:56:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:08,125 INFO L225 Difference]: With dead ends: 93 [2023-12-16 04:56:08,126 INFO L226 Difference]: Without dead ends: 82 [2023-12-16 04:56:08,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:56:08,136 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:08,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 153 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:56:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-16 04:56:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2023-12-16 04:56:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 58 states have internal predecessors, (71), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 04:56:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2023-12-16 04:56:08,144 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 46 [2023-12-16 04:56:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:08,144 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2023-12-16 04:56:08,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 04:56:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2023-12-16 04:56:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 04:56:08,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:08,145 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:08,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:56:08,145 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:08,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2129362199, now seen corresponding path program 1 times [2023-12-16 04:56:08,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:08,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573448554] [2023-12-16 04:56:08,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:08,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:56:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-16 04:56:08,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:08,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573448554] [2023-12-16 04:56:08,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573448554] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:56:08,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9613963] [2023-12-16 04:56:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:08,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:08,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:56:08,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:56:08,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:56:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:08,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-16 04:56:08,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:56:08,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 04:56:08,600 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 17 treesize of output 9 [2023-12-16 04:56:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 04:56:08,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:56:08,692 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 28 treesize of output 24 [2023-12-16 04:56:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 04:56:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9613963] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:56:08,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:56:08,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 14] total 28 [2023-12-16 04:56:08,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876442549] [2023-12-16 04:56:08,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:56:08,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-16 04:56:08,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:08,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-16 04:56:08,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2023-12-16 04:56:08,812 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 28 states, 25 states have (on average 2.36) internal successors, (59), 27 states have internal predecessors, (59), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-16 04:56:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:09,257 INFO L93 Difference]: Finished difference Result 91 states and 116 transitions. [2023-12-16 04:56:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 04:56:09,258 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.36) internal successors, (59), 27 states have internal predecessors, (59), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2023-12-16 04:56:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:09,258 INFO L225 Difference]: With dead ends: 91 [2023-12-16 04:56:09,258 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 04:56:09,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=288, Invalid=1434, Unknown=0, NotChecked=0, Total=1722 [2023-12-16 04:56:09,259 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 78 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:09,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 364 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:56:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 04:56:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2023-12-16 04:56:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 63 states have internal predecessors, (74), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:56:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2023-12-16 04:56:09,270 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 46 [2023-12-16 04:56:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:09,270 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2023-12-16 04:56:09,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.36) internal successors, (59), 27 states have internal predecessors, (59), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-16 04:56:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2023-12-16 04:56:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 04:56:09,271 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:09,271 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:09,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 04:56:09,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-16 04:56:09,478 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:09,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2127515157, now seen corresponding path program 1 times [2023-12-16 04:56:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:09,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624772942] [2023-12-16 04:56:09,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:09,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:09,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:09,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:09,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:09,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:56:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 04:56:09,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624772942] [2023-12-16 04:56:09,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624772942] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:56:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240928073] [2023-12-16 04:56:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:09,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:09,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:56:09,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:56:09,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 04:56:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:09,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 04:56:09,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:56:09,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 04:56:09,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:56:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 04:56:09,775 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:56:09,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240928073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:56:09,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:56:09,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 10 [2023-12-16 04:56:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742401068] [2023-12-16 04:56:09,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:56:09,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:56:09,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:09,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:56:09,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:56:09,777 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 04:56:13,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:56:17,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:56:21,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:56:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:21,877 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2023-12-16 04:56:21,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:56:21,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2023-12-16 04:56:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:21,878 INFO L225 Difference]: With dead ends: 125 [2023-12-16 04:56:21,878 INFO L226 Difference]: Without dead ends: 106 [2023-12-16 04:56:21,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:56:21,878 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:21,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 184 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2023-12-16 04:56:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-16 04:56:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2023-12-16 04:56:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 78 states have internal predecessors, (88), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:56:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2023-12-16 04:56:21,887 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 46 [2023-12-16 04:56:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:21,888 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2023-12-16 04:56:21,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 04:56:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2023-12-16 04:56:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 04:56:21,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:21,889 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:21,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 04:56:22,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:22,094 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:22,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1977385516, now seen corresponding path program 4 times [2023-12-16 04:56:22,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:22,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718649199] [2023-12-16 04:56:22,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:22,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:23,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:23,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:23,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-16 04:56:23,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:23,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718649199] [2023-12-16 04:56:23,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718649199] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:56:23,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429629417] [2023-12-16 04:56:23,322 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 04:56:23,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:23,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:56:23,323 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:56:23,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-16 04:56:23,406 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 04:56:23,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:56:23,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-16 04:56:23,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:56:23,418 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 7 treesize of output 6 [2023-12-16 04:56:23,746 INFO L349 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2023-12-16 04:56:23,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 45 [2023-12-16 04:56:24,477 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 67 treesize of output 49 [2023-12-16 04:56:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:56:26,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:56:26,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429629417] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:56:26,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:56:26,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 29 [2023-12-16 04:56:26,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530179371] [2023-12-16 04:56:26,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:56:26,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-16 04:56:26,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:26,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-16 04:56:26,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1354, Unknown=2, NotChecked=0, Total=1560 [2023-12-16 04:56:26,817 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand has 29 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-16 04:56:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:27,619 INFO L93 Difference]: Finished difference Result 161 states and 189 transitions. [2023-12-16 04:56:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 04:56:27,620 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 46 [2023-12-16 04:56:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:27,621 INFO L225 Difference]: With dead ends: 161 [2023-12-16 04:56:27,621 INFO L226 Difference]: Without dead ends: 96 [2023-12-16 04:56:27,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=297, Invalid=1957, Unknown=2, NotChecked=0, Total=2256 [2023-12-16 04:56:27,622 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:27,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 541 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:56:27,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-16 04:56:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2023-12-16 04:56:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 04:56:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2023-12-16 04:56:27,630 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 46 [2023-12-16 04:56:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:27,630 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2023-12-16 04:56:27,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-16 04:56:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2023-12-16 04:56:27,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-16 04:56:27,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:27,630 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:27,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-16 04:56:27,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:27,837 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:27,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash -438507442, now seen corresponding path program 1 times [2023-12-16 04:56:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:27,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388516283] [2023-12-16 04:56:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-16 04:56:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:56:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:56:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-16 04:56:28,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:28,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388516283] [2023-12-16 04:56:28,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388516283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:56:28,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:56:28,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:56:28,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331443892] [2023-12-16 04:56:28,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:56:28,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:56:28,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:28,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:56:28,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:56:28,023 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 04:56:28,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:28,122 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-12-16 04:56:28,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:56:28,123 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2023-12-16 04:56:28,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:28,123 INFO L225 Difference]: With dead ends: 91 [2023-12-16 04:56:28,123 INFO L226 Difference]: Without dead ends: 87 [2023-12-16 04:56:28,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:56:28,124 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:28,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 155 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:56:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-16 04:56:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-12-16 04:56:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.098360655737705) internal successors, (67), 63 states have internal predecessors, (67), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 04:56:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2023-12-16 04:56:28,131 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 52 [2023-12-16 04:56:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:28,131 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2023-12-16 04:56:28,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 04:56:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2023-12-16 04:56:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 04:56:28,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:28,132 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:28,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:56:28,132 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:28,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2130073136, now seen corresponding path program 1 times [2023-12-16 04:56:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:28,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189378408] [2023-12-16 04:56:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:28,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:56:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:56:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-16 04:56:28,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:28,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189378408] [2023-12-16 04:56:28,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189378408] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:56:28,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453588800] [2023-12-16 04:56:28,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:28,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:28,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:56:28,247 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:56:28,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-16 04:56:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:28,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 04:56:28,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:56:28,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 04:56:28,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:56:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-16 04:56:28,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:56:28,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-12-16 04:56:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-16 04:56:28,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453588800] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:56:28,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:56:28,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2023-12-16 04:56:28,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371358347] [2023-12-16 04:56:28,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:56:28,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 04:56:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:28,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 04:56:28,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:56:28,632 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-16 04:56:32,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:56:36,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:56:40,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:56:40,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:40,806 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2023-12-16 04:56:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 04:56:40,807 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 53 [2023-12-16 04:56:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:40,807 INFO L225 Difference]: With dead ends: 99 [2023-12-16 04:56:40,807 INFO L226 Difference]: Without dead ends: 88 [2023-12-16 04:56:40,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-12-16 04:56:40,808 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:40,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 207 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2023-12-16 04:56:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-16 04:56:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2023-12-16 04:56:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 62 states have internal predecessors, (66), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:56:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-12-16 04:56:40,815 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 53 [2023-12-16 04:56:40,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:40,815 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-12-16 04:56:40,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-16 04:56:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-12-16 04:56:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-16 04:56:40,815 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:40,815 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:40,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-16 04:56:41,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-16 04:56:41,020 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:41,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:41,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1023075831, now seen corresponding path program 1 times [2023-12-16 04:56:41,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:41,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327851825] [2023-12-16 04:56:41,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:41,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-16 04:56:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:56:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:56:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-16 04:56:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-16 04:56:41,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:41,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327851825] [2023-12-16 04:56:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327851825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:56:41,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:56:41,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:56:41,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359119411] [2023-12-16 04:56:41,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:56:41,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:56:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:41,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:56:41,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:56:41,368 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-16 04:56:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:41,505 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2023-12-16 04:56:41,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:56:41,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2023-12-16 04:56:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:41,506 INFO L225 Difference]: With dead ends: 88 [2023-12-16 04:56:41,507 INFO L226 Difference]: Without dead ends: 56 [2023-12-16 04:56:41,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:56:41,507 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:41,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 148 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:56:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-16 04:56:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-16 04:56:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 04:56:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2023-12-16 04:56:41,514 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 58 [2023-12-16 04:56:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:41,514 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2023-12-16 04:56:41,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-16 04:56:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2023-12-16 04:56:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 04:56:41,515 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:41,515 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:41,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 04:56:41,515 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:41,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1820242905, now seen corresponding path program 1 times [2023-12-16 04:56:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:41,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240810171] [2023-12-16 04:56:41,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:56:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:56:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-16 04:56:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-16 04:56:41,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:41,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240810171] [2023-12-16 04:56:41,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240810171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:56:41,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:56:41,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:56:41,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032482234] [2023-12-16 04:56:41,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:56:41,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:56:41,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:41,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:56:41,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:56:41,739 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 04:56:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:41,830 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2023-12-16 04:56:41,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:56:41,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-12-16 04:56:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:41,832 INFO L225 Difference]: With dead ends: 62 [2023-12-16 04:56:41,832 INFO L226 Difference]: Without dead ends: 58 [2023-12-16 04:56:41,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:56:41,832 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:41,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 148 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:56:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-16 04:56:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-12-16 04:56:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 04:56:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2023-12-16 04:56:41,838 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 59 [2023-12-16 04:56:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:41,838 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2023-12-16 04:56:41,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 04:56:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2023-12-16 04:56:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-16 04:56:41,841 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:56:41,842 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:41,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 04:56:41,842 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:56:41,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:56:41,843 INFO L85 PathProgramCache]: Analyzing trace with hash -790979262, now seen corresponding path program 1 times [2023-12-16 04:56:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:56:41,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166528817] [2023-12-16 04:56:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:56:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:42,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:56:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:42,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:56:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:42,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:56:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:42,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:56:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:42,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:56:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:42,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 04:56:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:42,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-16 04:56:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:42,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-16 04:56:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-16 04:56:42,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:56:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166528817] [2023-12-16 04:56:42,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166528817] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:56:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744933168] [2023-12-16 04:56:42,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:56:42,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:56:42,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:56:42,305 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:56:42,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-16 04:56:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:56:42,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-16 04:56:42,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:56:42,420 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 7 treesize of output 6 [2023-12-16 04:56:42,623 INFO L349 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2023-12-16 04:56:42,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 45 [2023-12-16 04:56:43,435 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 04:56:43,440 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 04:56:44,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:56:44,592 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 117 treesize of output 93 [2023-12-16 04:56:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-16 04:56:44,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:56:44,852 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 84 treesize of output 80 [2023-12-16 04:56:44,857 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 138 treesize of output 130 [2023-12-16 04:56:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-16 04:56:47,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744933168] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:56:47,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:56:47,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25, 19] total 46 [2023-12-16 04:56:47,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220948111] [2023-12-16 04:56:47,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:56:47,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-16 04:56:47,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:56:47,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-16 04:56:47,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1790, Unknown=0, NotChecked=0, Total=2070 [2023-12-16 04:56:47,660 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 46 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 43 states have internal predecessors, (85), 10 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2023-12-16 04:56:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:56:49,134 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2023-12-16 04:56:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-16 04:56:49,134 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 43 states have internal predecessors, (85), 10 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) Word has length 65 [2023-12-16 04:56:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:56:49,134 INFO L225 Difference]: With dead ends: 62 [2023-12-16 04:56:49,135 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 04:56:49,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 106 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=467, Invalid=2955, Unknown=0, NotChecked=0, Total=3422 [2023-12-16 04:56:49,136 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 47 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 04:56:49,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 221 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 04:56:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 04:56:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 04:56:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 04:56:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 04:56:49,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2023-12-16 04:56:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:56:49,137 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 04:56:49,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 43 states have internal predecessors, (85), 10 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2023-12-16 04:56:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 04:56:49,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 04:56:49,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:56:49,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-16 04:56:49,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-16 04:56:49,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 04:56:54,423 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-12-16 04:56:54,423 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2023-12-16 04:56:54,424 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 17) the Hoare annotation is: true [2023-12-16 04:56:54,424 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2023-12-16 04:56:54,424 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-12-16 04:56:54,424 INFO L895 garLoopResultBuilder]: At program point L60-2(line 60) the Hoare annotation is: (let ((.cse5 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select (select |#memory_int#2| |ULTIMATE.start_main_~#i~2#1.base|) 0)) (.cse1 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_finddup_#res#1| 1)) (.cse8 (select |#memory_int#3| |ULTIMATE.start_main_~#j~2#1.base|)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 1)) (.cse4 (select .cse5 0)) (.cse7 (= |ULTIMATE.start_main_~#i~2#1.offset| 0))) (or (let ((.cse3 (select .cse8 |ULTIMATE.start_main_~#j~2#1.offset|))) (and (= 0 .cse0) .cse1 .cse2 (<= 1 .cse3) |ULTIMATE.start_main_#t~short19#1| (<= (+ .cse3 1) |ULTIMATE.start_main_~n~0#1|) (= .cse4 (select .cse5 (* .cse3 4))) .cse6 .cse7)) (let ((.cse9 (select .cse5 8))) (and (= 1 .cse0) (= (select .cse5 4) .cse9) .cse1 .cse2 (<= 3 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_#t~short19#1| (= (select .cse8 0) 2) .cse6 (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_27| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_25| Int)) (and (= .cse5 (let ((.cse11 (* |v_ULTIMATE.start_mkdup_~j~0#1_27| 4))) (let ((.cse10 (select .cse5 .cse11))) (store (store ((as const (Array Int Int)) 0) (* |v_ULTIMATE.start_mkdup_~i~0#1_25| 4) .cse10) .cse11 .cse10)))) (<= |v_ULTIMATE.start_mkdup_~j~0#1_27| 2) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_27|))) (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (not (= .cse9 .cse4)) .cse7))))) [2023-12-16 04:56:54,424 INFO L899 garLoopResultBuilder]: For program point L60-3(line 60) no Hoare annotation was computed. [2023-12-16 04:56:54,424 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_~a#1.base|) (= ((as const (Array Int Int)) 0) (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|)) (= |ULTIMATE.start_mkdup_~a#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_mkdup_~n#1|)) [2023-12-16 04:56:54,424 INFO L895 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_mkdup_~i~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_~a#1.base|) (= ((as const (Array Int Int)) 0) (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|)) (= |ULTIMATE.start_mkdup_~a#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_mkdup_~n#1|) (<= (+ |ULTIMATE.start_mkdup_~i~0#1| 1) |ULTIMATE.start_mkdup_~n#1|)) [2023-12-16 04:56:54,424 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 36 44) no Hoare annotation was computed. [2023-12-16 04:56:54,424 INFO L895 garLoopResultBuilder]: At program point L36-3(lines 36 44) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (<= |ULTIMATE.start_finddup_~n#1| |ULTIMATE.start_main_~n~0#1|)) (.cse7 ((as const (Array Int Int)) 0)) (.cse5 (select |#memory_int#1| |ULTIMATE.start_finddup_~a#1.base|)) (.cse2 (= |ULTIMATE.start_finddup_~_i#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~#i~2#1.base| |ULTIMATE.start_finddup_~_i#1.base|)) (.cse10 (= |ULTIMATE.start_main_~#j~2#1.offset| 0)) (.cse11 (= |ULTIMATE.start_finddup_~_j#1.offset| 0)) (.cse12 (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_finddup_~a#1.base|)) (.cse13 (= |ULTIMATE.start_finddup_~a#1.offset| 0)) (.cse14 (= |ULTIMATE.start_main_~#j~2#1.base| |ULTIMATE.start_finddup_~_j#1.base|)) (.cse15 (= |ULTIMATE.start_main_~#i~2#1.offset| 0))) (or (let ((.cse4 (select .cse5 8))) (and (<= 2 |ULTIMATE.start_finddup_~j~1#1|) .cse0 .cse1 .cse2 .cse3 (not (= .cse4 (select .cse5 0))) (<= 3 |ULTIMATE.start_finddup_~n#1|) (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_27| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_25| Int)) (and (let ((.cse6 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|))) (= .cse6 (let ((.cse9 (* |v_ULTIMATE.start_mkdup_~j~0#1_27| 4))) (let ((.cse8 (select .cse6 .cse9))) (store (store .cse7 (* |v_ULTIMATE.start_mkdup_~i~0#1_25| 4) .cse8) .cse9 .cse8))))) (<= |v_ULTIMATE.start_mkdup_~j~0#1_27| 2) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_27|))) (= .cse4 (select .cse5 4)) (= |ULTIMATE.start_finddup_~i~1#1| 1) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_24| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_22| Int)) (and (= (let ((.cse17 (* |v_ULTIMATE.start_mkdup_~j~0#1_24| 4))) (let ((.cse16 (select .cse5 .cse17))) (store (store .cse7 (* |v_ULTIMATE.start_mkdup_~i~0#1_22| 4) .cse16) .cse17 .cse16))) .cse5) (<= (+ |v_ULTIMATE.start_mkdup_~j~0#1_24| 1) |ULTIMATE.start_finddup_~n#1|) (<= 0 |v_ULTIMATE.start_mkdup_~i~0#1_22|) (not (= |v_ULTIMATE.start_mkdup_~i~0#1_22| |v_ULTIMATE.start_mkdup_~j~0#1_24|)) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_24|) (<= (+ |v_ULTIMATE.start_mkdup_~i~0#1_22| 1) |ULTIMATE.start_finddup_~n#1|))) .cse2 .cse3 (= |ULTIMATE.start_finddup_~i~1#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-16 04:56:54,424 INFO L899 garLoopResultBuilder]: For program point L36-4(lines 36 44) no Hoare annotation was computed. [2023-12-16 04:56:54,425 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-12-16 04:56:54,425 INFO L895 garLoopResultBuilder]: At program point L61-2(line 61) the Hoare annotation is: (let ((.cse5 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select (select |#memory_int#2| |ULTIMATE.start_main_~#i~2#1.base|) 0)) (.cse1 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_finddup_#res#1| 1)) (.cse8 (select |#memory_int#3| |ULTIMATE.start_main_~#j~2#1.base|)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 1)) (.cse4 (select .cse5 0)) (.cse7 (= |ULTIMATE.start_main_~#i~2#1.offset| 0))) (or (let ((.cse3 (select .cse8 |ULTIMATE.start_main_~#j~2#1.offset|))) (and (= 0 .cse0) .cse1 .cse2 (<= 1 .cse3) |ULTIMATE.start_main_#t~short22#1| (<= (+ .cse3 1) |ULTIMATE.start_main_~n~0#1|) (= .cse4 (select .cse5 (* .cse3 4))) .cse6 .cse7)) (let ((.cse9 (select .cse5 8))) (and (= 1 .cse0) (= (select .cse5 4) .cse9) .cse1 .cse2 (<= 3 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_#t~short22#1| (= (select .cse8 0) 2) .cse6 (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_27| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_25| Int)) (and (= .cse5 (let ((.cse11 (* |v_ULTIMATE.start_mkdup_~j~0#1_27| 4))) (let ((.cse10 (select .cse5 .cse11))) (store (store ((as const (Array Int Int)) 0) (* |v_ULTIMATE.start_mkdup_~i~0#1_25| 4) .cse10) .cse11 .cse10)))) (<= |v_ULTIMATE.start_mkdup_~j~0#1_27| 2) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_27|))) (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (not (= .cse9 .cse4)) .cse7))))) [2023-12-16 04:56:54,425 INFO L899 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2023-12-16 04:56:54,425 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ |ULTIMATE.start_mkdup_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (<= 0 |ULTIMATE.start_mkdup_~i~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_~a#1.base|) (<= 0 |ULTIMATE.start_mkdup_~j~0#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|)) (= |ULTIMATE.start_mkdup_~a#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_mkdup_~n#1|) (<= (+ |ULTIMATE.start_mkdup_~i~0#1| 1) |ULTIMATE.start_mkdup_~n#1|)) [2023-12-16 04:56:54,425 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 43) the Hoare annotation is: (let ((.cse24 (select |#memory_int#1| |ULTIMATE.start_finddup_~a#1.base|))) (let ((.cse1 (select .cse24 4)) (.cse21 (select .cse24 8)) (.cse0 (select .cse24 0)) (.cse17 ((as const (Array Int Int)) 0))) (let ((.cse6 (= |ULTIMATE.start_finddup_~j~1#1| 2)) (.cse2 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse3 (<= |ULTIMATE.start_finddup_~n#1| |ULTIMATE.start_main_~n~0#1|)) (.cse4 (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_24| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_22| Int)) (and (= (let ((.cse23 (* |v_ULTIMATE.start_mkdup_~j~0#1_24| 4))) (let ((.cse22 (select .cse24 .cse23))) (store (store .cse17 (* |v_ULTIMATE.start_mkdup_~i~0#1_22| 4) .cse22) .cse23 .cse22))) .cse24) (<= (+ |v_ULTIMATE.start_mkdup_~j~0#1_24| 1) |ULTIMATE.start_finddup_~n#1|) (<= 0 |v_ULTIMATE.start_mkdup_~i~0#1_22|) (not (= |v_ULTIMATE.start_mkdup_~i~0#1_22| |v_ULTIMATE.start_mkdup_~j~0#1_24|)) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_24|) (<= (+ |v_ULTIMATE.start_mkdup_~i~0#1_22| 1) |ULTIMATE.start_finddup_~n#1|)))) (.cse5 (= |ULTIMATE.start_finddup_~_i#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~#i~2#1.base| |ULTIMATE.start_finddup_~_i#1.base|)) (.cse15 (not (= .cse21 .cse0))) (.cse8 (= |ULTIMATE.start_finddup_~i~1#1| 0)) (.cse20 (= .cse21 .cse1)) (.cse9 (= |ULTIMATE.start_main_~#j~2#1.offset| 0)) (.cse10 (= |ULTIMATE.start_finddup_~_j#1.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_finddup_~a#1.base|)) (.cse12 (= |ULTIMATE.start_finddup_~a#1.offset| 0)) (.cse13 (= |ULTIMATE.start_main_~#j~2#1.base| |ULTIMATE.start_finddup_~_j#1.base|)) (.cse14 (= |ULTIMATE.start_main_~#i~2#1.offset| 0))) (or (and (not (= .cse0 .cse1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse15 (<= 3 |ULTIMATE.start_finddup_~n#1|) (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_27| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_25| Int)) (and (let ((.cse16 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|))) (= .cse16 (let ((.cse19 (* |v_ULTIMATE.start_mkdup_~j~0#1_27| 4))) (let ((.cse18 (select .cse16 .cse19))) (store (store .cse17 (* |v_ULTIMATE.start_mkdup_~i~0#1_25| 4) .cse18) .cse19 .cse18))))) (<= |v_ULTIMATE.start_mkdup_~j~0#1_27| 2) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_27|))) .cse20 (= |ULTIMATE.start_finddup_~i~1#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_finddup_~j~1#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 (<= 1 |ULTIMATE.start_finddup_~j~1#1|) .cse7 .cse15 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) [2023-12-16 04:56:54,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 04:56:54,426 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_main_#t~mem23#1| |ULTIMATE.start_main_#t~mem24#1|))) (.cse8 (select .cse1 0)) (.cse0 (select |#memory_int#2| |ULTIMATE.start_main_~#i~2#1.base|)) (.cse5 (select |#memory_int#3| |ULTIMATE.start_main_~#j~2#1.base|))) (or (let ((.cse2 (select .cse1 8))) (and (= 1 (select .cse0 0)) (= (select .cse1 4) .cse2) .cse3 (= |ULTIMATE.start_finddup_#res#1| 1) .cse4 (= (select .cse5 0) 2) (= |ULTIMATE.start_main_~r~0#1| 1) (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_27| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_25| Int)) (and (= .cse1 (let ((.cse7 (* |v_ULTIMATE.start_mkdup_~j~0#1_27| 4))) (let ((.cse6 (select .cse1 .cse7))) (store (store ((as const (Array Int Int)) 0) (* |v_ULTIMATE.start_mkdup_~i~0#1_25| 4) .cse6) .cse7 .cse6)))) (<= |v_ULTIMATE.start_mkdup_~j~0#1_27| 2) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_27|))) (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (not (= .cse2 .cse8)) (<= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~#i~2#1.offset| 0))) (let ((.cse9 (select .cse5 |ULTIMATE.start_main_~#j~2#1.offset|))) (and .cse3 .cse4 (<= 1 .cse9) (= .cse8 (select .cse1 (* .cse9 4))) (<= 1 |ULTIMATE.start_main_~n~0#1|) (= (select .cse0 |ULTIMATE.start_main_~#i~2#1.offset|) 0)))))) [2023-12-16 04:56:54,426 INFO L899 garLoopResultBuilder]: For program point L62-1(line 62) no Hoare annotation was computed. [2023-12-16 04:56:54,426 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2023-12-16 04:56:54,426 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 04:56:54,426 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2023-12-16 04:56:54,426 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse7 (select .cse1 0)) (.cse0 (select |#memory_int#2| |ULTIMATE.start_main_~#i~2#1.base|)) (.cse8 (= |ULTIMATE.start_main_#t~mem28#1| |ULTIMATE.start_main_#t~mem27#1|)) (.cse4 (select |#memory_int#3| |ULTIMATE.start_main_~#j~2#1.base|))) (or (let ((.cse2 (select .cse1 8))) (and (= 1 (select .cse0 0)) (= (select .cse1 4) .cse2) .cse3 (= |ULTIMATE.start_finddup_#res#1| 1) (= (select .cse4 0) 2) (= |ULTIMATE.start_main_~r~0#1| 1) (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_27| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_25| Int)) (and (= .cse1 (let ((.cse6 (* |v_ULTIMATE.start_mkdup_~j~0#1_27| 4))) (let ((.cse5 (select .cse1 .cse6))) (store (store ((as const (Array Int Int)) 0) (* |v_ULTIMATE.start_mkdup_~i~0#1_25| 4) .cse5) .cse6 .cse5)))) (<= |v_ULTIMATE.start_mkdup_~j~0#1_27| 2) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_27|))) (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (not (= .cse2 .cse7)) (<= 2 |ULTIMATE.start_main_~n~0#1|) .cse8 (= |ULTIMATE.start_main_~#i~2#1.offset| 0))) (let ((.cse9 (select .cse4 |ULTIMATE.start_main_~#j~2#1.offset|))) (and .cse3 (<= 1 .cse9) (= .cse7 (select .cse1 (* .cse9 4))) (<= 1 |ULTIMATE.start_main_~n~0#1|) (= (select .cse0 |ULTIMATE.start_main_~#i~2#1.offset|) 0) .cse8))))) [2023-12-16 04:56:54,426 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2023-12-16 04:56:54,426 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select (select |#memory_int#2| |ULTIMATE.start_main_~#i~2#1.base|) 0)) (.cse3 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_finddup_#res#1| 1)) (.cse9 (select .cse1 0)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 1)) (.cse10 (= |ULTIMATE.start_main_~#i~2#1.offset| 0)) (.cse5 (select |#memory_int#3| |ULTIMATE.start_main_~#j~2#1.base|))) (or (let ((.cse2 (select .cse1 8))) (and (= 1 .cse0) (= (select .cse1 4) .cse2) .cse3 .cse4 (<= 3 |ULTIMATE.start_main_~n~0#1|) (= (select .cse5 0) 2) .cse6 (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_27| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_25| Int)) (and (= .cse1 (let ((.cse8 (* |v_ULTIMATE.start_mkdup_~j~0#1_27| 4))) (let ((.cse7 (select .cse1 .cse8))) (store (store ((as const (Array Int Int)) 0) (* |v_ULTIMATE.start_mkdup_~i~0#1_25| 4) .cse7) .cse8 .cse7)))) (<= |v_ULTIMATE.start_mkdup_~j~0#1_27| 2) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_27|))) (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (not (= .cse2 .cse9)) .cse10)) (let ((.cse11 (select .cse5 |ULTIMATE.start_main_~#j~2#1.offset|))) (and (= 0 .cse0) .cse3 .cse4 (<= 1 .cse11) (<= (+ .cse11 1) |ULTIMATE.start_main_~n~0#1|) (= .cse9 (select .cse1 (* .cse11 4))) .cse6 .cse10))))) [2023-12-16 04:56:54,426 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-12-16 04:56:54,426 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2023-12-16 04:56:54,426 INFO L902 garLoopResultBuilder]: At program point L51-2(line 51) the Hoare annotation is: true [2023-12-16 04:56:54,426 INFO L899 garLoopResultBuilder]: For program point L51-3(line 51) no Hoare annotation was computed. [2023-12-16 04:56:54,426 INFO L899 garLoopResultBuilder]: For program point finddup_returnLabel#1(lines 33 46) no Hoare annotation was computed. [2023-12-16 04:56:54,426 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2023-12-16 04:56:54,426 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 11) no Hoare annotation was computed. [2023-12-16 04:56:54,427 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 11) the Hoare annotation is: true [2023-12-16 04:56:54,427 INFO L899 garLoopResultBuilder]: For program point L10-1(line 10) no Hoare annotation was computed. [2023-12-16 04:56:54,427 INFO L899 garLoopResultBuilder]: For program point L10-3(lines 9 11) no Hoare annotation was computed. [2023-12-16 04:56:54,427 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2023-12-16 04:56:54,429 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:56:54,430 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:56:54,437 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:480) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:165) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:47) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-16 04:56:54,439 INFO L158 Benchmark]: Toolchain (without parser) took 55037.94ms. Allocated memory was 187.7MB in the beginning and 429.9MB in the end (delta: 242.2MB). Free memory was 146.5MB in the beginning and 310.2MB in the end (delta: -163.7MB). Peak memory consumption was 242.5MB. Max. memory is 8.0GB. [2023-12-16 04:56:54,440 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:56:54,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.21ms. Allocated memory is still 187.7MB. Free memory was 146.5MB in the beginning and 134.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 04:56:54,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.38ms. Allocated memory is still 187.7MB. Free memory was 134.5MB in the beginning and 132.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:56:54,440 INFO L158 Benchmark]: Boogie Preprocessor took 52.89ms. Allocated memory is still 187.7MB. Free memory was 132.8MB in the beginning and 130.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:56:54,443 INFO L158 Benchmark]: RCFGBuilder took 314.23ms. Allocated memory is still 187.7MB. Free memory was 130.3MB in the beginning and 112.3MB in the end (delta: 18.0MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 04:56:54,443 INFO L158 Benchmark]: TraceAbstraction took 54443.87ms. Allocated memory was 187.7MB in the beginning and 429.9MB in the end (delta: 242.2MB). Free memory was 111.4MB in the beginning and 310.2MB in the end (delta: -198.8MB). Peak memory consumption was 207.9MB. Max. memory is 8.0GB. [2023-12-16 04:56:54,444 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.13ms. Allocated memory is still 187.7MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.21ms. Allocated memory is still 187.7MB. Free memory was 146.5MB in the beginning and 134.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.38ms. Allocated memory is still 187.7MB. Free memory was 134.5MB in the beginning and 132.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.89ms. Allocated memory is still 187.7MB. Free memory was 132.8MB in the beginning and 130.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 314.23ms. Allocated memory is still 187.7MB. Free memory was 130.3MB in the beginning and 112.3MB in the end (delta: 18.0MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 54443.87ms. Allocated memory was 187.7MB in the beginning and 429.9MB in the end (delta: 242.2MB). Free memory was 111.4MB in the beginning and 310.2MB in the end (delta: -198.8MB). Peak memory consumption was 207.9MB. 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 - PositiveResult [Line: 10]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.4s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 28.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 499 SdHoareTripleChecker+Valid, 26.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 470 mSDsluCounter, 4187 SdHoareTripleChecker+Invalid, 26.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3552 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3229 IncrementalHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 635 mSDtfsCounter, 3229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1161 GetRequests, 818 SyntacticMatches, 22 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=12, InterpolantAutomatonStates: 204, 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, 18 MinimizatonAttempts, 68 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 88 PreInvPairs, 108 NumberOfFragments, 1382 HoareAnnotationTreeSize, 88 FormulaSimplifications, 3074 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FormulaSimplificationsInter, 1496 FormulaSimplificationTreeSizeReductionInter, 5.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 1203 NumberOfCodeBlocks, 1203 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1480 ConstructedInterpolants, 103 QuantifiedInterpolants, 17884 SizeOfPredicates, 137 NumberOfNonLiveVariables, 1946 ConjunctsInSsa, 332 ConjunctsInUnsatCore, 34 InterpolantComputations, 10 PerfectInterpolantSequences, 1107/1267 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:264) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-16 04:56:54,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...