/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/sina3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 23:24:46,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 23:24:46,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 23:24:46,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 23:24:46,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 23:24:46,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 23:24:46,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 23:24:46,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 23:24:46,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 23:24:46,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 23:24:46,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 23:24:46,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 23:24:46,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 23:24:46,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 23:24:46,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 23:24:46,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 23:24:46,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 23:24:46,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 23:24:46,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 23:24:46,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 23:24:46,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 23:24:46,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 23:24:46,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 23:24:46,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 23:24:46,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 23:24:46,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 23:24:46,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 23:24:46,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 23:24:46,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 23:24:46,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 23:24:46,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 23:24:46,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 23:24:46,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 23:24:46,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 23:24:46,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 23:24:46,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 23:24:46,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 23:24:46,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 23:24:46,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 23:24:46,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 23:24:46,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 23:24:46,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-09 23:24:46,700 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 23:24:46,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 23:24:46,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 23:24:46,700 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 23:24:46,701 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 23:24:46,701 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 23:24:46,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 23:24:46,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 23:24:46,702 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 23:24:46,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 23:24:46,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 23:24:46,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 23:24:46,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 23:24:46,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 23:24:46,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 23:24:46,703 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 23:24:46,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 23:24:46,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 23:24:46,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 23:24:46,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 23:24:46,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 23:24:46,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:24:46,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 23:24:46,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 23:24:46,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 23:24:46,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 23:24:46,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 23:24:46,705 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 23:24:46,706 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 23:24:46,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 23:24:46,706 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-09 23:24:46,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 23:24:46,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 23:24:46,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 23:24:46,990 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 23:24:46,991 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 23:24:46,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina3.c [2022-01-09 23:24:47,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27bf52253/398a14a9420a45beb969be2be389dd2e/FLAG5bb6b9fff [2022-01-09 23:24:47,454 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 23:24:47,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina3.c [2022-01-09 23:24:47,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27bf52253/398a14a9420a45beb969be2be389dd2e/FLAG5bb6b9fff [2022-01-09 23:24:47,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27bf52253/398a14a9420a45beb969be2be389dd2e [2022-01-09 23:24:47,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 23:24:47,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 23:24:47,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 23:24:47,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 23:24:47,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 23:24:47,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:24:47" (1/1) ... [2022-01-09 23:24:47,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d18c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:47, skipping insertion in model container [2022-01-09 23:24:47,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:24:47" (1/1) ... [2022-01-09 23:24:47,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 23:24:47,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 23:24:48,043 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-fpi/sina3.c[588,601] [2022-01-09 23:24:48,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:24:48,093 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 23:24:48,104 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-fpi/sina3.c[588,601] [2022-01-09 23:24:48,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:24:48,123 INFO L208 MainTranslator]: Completed translation [2022-01-09 23:24:48,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:48 WrapperNode [2022-01-09 23:24:48,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 23:24:48,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 23:24:48,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 23:24:48,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 23:24:48,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:48" (1/1) ... [2022-01-09 23:24:48,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:48" (1/1) ... [2022-01-09 23:24:48,159 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-01-09 23:24:48,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 23:24:48,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 23:24:48,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 23:24:48,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 23:24:48,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:48" (1/1) ... [2022-01-09 23:24:48,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:48" (1/1) ... [2022-01-09 23:24:48,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:48" (1/1) ... [2022-01-09 23:24:48,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:48" (1/1) ... [2022-01-09 23:24:48,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:48" (1/1) ... [2022-01-09 23:24:48,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:48" (1/1) ... [2022-01-09 23:24:48,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:48" (1/1) ... [2022-01-09 23:24:48,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 23:24:48,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 23:24:48,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 23:24:48,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 23:24:48,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:48" (1/1) ... [2022-01-09 23:24:48,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:24:48,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:48,224 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-09 23:24:48,250 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-09 23:24:48,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 23:24:48,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 23:24:48,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-09 23:24:48,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-09 23:24:48,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-09 23:24:48,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 23:24:48,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 23:24:48,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-09 23:24:48,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-09 23:24:48,348 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 23:24:48,350 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 23:24:48,557 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 23:24:48,562 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 23:24:48,562 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-09 23:24:48,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:24:48 BoogieIcfgContainer [2022-01-09 23:24:48,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 23:24:48,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 23:24:48,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 23:24:48,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 23:24:48,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:24:47" (1/3) ... [2022-01-09 23:24:48,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf79b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:24:48, skipping insertion in model container [2022-01-09 23:24:48,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:48" (2/3) ... [2022-01-09 23:24:48,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf79b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:24:48, skipping insertion in model container [2022-01-09 23:24:48,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:24:48" (3/3) ... [2022-01-09 23:24:48,570 INFO L111 eAbstractionObserver]: Analyzing ICFG sina3.c [2022-01-09 23:24:48,574 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 23:24:48,574 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 23:24:48,646 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 23:24:48,654 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-09 23:24:48,654 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 23:24:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-09 23:24:48,676 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:48,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:48,677 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:48,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:48,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-01-09 23:24:48,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:48,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464637736] [2022-01-09 23:24:48,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:48,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:48,832 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-09 23:24:48,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:48,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464637736] [2022-01-09 23:24:48,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464637736] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:24:48,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:24:48,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-09 23:24:48,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250563917] [2022-01-09 23:24:48,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:24:48,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-09 23:24:48,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:48,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-09 23:24:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 23:24:48,868 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:48,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:48,883 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-01-09 23:24:48,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-09 23:24:48,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-09 23:24:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:48,891 INFO L225 Difference]: With dead ends: 50 [2022-01-09 23:24:48,891 INFO L226 Difference]: Without dead ends: 23 [2022-01-09 23:24:48,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 23:24:48,896 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:48,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:24:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-09 23:24:48,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-09 23:24:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-09 23:24:48,926 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-01-09 23:24:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:48,927 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-09 23:24:48,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-09 23:24:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-09 23:24:48,931 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:48,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:48,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 23:24:48,932 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-01-09 23:24:48,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:48,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57503179] [2022-01-09 23:24:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:48,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:49,007 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-09 23:24:49,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:49,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57503179] [2022-01-09 23:24:49,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57503179] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:24:49,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:24:49,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:24:49,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314873532] [2022-01-09 23:24:49,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:24:49,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:24:49,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:49,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:24:49,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:24:49,011 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:49,068 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-01-09 23:24:49,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:24:49,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-09 23:24:49,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:49,070 INFO L225 Difference]: With dead ends: 53 [2022-01-09 23:24:49,070 INFO L226 Difference]: Without dead ends: 37 [2022-01-09 23:24:49,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:24:49,072 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:49,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:24:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-09 23:24:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-01-09 23:24:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-01-09 23:24:49,078 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-01-09 23:24:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:49,078 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-01-09 23:24:49,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-01-09 23:24:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-09 23:24:49,079 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:49,079 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] [2022-01-09 23:24:49,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 23:24:49,080 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-01-09 23:24:49,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:49,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972424098] [2022-01-09 23:24:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:49,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:50,051 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-09 23:24:50,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:50,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972424098] [2022-01-09 23:24:50,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972424098] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:50,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85580261] [2022-01-09 23:24:50,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:50,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:50,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:50,059 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-09 23:24:50,064 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-09 23:24:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:50,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-09 23:24:50,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:50,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:50,259 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 18 treesize of output 16 [2022-01-09 23:24:50,316 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 11 treesize of output 7 [2022-01-09 23:24:50,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:50,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-09 23:24:50,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:50,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:50,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-01-09 23:24:50,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:50,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:50,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-01-09 23:24:51,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:51,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:51,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-01-09 23:24:51,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:51,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:51,443 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-09 23:24:51,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 36 [2022-01-09 23:24:51,486 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-09 23:24:51,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:51,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:51,994 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 20 treesize of output 18 [2022-01-09 23:24:51,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:51,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:52,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:52,011 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-09 23:24:52,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85580261] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:52,012 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:52,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-01-09 23:24:52,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340480345] [2022-01-09 23:24:52,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:52,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-09 23:24:52,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:52,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-09 23:24:52,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2022-01-09 23:24:52,017 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:52,567 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-01-09 23:24:52,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-09 23:24:52,568 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-09 23:24:52,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:52,569 INFO L225 Difference]: With dead ends: 55 [2022-01-09 23:24:52,569 INFO L226 Difference]: Without dead ends: 53 [2022-01-09 23:24:52,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2022-01-09 23:24:52,571 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:52,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 114 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 334 Invalid, 0 Unknown, 11 Unchecked, 0.3s Time] [2022-01-09 23:24:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-09 23:24:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-01-09 23:24:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-01-09 23:24:52,579 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-01-09 23:24:52,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:52,579 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-01-09 23:24:52,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-01-09 23:24:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-09 23:24:52,580 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:52,581 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:52,608 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-09 23:24:52,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:52,804 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2022-01-09 23:24:52,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:52,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289318555] [2022-01-09 23:24:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:52,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:24:52,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:52,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289318555] [2022-01-09 23:24:52,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289318555] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:52,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221428730] [2022-01-09 23:24:52,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:24:52,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:52,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:52,895 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-09 23:24:52,899 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-09 23:24:52,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 23:24:52,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:24:52,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-09 23:24:52,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:24:53,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:24:53,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221428730] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:53,122 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:53,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-01-09 23:24:53,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587803995] [2022-01-09 23:24:53,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:53,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:24:53,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:53,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:24:53,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:24:53,124 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:53,276 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-01-09 23:24:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:24:53,276 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-09 23:24:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:53,277 INFO L225 Difference]: With dead ends: 110 [2022-01-09 23:24:53,277 INFO L226 Difference]: Without dead ends: 66 [2022-01-09 23:24:53,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-01-09 23:24:53,279 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 56 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:53,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 61 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:24:53,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-09 23:24:53,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-01-09 23:24:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-01-09 23:24:53,286 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2022-01-09 23:24:53,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:53,286 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-01-09 23:24:53,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-01-09 23:24:53,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-09 23:24:53,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:53,287 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:53,311 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-09 23:24:53,487 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,SelfDestructingSolverStorable3 [2022-01-09 23:24:53,488 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2022-01-09 23:24:53,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:53,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886607032] [2022-01-09 23:24:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:53,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:24:53,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:53,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886607032] [2022-01-09 23:24:53,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886607032] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:53,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125907260] [2022-01-09 23:24:53,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-09 23:24:53,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:53,571 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-09 23:24:53,572 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-09 23:24:53,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-09 23:24:53,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:24:53,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-09 23:24:53,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:24:53,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:24:53,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125907260] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:53,810 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:53,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-01-09 23:24:53,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846401003] [2022-01-09 23:24:53,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:53,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:24:53,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:53,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:24:53,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:24:53,813 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:53,940 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-01-09 23:24:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:24:53,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-09 23:24:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:53,941 INFO L225 Difference]: With dead ends: 63 [2022-01-09 23:24:53,941 INFO L226 Difference]: Without dead ends: 50 [2022-01-09 23:24:53,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-01-09 23:24:53,942 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 60 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:53,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 53 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:24:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-09 23:24:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-01-09 23:24:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-01-09 23:24:53,947 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-01-09 23:24:53,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:53,947 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-01-09 23:24:53,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-01-09 23:24:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-09 23:24:53,948 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:53,948 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:53,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:54,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:54,175 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:54,176 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-01-09 23:24:54,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:54,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319227512] [2022-01-09 23:24:54,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:54,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:55,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:55,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319227512] [2022-01-09 23:24:55,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319227512] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:55,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592471856] [2022-01-09 23:24:55,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-09 23:24:55,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:55,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:55,335 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-09 23:24:55,336 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-09 23:24:55,412 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-09 23:24:55,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:24:55,415 WARN L261 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 65 conjunts are in the unsatisfiable core [2022-01-09 23:24:55,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:55,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:55,467 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 18 treesize of output 16 [2022-01-09 23:24:55,480 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 11 treesize of output 7 [2022-01-09 23:24:55,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:55,547 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-09 23:24:55,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:55,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:55,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-09 23:24:55,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:55,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:55,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:55,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-01-09 23:24:56,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-01-09 23:24:56,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:56,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-01-09 23:24:56,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-01-09 23:24:56,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:56,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:56,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:56,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 53 [2022-01-09 23:24:57,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:57,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:57,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:57,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:57,080 INFO L353 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2022-01-09 23:24:57,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 66 [2022-01-09 23:24:57,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:57,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:57,363 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-09 23:24:57,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-01-09 23:24:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:57,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:59,562 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_229 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2022-01-09 23:25:10,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_75| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_75|)) (forall ((v_ArrVal_221 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (v_ArrVal_229 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)) (= (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse2 .cse3))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) is different from false [2022-01-09 23:25:11,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_221 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_75| Int) (v_ArrVal_229 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_75|)) (= (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2022-01-09 23:25:31,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_75| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_75|)) (and (forall ((v_ArrVal_221 Int) (v_ArrVal_229 Int)) (<= (select (store (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse6 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (forall ((v_ArrVal_221 Int) (v_ArrVal_229 Int)) (<= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) (select (store (let ((.cse11 (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))))) (store (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse8 .cse9 (select (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse10))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2022-01-09 23:25:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-09 23:25:44,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592471856] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:25:44,640 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:25:44,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 60 [2022-01-09 23:25:44,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084035342] [2022-01-09 23:25:44,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:25:44,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-01-09 23:25:44,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:44,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-01-09 23:25:44,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2766, Unknown=32, NotChecked=444, Total=3540 [2022-01-09 23:25:44,643 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:46,842 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (<= c_~N~0 2) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_75| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_75|)) (forall ((v_ArrVal_221 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (v_ArrVal_229 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)) (= (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse2 (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3 .cse4))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (< 1 c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ |c_ULTIMATE.start_main_~b~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-01-09 23:25:49,096 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select .cse4 .cse1))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (+ c_~N~0 1)) (.cse5 (+ (- 2) .cse3))) (and (<= c_~N~0 .cse0) (<= c_~N~0 2) (= .cse1 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= .cse2 .cse3) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (* |c_ULTIMATE.start_main_~i~0#1| 4)) 1))) (= (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (< 1 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse0 c_~N~0) (= (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse3 .cse2) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_229 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) (= .cse5 1))))) is different from false [2022-01-09 23:25:51,157 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~N~0 2) (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_229 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-01-09 23:25:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:51,292 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-01-09 23:25:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-09 23:25:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-09 23:25:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:51,294 INFO L225 Difference]: With dead ends: 68 [2022-01-09 23:25:51,294 INFO L226 Difference]: Without dead ends: 66 [2022-01-09 23:25:51,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 53.9s TimeCoverageRelationStatistics Valid=385, Invalid=3514, Unknown=35, NotChecked=896, Total=4830 [2022-01-09 23:25:51,297 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 513 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:51,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 149 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 297 Invalid, 0 Unknown, 513 Unchecked, 0.2s Time] [2022-01-09 23:25:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-09 23:25:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-01-09 23:25:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-01-09 23:25:51,305 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32 [2022-01-09 23:25:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:51,305 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-01-09 23:25:51,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-01-09 23:25:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-09 23:25:51,306 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:51,306 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:51,328 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-09 23:25:51,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:25:51,527 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:51,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:51,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1696042328, now seen corresponding path program 5 times [2022-01-09 23:25:51,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:51,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19870144] [2022-01-09 23:25:51,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:51,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-09 23:25:51,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:51,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19870144] [2022-01-09 23:25:51,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19870144] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:25:51,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068499624] [2022-01-09 23:25:51,619 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-09 23:25:51,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:25:51,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:25:51,621 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-09 23:25:51,622 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-09 23:25:51,714 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-09 23:25:51,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:25:51,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-09 23:25:51,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:25:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-09 23:25:51,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:25:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-09 23:25:51,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068499624] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:25:51,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:25:51,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-01-09 23:25:51,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248016617] [2022-01-09 23:25:51,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:25:51,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:25:51,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:51,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:25:51,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:25:51,861 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:52,024 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2022-01-09 23:25:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-09 23:25:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-09 23:25:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:52,025 INFO L225 Difference]: With dead ends: 148 [2022-01-09 23:25:52,025 INFO L226 Difference]: Without dead ends: 111 [2022-01-09 23:25:52,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-01-09 23:25:52,028 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 77 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:52,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 90 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:25:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-09 23:25:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2022-01-09 23:25:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 82 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2022-01-09 23:25:52,047 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 34 [2022-01-09 23:25:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:52,047 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2022-01-09 23:25:52,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2022-01-09 23:25:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-09 23:25:52,048 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:52,048 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:52,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-09 23:25:52,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:25:52,270 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:52,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1205583320, now seen corresponding path program 6 times [2022-01-09 23:25:52,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:52,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947791025] [2022-01-09 23:25:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:52,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-09 23:25:52,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:52,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947791025] [2022-01-09 23:25:52,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947791025] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:25:52,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27027996] [2022-01-09 23:25:52,335 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-09 23:25:52,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:25:52,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:25:52,336 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:25:52,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-09 23:25:52,428 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-09 23:25:52,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:25:52,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-09 23:25:52,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:25:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-09 23:25:52,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:25:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-09 23:25:52,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27027996] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:25:52,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:25:52,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-01-09 23:25:52,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854926062] [2022-01-09 23:25:52,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:25:52,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:25:52,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:52,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:25:52,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:25:52,593 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:52,822 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-01-09 23:25:52,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-09 23:25:52,823 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-09 23:25:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:52,823 INFO L225 Difference]: With dead ends: 112 [2022-01-09 23:25:52,823 INFO L226 Difference]: Without dead ends: 91 [2022-01-09 23:25:52,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-01-09 23:25:52,824 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 124 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:52,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 101 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:52,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-09 23:25:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 68. [2022-01-09 23:25:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-01-09 23:25:52,833 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 34 [2022-01-09 23:25:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:52,833 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-01-09 23:25:52,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-01-09 23:25:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-09 23:25:52,834 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:52,834 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-09 23:25:52,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-09 23:25:53,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:25:53,055 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-01-09 23:25:53,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:53,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114898331] [2022-01-09 23:25:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:53,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:25:53,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:53,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114898331] [2022-01-09 23:25:53,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114898331] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:25:53,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425867645] [2022-01-09 23:25:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:53,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:25:53,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:25:53,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:25:53,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-09 23:25:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:53,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 81 conjunts are in the unsatisfiable core [2022-01-09 23:25:53,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:25:53,959 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 11 treesize of output 7 [2022-01-09 23:25:53,968 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-09 23:25:53,968 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 23 treesize of output 19 [2022-01-09 23:25:54,010 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 23 treesize of output 22 [2022-01-09 23:25:54,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:25:54,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-09 23:25:54,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:25:54,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-01-09 23:25:54,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:25:54,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:25:54,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-01-09 23:25:54,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:25:54,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:25:54,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:25:54,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-01-09 23:25:54,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:25:54,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:25:54,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-01-09 23:25:55,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:25:55,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:25:55,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:25:55,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:25:55,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-01-09 23:25:55,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:25:55,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:25:55,146 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-09 23:25:55,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 59 [2022-01-09 23:25:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:55,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:25:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:58,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425867645] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:25:58,315 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:25:58,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 63 [2022-01-09 23:25:58,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060885716] [2022-01-09 23:25:58,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:25:58,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-01-09 23:25:58,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:58,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-01-09 23:25:58,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=3438, Unknown=0, NotChecked=0, Total=3906 [2022-01-09 23:25:58,318 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 63 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 63 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)