/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/mbpr4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-30 22:21:42,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-30 22:21:42,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-30 22:21:42,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-30 22:21:42,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-30 22:21:42,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-30 22:21:42,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-30 22:21:42,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-30 22:21:42,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-30 22:21:42,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-30 22:21:42,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-30 22:21:42,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-30 22:21:42,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-30 22:21:42,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-30 22:21:42,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-30 22:21:42,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-30 22:21:42,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-30 22:21:42,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-30 22:21:42,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-30 22:21:42,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-30 22:21:42,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-30 22:21:42,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-30 22:21:42,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-30 22:21:42,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-30 22:21:42,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-30 22:21:42,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-30 22:21:42,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-30 22:21:42,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-30 22:21:42,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-30 22:21:42,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-30 22:21:42,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-30 22:21:42,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-30 22:21:42,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-30 22:21:42,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-30 22:21:42,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-30 22:21:42,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-30 22:21:42,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-30 22:21:42,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-30 22:21:42,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-30 22:21:42,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-30 22:21:42,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-30 22:21:42,723 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-30 22:21:42,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-30 22:21:42,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-30 22:21:42,778 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-30 22:21:42,778 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-30 22:21:42,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-30 22:21:42,779 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-30 22:21:42,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-30 22:21:42,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-30 22:21:42,780 INFO L138 SettingsManager]: * Use SBE=true [2022-01-30 22:21:42,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-30 22:21:42,780 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-30 22:21:42,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-30 22:21:42,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-30 22:21:42,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-30 22:21:42,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-30 22:21:42,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-30 22:21:42,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-30 22:21:42,781 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-30 22:21:42,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-30 22:21:42,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-30 22:21:42,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-30 22:21:42,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-30 22:21:42,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-30 22:21:42,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-30 22:21:42,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-30 22:21:42,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-30 22:21:42,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-30 22:21:42,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-30 22:21:42,783 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-30 22:21:42,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-30 22:21:42,783 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-30 22:21:42,783 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-30 22:21:42,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-30 22:21:42,784 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-30 22:21:43,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-30 22:21:43,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-30 22:21:43,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-30 22:21:43,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-30 22:21:43,022 INFO L275 PluginConnector]: CDTParser initialized [2022-01-30 22:21:43,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mbpr4.c [2022-01-30 22:21:43,065 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46af9cb6c/febc1ea810c7406fb9361dc219763f6c/FLAGdfe5d22fd [2022-01-30 22:21:43,452 INFO L306 CDTParser]: Found 1 translation units. [2022-01-30 22:21:43,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr4.c [2022-01-30 22:21:43,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46af9cb6c/febc1ea810c7406fb9361dc219763f6c/FLAGdfe5d22fd [2022-01-30 22:21:43,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46af9cb6c/febc1ea810c7406fb9361dc219763f6c [2022-01-30 22:21:43,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-30 22:21:43,476 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-30 22:21:43,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-30 22:21:43,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-30 22:21:43,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-30 22:21:43,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 10:21:43" (1/1) ... [2022-01-30 22:21:43,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281b4f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:21:43, skipping insertion in model container [2022-01-30 22:21:43,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 10:21:43" (1/1) ... [2022-01-30 22:21:43,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-30 22:21:43,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-30 22:21:43,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr4.c[396,409] [2022-01-30 22:21:43,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-30 22:21:43,660 INFO L203 MainTranslator]: Completed pre-run [2022-01-30 22:21:43,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr4.c[396,409] [2022-01-30 22:21:43,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-30 22:21:43,709 INFO L208 MainTranslator]: Completed translation [2022-01-30 22:21:43,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:21:43 WrapperNode [2022-01-30 22:21:43,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-30 22:21:43,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-30 22:21:43,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-30 22:21:43,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-30 22:21:43,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:21:43" (1/1) ... [2022-01-30 22:21:43,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:21:43" (1/1) ... [2022-01-30 22:21:43,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:21:43" (1/1) ... [2022-01-30 22:21:43,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:21:43" (1/1) ... [2022-01-30 22:21:43,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:21:43" (1/1) ... [2022-01-30 22:21:43,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:21:43" (1/1) ... [2022-01-30 22:21:43,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:21:43" (1/1) ... [2022-01-30 22:21:43,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-30 22:21:43,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-30 22:21:43,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-30 22:21:43,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-30 22:21:43,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:21:43" (1/1) ... [2022-01-30 22:21:43,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-30 22:21:43,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:21:43,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-30 22:21:43,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-30 22:21:43,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-30 22:21:43,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-30 22:21:43,814 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-30 22:21:43,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-30 22:21:43,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-30 22:21:43,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-30 22:21:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-30 22:21:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-30 22:21:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-30 22:21:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-30 22:21:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-30 22:21:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-30 22:21:43,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-30 22:21:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-30 22:21:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-30 22:21:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-30 22:21:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-30 22:21:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-30 22:21:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-30 22:21:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-30 22:21:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-30 22:21:43,898 INFO L234 CfgBuilder]: Building ICFG [2022-01-30 22:21:43,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-30 22:21:44,047 INFO L275 CfgBuilder]: Performing block encoding [2022-01-30 22:21:44,051 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-30 22:21:44,051 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-30 22:21:44,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 10:21:44 BoogieIcfgContainer [2022-01-30 22:21:44,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-30 22:21:44,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-30 22:21:44,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-30 22:21:44,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-30 22:21:44,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 10:21:43" (1/3) ... [2022-01-30 22:21:44,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795da615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 10:21:44, skipping insertion in model container [2022-01-30 22:21:44,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:21:43" (2/3) ... [2022-01-30 22:21:44,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795da615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 10:21:44, skipping insertion in model container [2022-01-30 22:21:44,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 10:21:44" (3/3) ... [2022-01-30 22:21:44,057 INFO L111 eAbstractionObserver]: Analyzing ICFG mbpr4.c [2022-01-30 22:21:44,060 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-30 22:21:44,060 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-30 22:21:44,117 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-30 22:21:44,121 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-30 22:21:44,121 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-30 22:21:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 42 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 22:21:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-30 22:21:44,154 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:21:44,154 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:21:44,155 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:21:44,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:21:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1853428264, now seen corresponding path program 1 times [2022-01-30 22:21:44,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:21:44,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422621389] [2022-01-30 22:21:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:21:44,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:21:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:44,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:21:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:44,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-30 22:21:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:21:44,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:21:44,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422621389] [2022-01-30 22:21:44,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422621389] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 22:21:44,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 22:21:44,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-30 22:21:44,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928469332] [2022-01-30 22:21:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 22:21:44,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-30 22:21:44,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:21:44,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-30 22:21:44,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-30 22:21:44,384 INFO L87 Difference]: Start difference. First operand has 51 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 42 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-30 22:21:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:21:44,473 INFO L93 Difference]: Finished difference Result 91 states and 125 transitions. [2022-01-30 22:21:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-30 22:21:44,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-01-30 22:21:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:21:44,481 INFO L225 Difference]: With dead ends: 91 [2022-01-30 22:21:44,481 INFO L226 Difference]: Without dead ends: 45 [2022-01-30 22:21:44,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-30 22:21:44,488 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:21:44,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:21:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-30 22:21:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-01-30 22:21:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 22:21:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-01-30 22:21:44,517 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 28 [2022-01-30 22:21:44,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:21:44,517 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-01-30 22:21:44,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-30 22:21:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-01-30 22:21:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-30 22:21:44,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:21:44,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:21:44,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-30 22:21:44,519 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:21:44,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:21:44,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1831480730, now seen corresponding path program 1 times [2022-01-30 22:21:44,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:21:44,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139707843] [2022-01-30 22:21:44,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:21:44,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:21:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:44,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:21:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:44,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-30 22:21:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:21:44,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:21:44,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139707843] [2022-01-30 22:21:44,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139707843] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 22:21:44,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 22:21:44,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-30 22:21:44,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551402753] [2022-01-30 22:21:44,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 22:21:44,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-30 22:21:44,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:21:44,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-30 22:21:44,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-30 22:21:44,660 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-30 22:21:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:21:44,753 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-01-30 22:21:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-30 22:21:44,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-01-30 22:21:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:21:44,755 INFO L225 Difference]: With dead ends: 53 [2022-01-30 22:21:44,755 INFO L226 Difference]: Without dead ends: 51 [2022-01-30 22:21:44,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-30 22:21:44,756 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 17 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:21:44,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 178 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:21:44,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-30 22:21:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-01-30 22:21:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 22:21:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2022-01-30 22:21:44,762 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 28 [2022-01-30 22:21:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:21:44,762 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2022-01-30 22:21:44,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-30 22:21:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2022-01-30 22:21:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-30 22:21:44,763 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:21:44,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:21:44,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-30 22:21:44,764 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:21:44,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:21:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1833327772, now seen corresponding path program 1 times [2022-01-30 22:21:44,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:21:44,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956370474] [2022-01-30 22:21:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:21:44,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:21:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:44,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:21:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:44,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-30 22:21:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:21:44,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:21:44,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956370474] [2022-01-30 22:21:44,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956370474] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 22:21:44,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 22:21:44,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-30 22:21:44,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396029642] [2022-01-30 22:21:44,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 22:21:44,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-30 22:21:44,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:21:44,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-30 22:21:44,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-30 22:21:44,892 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:21:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:21:44,996 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2022-01-30 22:21:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-30 22:21:44,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-01-30 22:21:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:21:44,999 INFO L225 Difference]: With dead ends: 98 [2022-01-30 22:21:44,999 INFO L226 Difference]: Without dead ends: 66 [2022-01-30 22:21:45,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-30 22:21:45,001 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 105 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:21:45,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 38 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:21:45,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-30 22:21:45,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2022-01-30 22:21:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 45 states have internal predecessors, (54), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 22:21:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-01-30 22:21:45,008 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 28 [2022-01-30 22:21:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:21:45,008 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-01-30 22:21:45,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:21:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-01-30 22:21:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-30 22:21:45,009 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:21:45,009 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:21:45,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-30 22:21:45,010 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:21:45,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:21:45,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1028340430, now seen corresponding path program 1 times [2022-01-30 22:21:45,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:21:45,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521335200] [2022-01-30 22:21:45,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:21:45,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:21:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:45,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:21:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-30 22:21:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-30 22:21:45,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:21:45,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521335200] [2022-01-30 22:21:45,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521335200] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 22:21:45,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 22:21:45,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-30 22:21:45,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596853555] [2022-01-30 22:21:45,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 22:21:45,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-30 22:21:45,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:21:45,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-30 22:21:45,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-30 22:21:45,072 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:21:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:21:45,123 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2022-01-30 22:21:45,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-30 22:21:45,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-01-30 22:21:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:21:45,124 INFO L225 Difference]: With dead ends: 93 [2022-01-30 22:21:45,124 INFO L226 Difference]: Without dead ends: 54 [2022-01-30 22:21:45,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-30 22:21:45,125 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 39 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-30 22:21:45,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 54 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-30 22:21:45,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-30 22:21:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-01-30 22:21:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 22:21:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-01-30 22:21:45,132 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 44 [2022-01-30 22:21:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:21:45,132 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-01-30 22:21:45,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:21:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-01-30 22:21:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-30 22:21:45,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:21:45,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:21:45,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-30 22:21:45,134 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:21:45,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:21:45,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1880423472, now seen corresponding path program 1 times [2022-01-30 22:21:45,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:21:45,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636132567] [2022-01-30 22:21:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:21:45,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:21:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:45,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:21:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-30 22:21:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-30 22:21:45,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:21:45,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636132567] [2022-01-30 22:21:45,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636132567] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 22:21:45,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 22:21:45,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-30 22:21:45,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830619262] [2022-01-30 22:21:45,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 22:21:45,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-30 22:21:45,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:21:45,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-30 22:21:45,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-30 22:21:45,224 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:21:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:21:45,280 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2022-01-30 22:21:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-30 22:21:45,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-01-30 22:21:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:21:45,283 INFO L225 Difference]: With dead ends: 75 [2022-01-30 22:21:45,283 INFO L226 Difference]: Without dead ends: 54 [2022-01-30 22:21:45,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-30 22:21:45,286 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-30 22:21:45,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 54 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-30 22:21:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-30 22:21:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-01-30 22:21:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 45 states have internal predecessors, (52), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 22:21:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-01-30 22:21:45,303 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 44 [2022-01-30 22:21:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:21:45,303 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-01-30 22:21:45,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:21:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-01-30 22:21:45,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-30 22:21:45,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:21:45,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:21:45,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-30 22:21:45,304 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:21:45,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:21:45,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1713479246, now seen corresponding path program 1 times [2022-01-30 22:21:45,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:21:45,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790543082] [2022-01-30 22:21:45,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:21:45,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:21:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:45,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:21:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:45,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-30 22:21:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:21:45,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:21:45,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790543082] [2022-01-30 22:21:45,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790543082] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:21:45,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162793866] [2022-01-30 22:21:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:21:45,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:21:45,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:21:45,692 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) [2022-01-30 22:21:45,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-30 22:21:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:45,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 71 conjunts are in the unsatisfiable core [2022-01-30 22:21:45,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:21:45,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-01-30 22:21:45,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:45,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:45,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:45,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:45,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:45,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:45,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2022-01-30 22:21:46,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-01-30 22:21:46,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2022-01-30 22:21:46,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,123 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-01-30 22:21:46,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2022-01-30 22:21:46,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2022-01-30 22:21:46,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-01-30 22:21:46,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2022-01-30 22:21:46,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:46,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2022-01-30 22:21:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:21:46,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:21:46,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-01-30 22:21:46,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2022-01-30 22:21:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-30 22:21:46,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162793866] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:21:46,839 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:21:46,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2022-01-30 22:21:46,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677424075] [2022-01-30 22:21:46,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:21:46,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-30 22:21:46,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:21:46,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-30 22:21:46,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-01-30 22:21:46,840 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 25 states, 24 states have (on average 4.125) internal successors, (99), 23 states have internal predecessors, (99), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 22:21:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:21:47,341 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-01-30 22:21:47,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-30 22:21:47,342 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.125) internal successors, (99), 23 states have internal predecessors, (99), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2022-01-30 22:21:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:21:47,343 INFO L225 Difference]: With dead ends: 97 [2022-01-30 22:21:47,343 INFO L226 Difference]: Without dead ends: 81 [2022-01-30 22:21:47,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=1082, Unknown=0, NotChecked=0, Total=1332 [2022-01-30 22:21:47,344 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 135 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-30 22:21:47,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 164 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-30 22:21:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-30 22:21:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 56. [2022-01-30 22:21:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 22:21:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-01-30 22:21:47,357 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 44 [2022-01-30 22:21:47,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:21:47,358 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-01-30 22:21:47,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.125) internal successors, (99), 23 states have internal predecessors, (99), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 22:21:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-01-30 22:21:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-30 22:21:47,374 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:21:47,374 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:21:47,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-30 22:21:47,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-30 22:21:47,592 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:21:47,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:21:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash 665046338, now seen corresponding path program 1 times [2022-01-30 22:21:47,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:21:47,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620022378] [2022-01-30 22:21:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:21:47,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:21:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:48,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:21:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-30 22:21:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-30 22:21:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:21:48,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:21:48,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620022378] [2022-01-30 22:21:48,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620022378] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:21:48,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348209185] [2022-01-30 22:21:48,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:21:48,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:21:48,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:21:48,760 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) [2022-01-30 22:21:48,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-30 22:21:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:48,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-30 22:21:48,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:21:49,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-01-30 22:21:49,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2022-01-30 22:21:49,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2022-01-30 22:21:49,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-01-30 22:21:49,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2022-01-30 22:21:49,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2022-01-30 22:21:49,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-01-30 22:21:49,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2022-01-30 22:21:49,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:49,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2022-01-30 22:21:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-30 22:21:49,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:21:49,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 106 [2022-01-30 22:21:49,973 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-30 22:21:49,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 163 [2022-01-30 22:21:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-30 22:21:50,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348209185] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:21:50,182 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:21:50,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 33 [2022-01-30 22:21:50,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104464014] [2022-01-30 22:21:50,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:21:50,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-30 22:21:50,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:21:50,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-30 22:21:50,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2022-01-30 22:21:50,184 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 33 states, 32 states have (on average 3.65625) internal successors, (117), 31 states have internal predecessors, (117), 9 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-30 22:21:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:21:51,829 INFO L93 Difference]: Finished difference Result 150 states and 180 transitions. [2022-01-30 22:21:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-30 22:21:51,829 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.65625) internal successors, (117), 31 states have internal predecessors, (117), 9 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 53 [2022-01-30 22:21:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:21:51,830 INFO L225 Difference]: With dead ends: 150 [2022-01-30 22:21:51,830 INFO L226 Difference]: Without dead ends: 115 [2022-01-30 22:21:51,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 97 SyntacticMatches, 15 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=658, Invalid=3374, Unknown=0, NotChecked=0, Total=4032 [2022-01-30 22:21:51,832 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 236 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-30 22:21:51,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 235 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 775 Invalid, 0 Unknown, 52 Unchecked, 0.4s Time] [2022-01-30 22:21:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-01-30 22:21:51,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2022-01-30 22:21:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 65 states have internal predecessors, (72), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-30 22:21:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2022-01-30 22:21:51,842 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 53 [2022-01-30 22:21:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:21:51,842 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2022-01-30 22:21:51,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.65625) internal successors, (117), 31 states have internal predecessors, (117), 9 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-30 22:21:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-01-30 22:21:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-30 22:21:51,843 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:21:51,844 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:21:51,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-30 22:21:52,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-01-30 22:21:52,058 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:21:52,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:21:52,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1662411698, now seen corresponding path program 2 times [2022-01-30 22:21:52,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:21:52,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495071840] [2022-01-30 22:21:52,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:21:52,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:21:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:52,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:21:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-30 22:21:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-30 22:21:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:52,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-30 22:21:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-30 22:21:52,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:21:52,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495071840] [2022-01-30 22:21:52,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495071840] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:21:52,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298608418] [2022-01-30 22:21:52,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-30 22:21:52,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:21:52,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:21:52,278 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) [2022-01-30 22:21:52,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-30 22:21:52,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-30 22:21:52,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:21:52,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-30 22:21:52,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:21:52,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-01-30 22:21:52,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:52,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:52,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:52,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:52,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:52,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:52,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2022-01-30 22:21:52,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:52,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-01-30 22:21:52,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2022-01-30 22:21:52,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:52,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:52,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:52,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:52,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:52,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2022-01-30 22:21:52,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-30 22:21:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-30 22:21:52,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:21:53,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 [2022-01-30 22:21:53,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-01-30 22:21:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-30 22:21:53,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298608418] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:21:53,978 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:21:53,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2022-01-30 22:21:53,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564568864] [2022-01-30 22:21:53,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:21:53,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-30 22:21:53,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:21:53,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-30 22:21:53,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-01-30 22:21:53,979 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 24 states, 24 states have (on average 5.25) internal successors, (126), 23 states have internal predecessors, (126), 11 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-30 22:21:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:21:54,292 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2022-01-30 22:21:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-30 22:21:54,293 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.25) internal successors, (126), 23 states have internal predecessors, (126), 11 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 62 [2022-01-30 22:21:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:21:54,294 INFO L225 Difference]: With dead ends: 147 [2022-01-30 22:21:54,294 INFO L226 Difference]: Without dead ends: 95 [2022-01-30 22:21:54,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 116 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2022-01-30 22:21:54,295 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 92 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-30 22:21:54,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 189 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 475 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2022-01-30 22:21:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-30 22:21:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2022-01-30 22:21:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.106060606060606) internal successors, (73), 67 states have internal predecessors, (73), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-30 22:21:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-01-30 22:21:54,302 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 62 [2022-01-30 22:21:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:21:54,302 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-01-30 22:21:54,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.25) internal successors, (126), 23 states have internal predecessors, (126), 11 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-30 22:21:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-01-30 22:21:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-30 22:21:54,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:21:54,303 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:21:54,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-30 22:21:54,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:21:54,517 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:21:54,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:21:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1559108174, now seen corresponding path program 3 times [2022-01-30 22:21:54,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:21:54,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911267520] [2022-01-30 22:21:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:21:54,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:21:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:54,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:21:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:54,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-30 22:21:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:54,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-30 22:21:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:54,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-30 22:21:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:54,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-30 22:21:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:54,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-30 22:21:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-30 22:21:54,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:21:54,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911267520] [2022-01-30 22:21:54,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911267520] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:21:54,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785871733] [2022-01-30 22:21:54,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-30 22:21:54,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:21:54,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:21:54,761 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) [2022-01-30 22:21:54,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-30 22:21:54,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-30 22:21:54,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:21:54,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-30 22:21:54,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:21:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-30 22:21:55,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:21:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-30 22:21:55,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785871733] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:21:55,722 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:21:55,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 32 [2022-01-30 22:21:55,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891582633] [2022-01-30 22:21:55,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:21:55,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-30 22:21:55,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:21:55,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-30 22:21:55,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2022-01-30 22:21:55,724 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 32 states, 32 states have (on average 4.75) internal successors, (152), 31 states have internal predecessors, (152), 17 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-30 22:21:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:21:56,132 INFO L93 Difference]: Finished difference Result 228 states and 252 transitions. [2022-01-30 22:21:56,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-30 22:21:56,133 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.75) internal successors, (152), 31 states have internal predecessors, (152), 17 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 80 [2022-01-30 22:21:56,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:21:56,134 INFO L225 Difference]: With dead ends: 228 [2022-01-30 22:21:56,134 INFO L226 Difference]: Without dead ends: 110 [2022-01-30 22:21:56,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2022-01-30 22:21:56,138 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 286 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-30 22:21:56,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 116 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-30 22:21:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-01-30 22:21:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2022-01-30 22:21:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 83 states have internal predecessors, (89), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-30 22:21:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2022-01-30 22:21:56,151 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 80 [2022-01-30 22:21:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:21:56,151 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2022-01-30 22:21:56,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.75) internal successors, (152), 31 states have internal predecessors, (152), 17 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-30 22:21:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-01-30 22:21:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-30 22:21:56,152 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:21:56,152 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-30 22:21:56,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-30 22:21:56,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:21:56,370 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:21:56,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:21:56,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1790107336, now seen corresponding path program 4 times [2022-01-30 22:21:56,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:21:56,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635107136] [2022-01-30 22:21:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:21:56,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:21:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:56,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:21:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:56,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-30 22:21:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:56,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-30 22:21:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:56,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-30 22:21:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:56,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-30 22:21:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:56,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-30 22:21:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:21:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 28 proven. 27 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-01-30 22:21:56,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:21:56,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635107136] [2022-01-30 22:21:56,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635107136] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:21:56,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388520041] [2022-01-30 22:21:56,669 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-30 22:21:56,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:21:56,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:21:56,684 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) [2022-01-30 22:21:56,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-30 22:21:56,782 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-30 22:21:56,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:21:56,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-30 22:21:56,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:21:56,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-01-30 22:21:56,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 69 [2022-01-30 22:21:56,950 INFO L353 Elim1Store]: treesize reduction 620, result has 9.0 percent of original size [2022-01-30 22:21:56,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 127 treesize of output 124 [2022-01-30 22:21:56,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:56,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:56,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:56,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:56,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:56,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:56,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 34 [2022-01-30 22:21:57,006 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:21:57,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:21:57,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 66 [2022-01-30 22:21:57,070 INFO L353 Elim1Store]: treesize reduction 542, result has 9.2 percent of original size [2022-01-30 22:21:57,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 124 treesize of output 118 [2022-01-30 22:21:57,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:57,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:57,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:57,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:57,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:57,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:21:57,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 38 [2022-01-30 22:22:03,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-01-30 22:22:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 27 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-30 22:22:03,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:22:06,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_104 Int)) (or (forall ((v_ArrVal_674 Int)) (< (select (store (select |c_#memory_int| |c_main_~#volArray~0.base|) (+ (* 16 v_main_~i~0_104) (- 4) |c_main_~#volArray~0.offset|) v_ArrVal_674) (+ 12 |c_main_~#volArray~0.offset|)) c_main_~MINVAL~0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_104)))) is different from false [2022-01-30 22:22:07,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2022-01-30 22:22:07,798 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-30 22:22:07,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 328680 treesize of output 304872 [2022-01-30 22:22:17,118 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-30 22:22:17,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-30 22:22:17,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-30 22:22:17,332 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-01-30 22:22:17,336 INFO L158 Benchmark]: Toolchain (without parser) took 33859.92ms. Allocated memory was 186.6MB in the beginning and 666.9MB in the end (delta: 480.2MB). Free memory was 141.5MB in the beginning and 358.8MB in the end (delta: -217.3MB). Peak memory consumption was 390.0MB. Max. memory is 8.0GB. [2022-01-30 22:22:17,336 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 186.6MB. Free memory was 157.7MB in the beginning and 157.6MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-30 22:22:17,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.19ms. Allocated memory is still 186.6MB. Free memory was 141.4MB in the beginning and 161.9MB in the end (delta: -20.5MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-01-30 22:22:17,337 INFO L158 Benchmark]: Boogie Preprocessor took 35.26ms. Allocated memory is still 186.6MB. Free memory was 161.9MB in the beginning and 160.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-30 22:22:17,337 INFO L158 Benchmark]: RCFGBuilder took 306.79ms. Allocated memory is still 186.6MB. Free memory was 160.3MB in the beginning and 145.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-30 22:22:17,338 INFO L158 Benchmark]: TraceAbstraction took 33282.05ms. Allocated memory was 186.6MB in the beginning and 666.9MB in the end (delta: 480.2MB). Free memory was 145.1MB in the beginning and 358.8MB in the end (delta: -213.7MB). Peak memory consumption was 393.7MB. Max. memory is 8.0GB. [2022-01-30 22:22:17,339 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 186.6MB. Free memory was 157.7MB in the beginning and 157.6MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.19ms. Allocated memory is still 186.6MB. Free memory was 141.4MB in the beginning and 161.9MB in the end (delta: -20.5MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.26ms. Allocated memory is still 186.6MB. Free memory was 161.9MB in the beginning and 160.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 306.79ms. Allocated memory is still 186.6MB. Free memory was 160.3MB in the beginning and 145.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 33282.05ms. Allocated memory was 186.6MB in the beginning and 666.9MB in the end (delta: 480.2MB). Free memory was 145.1MB in the beginning and 358.8MB in the end (delta: -213.7MB). Peak memory consumption was 393.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-30 22:22:17,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...