/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/s5if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 01:39:50,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 01:39:50,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 01:39:50,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 01:39:50,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 01:39:50,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 01:39:50,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 01:39:50,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 01:39:50,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 01:39:50,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 01:39:50,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 01:39:50,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 01:39:50,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 01:39:50,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 01:39:50,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 01:39:50,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 01:39:50,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 01:39:50,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 01:39:50,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 01:39:50,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 01:39:50,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 01:39:50,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 01:39:50,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 01:39:50,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 01:39:50,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 01:39:50,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 01:39:50,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 01:39:50,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 01:39:50,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 01:39:50,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 01:39:50,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 01:39:50,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 01:39:50,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 01:39:50,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 01:39:50,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 01:39:50,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 01:39:50,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 01:39:50,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 01:39:50,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 01:39:50,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 01:39:50,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 01:39:50,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-31 01:39:50,877 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 01:39:50,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 01:39:50,877 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 01:39:50,877 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 01:39:50,878 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 01:39:50,878 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 01:39:50,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 01:39:50,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 01:39:50,879 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 01:39:50,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 01:39:50,880 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 01:39:50,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 01:39:50,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 01:39:50,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 01:39:50,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 01:39:50,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 01:39:50,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 01:39:50,881 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 01:39:50,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 01:39:50,881 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 01:39:50,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 01:39:50,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 01:39:50,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 01:39:50,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 01:39:50,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:39:50,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 01:39:50,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 01:39:50,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 01:39:50,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 01:39:50,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 01:39:50,883 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 01:39:50,883 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 01:39:50,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 01:39:50,884 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-31 01:39:51,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 01:39:51,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 01:39:51,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 01:39:51,157 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 01:39:51,159 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 01:39:51,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s5if.c [2022-01-31 01:39:51,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f128ee60c/443207a05b164032bdfb057ad7dfc51a/FLAGc087220aa [2022-01-31 01:39:51,663 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 01:39:51,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s5if.c [2022-01-31 01:39:51,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f128ee60c/443207a05b164032bdfb057ad7dfc51a/FLAGc087220aa [2022-01-31 01:39:51,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f128ee60c/443207a05b164032bdfb057ad7dfc51a [2022-01-31 01:39:51,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 01:39:51,697 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 01:39:51,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 01:39:51,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 01:39:51,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 01:39:51,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:39:51" (1/1) ... [2022-01-31 01:39:51,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17654330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:39:51, skipping insertion in model container [2022-01-31 01:39:51,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:39:51" (1/1) ... [2022-01-31 01:39:51,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 01:39:51,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 01:39:51,881 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/s5if.c[587,600] [2022-01-31 01:39:51,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:39:51,915 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 01:39:51,926 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/s5if.c[587,600] [2022-01-31 01:39:51,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:39:51,945 INFO L208 MainTranslator]: Completed translation [2022-01-31 01:39:51,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:39:51 WrapperNode [2022-01-31 01:39:51,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 01:39:51,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 01:39:51,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 01:39:51,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 01:39:51,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:39:51" (1/1) ... [2022-01-31 01:39:51,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:39:51" (1/1) ... [2022-01-31 01:39:51,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:39:51" (1/1) ... [2022-01-31 01:39:51,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:39:51" (1/1) ... [2022-01-31 01:39:51,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:39:51" (1/1) ... [2022-01-31 01:39:51,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:39:51" (1/1) ... [2022-01-31 01:39:51,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:39:51" (1/1) ... [2022-01-31 01:39:51,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 01:39:51,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 01:39:51,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 01:39:51,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 01:39:51,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:39:51" (1/1) ... [2022-01-31 01:39:51,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:39:52,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:39:52,011 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-31 01:39:52,012 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-31 01:39:52,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 01:39:52,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 01:39:52,044 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 01:39:52,045 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 01:39:52,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 01:39:52,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 01:39:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 01:39:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 01:39:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 01:39:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 01:39:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 01:39:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 01:39:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 01:39:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 01:39:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 01:39:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 01:39:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 01:39:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 01:39:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 01:39:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 01:39:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 01:39:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 01:39:52,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 01:39:52,102 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 01:39:52,110 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 01:39:52,359 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 01:39:52,364 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 01:39:52,364 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 01:39:52,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:39:52 BoogieIcfgContainer [2022-01-31 01:39:52,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 01:39:52,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 01:39:52,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 01:39:52,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 01:39:52,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 01:39:51" (1/3) ... [2022-01-31 01:39:52,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324b594f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:39:52, skipping insertion in model container [2022-01-31 01:39:52,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:39:51" (2/3) ... [2022-01-31 01:39:52,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324b594f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:39:52, skipping insertion in model container [2022-01-31 01:39:52,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:39:52" (3/3) ... [2022-01-31 01:39:52,383 INFO L111 eAbstractionObserver]: Analyzing ICFG s5if.c [2022-01-31 01:39:52,395 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 01:39:52,395 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 01:39:52,482 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 01:39:52,488 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-31 01:39:52,488 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 01:39:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 01:39:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 01:39:52,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:39:52,507 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] [2022-01-31 01:39:52,508 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:39:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:39:52,512 INFO L85 PathProgramCache]: Analyzing trace with hash 863653859, now seen corresponding path program 1 times [2022-01-31 01:39:52,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:39:52,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176329551] [2022-01-31 01:39:52,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:52,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:39:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:52,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:39:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:52,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:39:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:52,773 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-31 01:39:52,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:39:52,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176329551] [2022-01-31 01:39:52,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176329551] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:39:52,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:39:52,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 01:39:52,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769444406] [2022-01-31 01:39:52,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:39:52,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 01:39:52,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:39:52,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 01:39:52,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 01:39:52,812 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:39:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:39:52,925 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-01-31 01:39:52,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 01:39:52,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-01-31 01:39:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:39:52,935 INFO L225 Difference]: With dead ends: 54 [2022-01-31 01:39:52,935 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 01:39:52,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 01:39:52,942 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:39:52,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:39:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 01:39:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 01:39:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-01-31 01:39:52,982 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-01-31 01:39:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:39:52,982 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-01-31 01:39:52,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:39:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-01-31 01:39:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 01:39:52,984 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:39:52,984 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] [2022-01-31 01:39:52,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 01:39:52,986 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:39:52,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:39:52,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1121819297, now seen corresponding path program 1 times [2022-01-31 01:39:52,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:39:52,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227843547] [2022-01-31 01:39:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:52,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:39:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:53,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:39:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:53,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:39:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:53,083 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-31 01:39:53,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:39:53,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227843547] [2022-01-31 01:39:53,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227843547] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:39:53,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:39:53,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 01:39:53,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825437359] [2022-01-31 01:39:53,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:39:53,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 01:39:53,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:39:53,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 01:39:53,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 01:39:53,086 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:39:53,165 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-01-31 01:39:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 01:39:53,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-01-31 01:39:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:39:53,168 INFO L225 Difference]: With dead ends: 40 [2022-01-31 01:39:53,168 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 01:39:53,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 01:39:53,175 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:39:53,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 24 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:39:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 01:39:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-01-31 01:39:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-01-31 01:39:53,188 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2022-01-31 01:39:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:39:53,189 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-01-31 01:39:53,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-01-31 01:39:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 01:39:53,190 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:39:53,190 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:39:53,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 01:39:53,190 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:39:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:39:53,190 INFO L85 PathProgramCache]: Analyzing trace with hash -667943349, now seen corresponding path program 1 times [2022-01-31 01:39:53,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:39:53,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745687063] [2022-01-31 01:39:53,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:53,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:39:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:53,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:39:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:53,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:39:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:53,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:39:53,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745687063] [2022-01-31 01:39:53,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745687063] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:39:53,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753457712] [2022-01-31 01:39:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:53,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:53,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:39:53,634 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-31 01:39:53,635 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-31 01:39:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:53,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 01:39:53,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:39:53,904 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 10 treesize of output 8 [2022-01-31 01:39:53,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:39:53,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:39:54,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:39:54,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2022-01-31 01:39:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:54,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:39:54,568 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:39:54,569 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-01-31 01:39:54,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:39:54,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-01-31 01:39:54,580 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 22 treesize of output 10 [2022-01-31 01:39:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:54,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753457712] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:39:54,637 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:39:54,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 26 [2022-01-31 01:39:54,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208003595] [2022-01-31 01:39:54,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:39:54,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 01:39:54,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:39:54,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 01:39:54,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=550, Unknown=2, NotChecked=0, Total=650 [2022-01-31 01:39:54,641 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 26 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:39:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:39:55,147 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-01-31 01:39:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 01:39:55,148 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-01-31 01:39:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:39:55,150 INFO L225 Difference]: With dead ends: 51 [2022-01-31 01:39:55,150 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 01:39:55,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=1049, Unknown=2, NotChecked=0, Total=1260 [2022-01-31 01:39:55,152 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 43 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:39:55,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 88 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 271 Invalid, 0 Unknown, 142 Unchecked, 0.2s Time] [2022-01-31 01:39:55,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 01:39:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-01-31 01:39:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-01-31 01:39:55,159 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 26 [2022-01-31 01:39:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:39:55,159 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-01-31 01:39:55,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:39:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-01-31 01:39:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 01:39:55,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:39:55,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:39:55,183 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-31 01:39:55,361 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-31 01:39:55,361 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:39:55,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:39:55,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1477289975, now seen corresponding path program 1 times [2022-01-31 01:39:55,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:39:55,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738380453] [2022-01-31 01:39:55,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:55,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:39:55,375 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:39:55,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990603796] [2022-01-31 01:39:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:55,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:55,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:39:55,386 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-31 01:39:55,394 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-31 01:39:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:55,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 01:39:55,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:39:55,475 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-31 01:39:55,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 01:39:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:55,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:39:55,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-01-31 01:39:55,586 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 22 treesize of output 20 [2022-01-31 01:39:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:55,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:39:55,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738380453] [2022-01-31 01:39:55,615 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:39:55,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990603796] [2022-01-31 01:39:55,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990603796] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:39:55,615 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:39:55,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-01-31 01:39:55,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628391598] [2022-01-31 01:39:55,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:39:55,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 01:39:55,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:39:55,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 01:39:55,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-31 01:39:55,617 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:39:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:39:55,683 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-01-31 01:39:55,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 01:39:55,684 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-01-31 01:39:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:39:55,688 INFO L225 Difference]: With dead ends: 50 [2022-01-31 01:39:55,688 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 01:39:55,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 01:39:55,695 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:39:55,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 124 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:39:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 01:39:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-01-31 01:39:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-01-31 01:39:55,706 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 26 [2022-01-31 01:39:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:39:55,706 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-01-31 01:39:55,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:39:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-01-31 01:39:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 01:39:55,707 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:39:55,707 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, 1, 1] [2022-01-31 01:39:55,736 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-31 01:39:55,927 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-31 01:39:55,928 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:39:55,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:39:55,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1722810441, now seen corresponding path program 2 times [2022-01-31 01:39:55,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:39:55,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590766238] [2022-01-31 01:39:55,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:55,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:39:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:39:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:39:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:55,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:39:55,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590766238] [2022-01-31 01:39:55,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590766238] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:39:55,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399230657] [2022-01-31 01:39:55,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:39:55,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:55,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:39:55,999 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-31 01:39:56,041 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-31 01:39:56,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:39:56,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:39:56,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:39:56,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:39:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:56,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:39:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:56,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399230657] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:39:56,273 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:39:56,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 01:39:56,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631091630] [2022-01-31 01:39:56,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:39:56,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:39:56,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:39:56,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:39:56,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:39:56,276 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:39:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:39:56,425 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-01-31 01:39:56,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:39:56,426 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-01-31 01:39:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:39:56,427 INFO L225 Difference]: With dead ends: 45 [2022-01-31 01:39:56,427 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 01:39:56,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 01:39:56,428 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:39:56,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 63 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:39:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 01:39:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-01-31 01:39:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-01-31 01:39:56,433 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2022-01-31 01:39:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:39:56,434 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-01-31 01:39:56,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:39:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-01-31 01:39:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 01:39:56,435 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:39:56,435 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:39:56,461 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-31 01:39:56,659 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-31 01:39:56,660 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:39:56,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:39:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1559730403, now seen corresponding path program 3 times [2022-01-31 01:39:56,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:39:56,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727277026] [2022-01-31 01:39:56,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:56,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:39:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:56,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:39:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:56,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:39:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:56,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:39:56,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727277026] [2022-01-31 01:39:56,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727277026] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:39:56,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074671262] [2022-01-31 01:39:56,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:39:56,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:56,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:39:56,769 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-31 01:39:56,770 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-31 01:39:56,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 01:39:56,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:39:56,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:39:56,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:39:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:56,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:39:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:56,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074671262] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:39:56,960 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:39:56,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 01:39:56,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89965253] [2022-01-31 01:39:56,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:39:56,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:39:56,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:39:56,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:39:56,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:39:56,962 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:39:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:39:57,085 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-01-31 01:39:57,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:39:57,086 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-01-31 01:39:57,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:39:57,087 INFO L225 Difference]: With dead ends: 49 [2022-01-31 01:39:57,087 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 01:39:57,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:39:57,088 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:39:57,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 54 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:39:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 01:39:57,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-01-31 01:39:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-01-31 01:39:57,093 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2022-01-31 01:39:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:39:57,093 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-01-31 01:39:57,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:39:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-01-31 01:39:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 01:39:57,094 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:39:57,094 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:39:57,124 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-31 01:39:57,294 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-31 01:39:57,295 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:39:57,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:39:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1063218725, now seen corresponding path program 4 times [2022-01-31 01:39:57,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:39:57,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396128667] [2022-01-31 01:39:57,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:57,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:39:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:57,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:39:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:57,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:39:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:57,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:39:57,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396128667] [2022-01-31 01:39:57,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396128667] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:39:57,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316426035] [2022-01-31 01:39:57,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:39:57,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:57,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:39:57,792 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-31 01:39:57,793 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-31 01:39:57,853 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:39:57,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:39:57,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 01:39:57,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:39:57,889 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-31 01:39:57,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:57,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:39:57,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:57,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:39:58,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:58,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:39:58,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:58,331 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:39:58,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-01-31 01:39:58,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:58,531 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:39:58,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2022-01-31 01:39:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:58,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:00,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_47 Int) (v_ArrVal_153 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_44 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_153))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_153 (+ main_~a~0.offset (* v_main_~i~0_47 4)))) (.cse2 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_44 4))))) (or (not (= .cse0 5)) (not (= .cse1 5)) (= (* 5 ~N~0) (+ .cse0 .cse1 .cse2)))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:40:00,476 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_main_~i~0_47 Int) (v_ArrVal_153 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_44 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_153))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_153 (+ main_~a~0.offset (* v_main_~i~0_47 4)))) (.cse2 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_44 4))))) (or (not (= .cse0 5)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= .cse1 5)) (= (* 5 ~N~0) (+ .cse0 .cse1 .cse2)) (< (+ c_main_~i~0 2) ~N~0))))))) is different from false [2022-01-31 01:40:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-31 01:40:00,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316426035] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:00,576 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:00,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 37 [2022-01-31 01:40:00,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606554686] [2022-01-31 01:40:00,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:00,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-31 01:40:00,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:00,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-31 01:40:00,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1070, Unknown=2, NotChecked=134, Total=1332 [2022-01-31 01:40:00,578 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 37 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 34 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:00,944 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-01-31 01:40:00,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:40:00,945 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 34 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-01-31 01:40:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:00,946 INFO L225 Difference]: With dead ends: 49 [2022-01-31 01:40:00,946 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 01:40:00,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=190, Invalid=1456, Unknown=2, NotChecked=158, Total=1806 [2022-01-31 01:40:00,947 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:00,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 136 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 254 Invalid, 0 Unknown, 130 Unchecked, 0.2s Time] [2022-01-31 01:40:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 01:40:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-01-31 01:40:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-31 01:40:00,954 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2022-01-31 01:40:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:00,954 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-31 01:40:00,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 34 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-31 01:40:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 01:40:00,955 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:00,955 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:40:00,987 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-31 01:40:01,167 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-31 01:40:01,168 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:01,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:01,168 INFO L85 PathProgramCache]: Analyzing trace with hash 253872099, now seen corresponding path program 1 times [2022-01-31 01:40:01,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:01,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771023450] [2022-01-31 01:40:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:01,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:01,181 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:40:01,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793943507] [2022-01-31 01:40:01,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:01,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:01,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:01,183 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-31 01:40:01,184 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-31 01:40:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:01,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-31 01:40:01,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:01,310 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 13 treesize of output 9 [2022-01-31 01:40:01,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:01,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:40:01,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 01:40:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:01,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:01,482 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_190) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:40:01,495 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_190) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:40:01,505 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:40:01,506 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-01-31 01:40:01,511 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:40:01,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:40:01,515 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 11 treesize of output 7 [2022-01-31 01:40:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-31 01:40:01,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:01,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771023450] [2022-01-31 01:40:01,589 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:40:01,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793943507] [2022-01-31 01:40:01,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793943507] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:01,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:40:01,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-01-31 01:40:01,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639619090] [2022-01-31 01:40:01,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:01,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:40:01,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:01,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:40:01,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2022-01-31 01:40:01,591 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:01,775 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-01-31 01:40:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 01:40:01,775 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-01-31 01:40:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:01,776 INFO L225 Difference]: With dead ends: 53 [2022-01-31 01:40:01,776 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 01:40:01,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=215, Unknown=2, NotChecked=62, Total=342 [2022-01-31 01:40:01,777 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:01,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 202 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 138 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-01-31 01:40:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 01:40:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-01-31 01:40:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-01-31 01:40:01,784 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 31 [2022-01-31 01:40:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:01,784 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-01-31 01:40:01,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-01-31 01:40:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 01:40:01,785 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:01,785 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:40:01,811 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-31 01:40:02,007 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-31 01:40:02,008 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash 656866023, now seen corresponding path program 5 times [2022-01-31 01:40:02,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:02,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576003420] [2022-01-31 01:40:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:02,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:02,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:02,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576003420] [2022-01-31 01:40:02,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576003420] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:02,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84632559] [2022-01-31 01:40:02,105 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:40:02,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:02,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:02,106 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-31 01:40:02,107 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-31 01:40:02,161 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 01:40:02,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:02,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:40:02,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:02,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:02,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84632559] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:02,348 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:02,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 01:40:02,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136588378] [2022-01-31 01:40:02,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:02,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:40:02,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:02,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:40:02,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:40:02,349 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:02,551 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-01-31 01:40:02,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 01:40:02,552 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-01-31 01:40:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:02,553 INFO L225 Difference]: With dead ends: 53 [2022-01-31 01:40:02,553 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 01:40:02,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 01:40:02,554 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:02,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 50 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:40:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 01:40:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-01-31 01:40:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-01-31 01:40:02,560 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2022-01-31 01:40:02,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:02,560 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-01-31 01:40:02,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-01-31 01:40:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 01:40:02,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:02,561 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:40:02,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:02,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:02,776 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash 641786569, now seen corresponding path program 6 times [2022-01-31 01:40:02,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:02,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830407612] [2022-01-31 01:40:02,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:02,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:02,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:02,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:02,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830407612] [2022-01-31 01:40:02,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830407612] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:02,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373076146] [2022-01-31 01:40:02,876 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:40:02,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:02,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:02,877 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:02,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 01:40:02,954 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 01:40:02,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:02,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:40:02,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:03,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:03,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373076146] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:03,159 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:03,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 01:40:03,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042140061] [2022-01-31 01:40:03,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:03,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:40:03,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:03,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:40:03,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:40:03,160 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:03,290 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-01-31 01:40:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 01:40:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-01-31 01:40:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:03,292 INFO L225 Difference]: With dead ends: 57 [2022-01-31 01:40:03,292 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 01:40:03,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 01:40:03,293 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:03,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 39 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:40:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 01:40:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-01-31 01:40:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-01-31 01:40:03,302 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2022-01-31 01:40:03,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:03,302 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-01-31 01:40:03,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-01-31 01:40:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 01:40:03,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:03,303 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:40:03,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:03,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 01:40:03,524 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:03,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:03,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1793718585, now seen corresponding path program 7 times [2022-01-31 01:40:03,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:03,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318150252] [2022-01-31 01:40:03,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:03,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:04,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:04,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:04,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:04,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318150252] [2022-01-31 01:40:04,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318150252] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:04,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090708798] [2022-01-31 01:40:04,030 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:40:04,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:04,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:04,032 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:04,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 01:40:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:04,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-31 01:40:04,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:04,132 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-31 01:40:04,138 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 10 treesize of output 8 [2022-01-31 01:40:04,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:40:04,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:40:04,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:40:04,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:40:04,458 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:40:04,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-01-31 01:40:04,573 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:40:04,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:40:04,728 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:40:04,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 23 [2022-01-31 01:40:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:04,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:11,376 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_303 (Array Int Int)) (v_main_~i~0_91 Int) (main_~a~0.offset Int) (v_main_~i~0_88 Int) (v_main_~i~0_86 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_303))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_303 (+ main_~a~0.offset (* v_main_~i~0_91 4)))) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ (* v_main_~i~0_88 4) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_86 4))))) (or (not (= .cse0 5)) (= (+ .cse1 .cse0 .cse2 .cse3) (* 5 ~N~0)) (not (= 5 .cse2)) (not (= .cse1 5))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:40:11,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (v_main_~i~0_91 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_88 Int) (v_main_~i~0_86 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_303))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_303 (+ main_~a~0.offset (* v_main_~i~0_91 4)))) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ (* v_main_~i~0_88 4) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_86 4))))) (or (not (= .cse0 5)) (= (+ .cse1 .cse0 .cse2 .cse3) (* 5 ~N~0)) (not (= 5 .cse2)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= .cse1 5)) (< (+ c_main_~i~0 2) ~N~0)))))))) is different from false [2022-01-31 01:40:11,832 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (v_main_~i~0_91 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_88 Int) (v_main_~i~0_86 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_303))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_303 (+ main_~a~0.offset (* v_main_~i~0_91 4)))) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ (* v_main_~i~0_88 4) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_86 4))))) (or (not (= .cse0 5)) (< (+ c_main_~i~0 3) ~N~0) (= (+ .cse1 .cse0 .cse2 .cse3) (* 5 ~N~0)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= 5 .cse2)) (not (= .cse1 5))))))))) is different from false [2022-01-31 01:40:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-31 01:40:12,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090708798] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:12,020 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:12,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 42 [2022-01-31 01:40:12,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650071301] [2022-01-31 01:40:12,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:12,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 01:40:12,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:12,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 01:40:12,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1354, Unknown=5, NotChecked=228, Total=1722 [2022-01-31 01:40:12,022 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 42 states, 40 states have (on average 1.6) internal successors, (64), 39 states have internal predecessors, (64), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:12,328 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-01-31 01:40:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 01:40:12,329 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.6) internal successors, (64), 39 states have internal predecessors, (64), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-01-31 01:40:12,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:12,330 INFO L225 Difference]: With dead ends: 56 [2022-01-31 01:40:12,330 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 01:40:12,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=181, Invalid=1718, Unknown=5, NotChecked=258, Total=2162 [2022-01-31 01:40:12,331 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:12,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 207 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 256 Invalid, 0 Unknown, 231 Unchecked, 0.1s Time] [2022-01-31 01:40:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 01:40:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-01-31 01:40:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-01-31 01:40:12,344 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-01-31 01:40:12,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:12,344 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-01-31 01:40:12,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.6) internal successors, (64), 39 states have internal predecessors, (64), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:12,344 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-01-31 01:40:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 01:40:12,347 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:12,347 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-31 01:40:12,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:12,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:12,547 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:12,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:12,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1691902085, now seen corresponding path program 2 times [2022-01-31 01:40:12,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:12,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676811078] [2022-01-31 01:40:12,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:12,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:12,559 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:40:12,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1250720647] [2022-01-31 01:40:12,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:40:12,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:12,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:12,561 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:12,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 01:40:12,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:40:12,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:12,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 01:40:12,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:12,691 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 13 treesize of output 9 [2022-01-31 01:40:12,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:12,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:40:12,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:12,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:40:12,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:40:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:12,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:12,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_351) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:40:12,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_351) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 5)) is different from false [2022-01-31 01:40:12,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_351) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) is different from false [2022-01-31 01:40:12,915 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:40:12,916 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-01-31 01:40:12,920 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:40:12,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:40:12,924 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 11 treesize of output 7 [2022-01-31 01:40:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-01-31 01:40:13,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676811078] [2022-01-31 01:40:13,014 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:40:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250720647] [2022-01-31 01:40:13,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250720647] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:13,014 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:40:13,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-01-31 01:40:13,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23637231] [2022-01-31 01:40:13,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:13,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 01:40:13,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:13,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 01:40:13,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-01-31 01:40:13,016 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:13,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:13,227 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-01-31 01:40:13,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 01:40:13,228 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-01-31 01:40:13,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:13,229 INFO L225 Difference]: With dead ends: 61 [2022-01-31 01:40:13,229 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 01:40:13,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=349, Unknown=3, NotChecked=120, Total=552 [2022-01-31 01:40:13,230 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:13,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 232 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 206 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2022-01-31 01:40:13,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 01:40:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-01-31 01:40:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-01-31 01:40:13,237 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 36 [2022-01-31 01:40:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:13,237 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-01-31 01:40:13,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-01-31 01:40:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 01:40:13,238 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:13,238 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:40:13,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:13,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 01:40:13,443 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:13,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:13,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1556995259, now seen corresponding path program 8 times [2022-01-31 01:40:13,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:13,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778388388] [2022-01-31 01:40:13,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:13,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:13,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:13,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:13,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:13,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778388388] [2022-01-31 01:40:13,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778388388] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:13,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381634525] [2022-01-31 01:40:13,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:40:13,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:13,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:13,549 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:13,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 01:40:13,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:40:13,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:13,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 01:40:13,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:13,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:13,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381634525] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:13,815 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:13,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 01:40:13,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911766797] [2022-01-31 01:40:13,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:13,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 01:40:13,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:13,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 01:40:13,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 01:40:13,816 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:14,061 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-01-31 01:40:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:40:14,061 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-01-31 01:40:14,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:14,062 INFO L225 Difference]: With dead ends: 61 [2022-01-31 01:40:14,062 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 01:40:14,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:40:14,063 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:14,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 79 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:40:14,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 01:40:14,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-01-31 01:40:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-01-31 01:40:14,069 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 38 [2022-01-31 01:40:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:14,069 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-01-31 01:40:14,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-01-31 01:40:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 01:40:14,070 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:14,070 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:40:14,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:14,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 01:40:14,292 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:14,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1305678105, now seen corresponding path program 9 times [2022-01-31 01:40:14,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:14,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236910296] [2022-01-31 01:40:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:14,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:14,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:14,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:14,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:14,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236910296] [2022-01-31 01:40:14,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236910296] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:14,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735163701] [2022-01-31 01:40:14,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:40:14,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:14,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:14,411 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:14,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 01:40:14,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 01:40:14,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:14,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 01:40:14,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:14,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:14,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735163701] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:14,699 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:14,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 01:40:14,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838669173] [2022-01-31 01:40:14,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:14,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 01:40:14,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:14,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 01:40:14,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 01:40:14,700 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:14,855 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-01-31 01:40:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 01:40:14,855 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-31 01:40:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:14,856 INFO L225 Difference]: With dead ends: 65 [2022-01-31 01:40:14,856 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 01:40:14,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 01:40:14,857 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 63 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:14,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 41 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:40:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 01:40:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-01-31 01:40:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-01-31 01:40:14,863 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2022-01-31 01:40:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:14,863 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-01-31 01:40:14,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-01-31 01:40:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 01:40:14,864 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:14,864 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:40:14,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:15,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 01:40:15,075 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:15,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:15,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1417373271, now seen corresponding path program 10 times [2022-01-31 01:40:15,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:15,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90751374] [2022-01-31 01:40:15,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:15,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:15,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:15,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:15,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:15,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90751374] [2022-01-31 01:40:15,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90751374] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:15,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534895100] [2022-01-31 01:40:15,663 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:40:15,663 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:15,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:15,668 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:15,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 01:40:15,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:40:15,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:15,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-31 01:40:15,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:15,770 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-31 01:40:15,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:15,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:40:15,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:15,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:40:15,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:15,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:40:15,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:15,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:40:16,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:16,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:40:16,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:16,315 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:40:16,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-01-31 01:40:16,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:16,472 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:40:16,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:40:16,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:16,626 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:40:16,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:40:16,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:16,766 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:40:16,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2022-01-31 01:40:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:16,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:35,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ c_main_~i~0 1) ~N~0) (forall ((v_main_~i~0_146 Int) (v_main_~i~0_144 Int) (v_main_~i~0_151 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_148 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_151)))) (.cse4 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_148))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_146))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4 .cse0))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_144) main_~a~0.offset)))) (or (not (= 5 .cse0)) (= (* 5 ~N~0) (+ .cse1 .cse2 .cse3 .cse4 .cse0)) (not (= 5 .cse2)) (not (= 5 .cse3)) (not (= .cse1 5)))))))))) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:40:35,427 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_146 Int) (v_main_~i~0_144 Int) (v_main_~i~0_151 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_148 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_151)))) (.cse4 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_148))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_146))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4 .cse0))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_144) main_~a~0.offset)))) (or (not (= 5 .cse0)) (= (* 5 ~N~0) (+ .cse1 .cse2 .cse3 .cse4 .cse0)) (not (= 5 .cse2)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= 5 .cse3)) (not (= .cse1 5)) (< (+ c_main_~i~0 2) ~N~0))))))))) is different from false [2022-01-31 01:40:36,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_146 Int) (v_main_~i~0_144 Int) (v_main_~i~0_151 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_148 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_151)))) (.cse4 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_148))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_146))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4 .cse0))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_144) main_~a~0.offset)))) (or (not (= 5 .cse0)) (< (+ c_main_~i~0 3) ~N~0) (= (* 5 ~N~0) (+ .cse1 .cse2 .cse3 .cse4 .cse0)) (not (= 5 .cse2)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= 5 .cse3)) (not (= .cse1 5)))))))))) is different from false [2022-01-31 01:40:37,094 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_146 Int) (v_main_~i~0_144 Int) (v_main_~i~0_151 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_148 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_151)))) (.cse4 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_148))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_146))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4 .cse0))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_144) main_~a~0.offset)))) (or (not (= 5 .cse0)) (< (+ c_main_~i~0 4) ~N~0) (= (* 5 ~N~0) (+ .cse1 .cse2 .cse3 .cse4 .cse0)) (not (= 5 .cse2)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= 5 .cse3)) (not (= .cse1 5)))))))))) is different from false [2022-01-31 01:40:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-01-31 01:40:37,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534895100] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:37,503 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:37,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 20] total 57 [2022-01-31 01:40:37,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606166941] [2022-01-31 01:40:37,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:37,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-01-31 01:40:37,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:37,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-01-31 01:40:37,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2570, Unknown=11, NotChecked=420, Total=3192 [2022-01-31 01:40:37,505 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 57 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 54 states have internal predecessors, (85), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:38,179 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-01-31 01:40:38,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 01:40:38,180 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 54 states have internal predecessors, (85), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-01-31 01:40:38,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:38,180 INFO L225 Difference]: With dead ends: 66 [2022-01-31 01:40:38,180 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 01:40:38,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=246, Invalid=3065, Unknown=11, NotChecked=460, Total=3782 [2022-01-31 01:40:38,182 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 589 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:38,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 295 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 435 Invalid, 0 Unknown, 589 Unchecked, 0.2s Time] [2022-01-31 01:40:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 01:40:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2022-01-31 01:40:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-01-31 01:40:38,190 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 41 [2022-01-31 01:40:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:38,191 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-01-31 01:40:38,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 54 states have internal predecessors, (85), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-01-31 01:40:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 01:40:38,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:38,191 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:40:38,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:38,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-31 01:40:38,414 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:38,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2068247399, now seen corresponding path program 3 times [2022-01-31 01:40:38,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:38,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781338212] [2022-01-31 01:40:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:38,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:38,429 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:40:38,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [653111038] [2022-01-31 01:40:38,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:40:38,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:38,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:38,431 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:38,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 01:40:38,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 01:40:38,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:38,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 01:40:38,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:38,581 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 15 treesize of output 11 [2022-01-31 01:40:38,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:38,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:40:38,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:38,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:40:38,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:38,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:40:38,843 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:40:38,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-01-31 01:40:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:38,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:39,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_main_~i~0_166 Int)) (or (not (<= v_main_~i~0_166 (+ c_main_~i~0 1))) (< (+ v_main_~i~0_166 1) c_~N~0) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_546) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_166)))))) is different from false [2022-01-31 01:40:39,064 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_main_~i~0_166 Int)) (or (< (+ c_main_~i~0 2) v_main_~i~0_166) (< (+ v_main_~i~0_166 1) c_~N~0) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_546) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_166)))))) is different from false [2022-01-31 01:40:39,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_main_~i~0_166 Int)) (or (< (+ c_main_~i~0 3) v_main_~i~0_166) (< (+ v_main_~i~0_166 1) c_~N~0) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_546) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_166)))))) is different from false [2022-01-31 01:40:39,127 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_main_~i~0_166 Int)) (or (< (+ v_main_~i~0_166 1) c_~N~0) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_546) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_166)))) (< 3 v_main_~i~0_166))) is different from false [2022-01-31 01:40:39,171 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:40:39,171 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-31 01:40:39,178 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:40:39,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-01-31 01:40:39,182 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 13 treesize of output 7 [2022-01-31 01:40:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 27 not checked. [2022-01-31 01:40:39,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:39,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781338212] [2022-01-31 01:40:39,338 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:40:39,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653111038] [2022-01-31 01:40:39,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653111038] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:39,339 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:40:39,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-01-31 01:40:39,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956863411] [2022-01-31 01:40:39,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:39,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 01:40:39,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:39,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 01:40:39,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=427, Unknown=4, NotChecked=188, Total=756 [2022-01-31 01:40:39,340 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:39,619 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-01-31 01:40:39,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 01:40:39,620 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-01-31 01:40:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:39,620 INFO L225 Difference]: With dead ends: 67 [2022-01-31 01:40:39,621 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 01:40:39,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=723, Unknown=4, NotChecked=244, Total=1190 [2022-01-31 01:40:39,622 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:39,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 234 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 87 Unchecked, 0.1s Time] [2022-01-31 01:40:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 01:40:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-01-31 01:40:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-01-31 01:40:39,631 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 41 [2022-01-31 01:40:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:39,631 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-01-31 01:40:39,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-01-31 01:40:39,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 01:40:39,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:39,632 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:40:39,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-01-31 01:40:39,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:39,833 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:39,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:39,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1382245397, now seen corresponding path program 11 times [2022-01-31 01:40:39,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:39,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563407391] [2022-01-31 01:40:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:39,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:39,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:39,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:39,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563407391] [2022-01-31 01:40:39,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563407391] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:39,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439774045] [2022-01-31 01:40:39,971 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:40:39,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:39,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:39,980 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:39,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 01:40:40,119 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 01:40:40,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:40,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 01:40:40,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:40,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:40,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439774045] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:40,408 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:40,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 01:40:40,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839177524] [2022-01-31 01:40:40,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:40,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 01:40:40,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:40,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 01:40:40,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:40:40,410 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:40,741 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2022-01-31 01:40:40,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 01:40:40,742 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-01-31 01:40:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:40,742 INFO L225 Difference]: With dead ends: 71 [2022-01-31 01:40:40,742 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 01:40:40,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-01-31 01:40:40,743 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:40,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 85 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:40:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 01:40:40,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2022-01-31 01:40:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-01-31 01:40:40,750 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 43 [2022-01-31 01:40:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:40,751 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-01-31 01:40:40,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-01-31 01:40:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 01:40:40,751 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:40,751 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:40:40,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:40,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-31 01:40:40,959 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:40,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:40,960 INFO L85 PathProgramCache]: Analyzing trace with hash 532928709, now seen corresponding path program 12 times [2022-01-31 01:40:40,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:40,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043424546] [2022-01-31 01:40:40,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:40,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:41,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:41,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:41,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:41,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043424546] [2022-01-31 01:40:41,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043424546] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:41,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636190979] [2022-01-31 01:40:41,115 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:40:41,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:41,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:41,116 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:41,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-31 01:40:41,208 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 01:40:41,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:41,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 01:40:41,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:41,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:41,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636190979] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:41,448 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:41,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 01:40:41,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183265206] [2022-01-31 01:40:41,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:41,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 01:40:41,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:41,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 01:40:41,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:40:41,449 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:41,631 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-01-31 01:40:41,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:40:41,633 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-01-31 01:40:41,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:41,633 INFO L225 Difference]: With dead ends: 73 [2022-01-31 01:40:41,633 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 01:40:41,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:40:41,634 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:41,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 60 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:40:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 01:40:41,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-01-31 01:40:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-01-31 01:40:41,640 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2022-01-31 01:40:41,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:41,641 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-01-31 01:40:41,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-01-31 01:40:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:40:41,641 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:41,641 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:40:41,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:41,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-31 01:40:41,842 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:41,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:41,843 INFO L85 PathProgramCache]: Analyzing trace with hash -944597181, now seen corresponding path program 13 times [2022-01-31 01:40:41,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:41,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284015669] [2022-01-31 01:40:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:41,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:42,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:42,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:42,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:42,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284015669] [2022-01-31 01:40:42,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284015669] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:42,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823343788] [2022-01-31 01:40:42,686 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:40:42,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:42,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:42,687 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:42,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-31 01:40:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:42,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-31 01:40:42,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:42,791 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-31 01:40:42,798 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 10 treesize of output 8 [2022-01-31 01:40:42,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:40:42,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:40:42,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:40:42,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:40:42,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:40:43,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:40:43,199 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:40:43,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-01-31 01:40:43,346 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:40:43,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:40:43,528 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:40:43,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 65 [2022-01-31 01:40:43,725 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:40:43,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 58 [2022-01-31 01:40:44,005 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:40:44,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 32 [2022-01-31 01:40:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:44,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:41:42,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_223 Int) (v_main_~i~0_232 Int) (main_~a~0.offset Int) (v_main_~i~0_229 Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_227 Int) (v_main_~i~0_225 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_232)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_229))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_227))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_225))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse1 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_223))))) (or (not (= .cse0 5)) (not (= .cse1 5)) (not (= 5 .cse2)) (not (= 5 .cse3)) (not (= .cse4 5)) (= (* 5 ~N~0) (+ .cse4 .cse5 .cse1 .cse0 .cse3 .cse2))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:41:43,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_223 Int) (v_main_~i~0_232 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_229 Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_227 Int) (v_main_~i~0_225 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_232)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_229))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_227))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_225))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse1 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_223))))) (or (not (= .cse0 5)) (not (= .cse1 5)) (not (= 5 .cse2)) (not (= 5 .cse3)) (not (= .cse4 5)) (not (< (+ c_main_~i~0 1) ~N~0)) (= (* 5 ~N~0) (+ .cse4 .cse5 .cse1 .cse0 .cse3 .cse2)) (< (+ c_main_~i~0 2) ~N~0)))))))))) is different from false [2022-01-31 01:41:46,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_223 Int) (v_main_~i~0_232 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_229 Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_227 Int) (v_main_~i~0_225 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_232)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_229))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_227))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_225))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse1 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_223))))) (or (not (= .cse0 5)) (not (= .cse1 5)) (< (+ c_main_~i~0 3) ~N~0) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= 5 .cse2)) (not (= 5 .cse3)) (not (= .cse4 5)) (= (* 5 ~N~0) (+ .cse4 .cse5 .cse1 .cse0 .cse3 .cse2))))))))))) is different from false [2022-01-31 01:41:49,714 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_223 Int) (v_main_~i~0_232 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_229 Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_227 Int) (v_main_~i~0_225 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_232)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_229))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_227))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_225))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse1 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_223))))) (or (not (= .cse0 5)) (< (+ c_main_~i~0 4) ~N~0) (not (= .cse1 5)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= 5 .cse2)) (not (= 5 .cse3)) (not (= .cse4 5)) (= (* 5 ~N~0) (+ .cse4 .cse5 .cse1 .cse0 .cse3 .cse2))))))))))) is different from false [2022-01-31 01:41:53,906 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_223 Int) (v_main_~i~0_232 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_229 Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_227 Int) (v_main_~i~0_225 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_232)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_229))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_227))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_225))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse1 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_223))))) (or (not (= .cse0 5)) (not (= .cse1 5)) (< (+ c_main_~i~0 5) ~N~0) (not (= 5 .cse2)) (not (= 5 .cse3)) (not (< (+ c_main_~i~0 4) ~N~0)) (not (= .cse4 5)) (= (* 5 ~N~0) (+ .cse4 .cse5 .cse1 .cse0 .cse3 .cse2))))))))))) is different from false [2022-01-31 01:41:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-01-31 01:41:56,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823343788] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:41:56,053 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:41:56,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 23] total 62 [2022-01-31 01:41:56,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714317463] [2022-01-31 01:41:56,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:41:56,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-01-31 01:41:56,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:41:56,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-01-31 01:41:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2972, Unknown=30, NotChecked=570, Total=3782 [2022-01-31 01:41:56,056 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 62 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 59 states have internal predecessors, (91), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:41:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:41:56,836 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2022-01-31 01:41:56,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 01:41:56,836 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 59 states have internal predecessors, (91), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-01-31 01:41:56,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:41:56,837 INFO L225 Difference]: With dead ends: 73 [2022-01-31 01:41:56,837 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 01:41:56,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 65 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 54.1s TimeCoverageRelationStatistics Valid=272, Invalid=3624, Unknown=30, NotChecked=630, Total=4556 [2022-01-31 01:41:56,838 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:41:56,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 255 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 516 Invalid, 0 Unknown, 530 Unchecked, 0.3s Time] [2022-01-31 01:41:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 01:41:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-01-31 01:41:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:41:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-01-31 01:41:56,848 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 46 [2022-01-31 01:41:56,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:41:56,848 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-01-31 01:41:56,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 59 states have internal predecessors, (91), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:41:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-01-31 01:41:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:41:56,849 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:41:56,849 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:41:56,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-31 01:41:57,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:41:57,060 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:41:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:41:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1753943807, now seen corresponding path program 4 times [2022-01-31 01:41:57,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:41:57,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746342367] [2022-01-31 01:41:57,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:41:57,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:41:57,069 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:41:57,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216581066] [2022-01-31 01:41:57,070 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:41:57,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:41:57,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:41:57,071 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:41:57,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-31 01:41:57,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:41:57,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:41:57,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-31 01:41:57,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:41:57,252 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 13 treesize of output 9 [2022-01-31 01:41:57,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:57,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:41:57,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:57,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:41:57,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:57,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:41:57,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:57,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:41:57,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:41:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:41:57,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:41:57,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_779) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:41:57,526 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_779) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 01:41:57,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_779) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)))) is different from false [2022-01-31 01:41:57,544 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_779) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 16)) 5)) is different from false [2022-01-31 01:41:57,553 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_779) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) is different from false [2022-01-31 01:41:57,562 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:41:57,562 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-01-31 01:41:57,567 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:41:57,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:41:57,570 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 11 treesize of output 7 [2022-01-31 01:41:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 35 not checked. [2022-01-31 01:41:57,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:41:57,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746342367] [2022-01-31 01:41:57,700 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:41:57,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216581066] [2022-01-31 01:41:57,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216581066] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:41:57,700 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:41:57,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-01-31 01:41:57,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27781986] [2022-01-31 01:41:57,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:41:57,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:41:57,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:41:57,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:41:57,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=405, Unknown=5, NotChecked=220, Total=702 [2022-01-31 01:41:57,702 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 27 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:41:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:41:58,061 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-01-31 01:41:58,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 01:41:58,061 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 27 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-01-31 01:41:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:41:58,062 INFO L225 Difference]: With dead ends: 77 [2022-01-31 01:41:58,062 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 01:41:58,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=713, Unknown=5, NotChecked=290, Total=1122 [2022-01-31 01:41:58,063 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:41:58,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 280 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 383 Invalid, 0 Unknown, 169 Unchecked, 0.2s Time] [2022-01-31 01:41:58,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 01:41:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-01-31 01:41:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.1) internal successors, (66), 60 states have internal predecessors, (66), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:41:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-01-31 01:41:58,075 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 46 [2022-01-31 01:41:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:41:58,075 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-01-31 01:41:58,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 27 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:41:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-01-31 01:41:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:41:58,076 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:41:58,076 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:41:58,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-31 01:41:58,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:41:58,291 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:41:58,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:41:58,292 INFO L85 PathProgramCache]: Analyzing trace with hash -243532603, now seen corresponding path program 5 times [2022-01-31 01:41:58,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:41:58,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945932370] [2022-01-31 01:41:58,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:41:58,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:41:58,300 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:41:58,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2055890924] [2022-01-31 01:41:58,301 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:41:58,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:41:58,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:41:58,302 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:41:58,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-31 01:41:58,413 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 01:41:58,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:41:58,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-31 01:41:58,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:41:58,433 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 10 treesize of output 8 [2022-01-31 01:41:58,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 01:41:58,517 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 01:41:58,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 01:41:58,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:41:58,593 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:41:58,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:41:58,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:41:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 01:41:58,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:41:58,718 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 5)) is different from false [2022-01-31 01:41:58,724 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 01:41:58,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)) 5)) is different from false [2022-01-31 01:41:58,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 5)) is different from false [2022-01-31 01:41:58,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_838 Int) (v_ArrVal_841 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_838)) |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 5)) is different from false [2022-01-31 01:41:58,761 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_272 Int)) (or (forall ((v_ArrVal_838 Int) (v_ArrVal_841 (Array Int Int))) (= 5 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_272)) v_ArrVal_838)) |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_272)))) is different from false [2022-01-31 01:41:58,779 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-31 01:41:58,779 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-01-31 01:41:58,785 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:41:58,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:41:58,787 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 11 treesize of output 7 [2022-01-31 01:41:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 31 not checked. [2022-01-31 01:41:58,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:41:58,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945932370] [2022-01-31 01:41:58,840 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:41:58,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055890924] [2022-01-31 01:41:58,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055890924] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:41:58,840 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:41:58,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-01-31 01:41:58,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445386853] [2022-01-31 01:41:58,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:41:58,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 01:41:58,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:41:58,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 01:41:58,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=232, Unknown=6, NotChecked=210, Total=506 [2022-01-31 01:41:58,842 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:42:00,922 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_272 Int)) (or (forall ((v_ArrVal_838 Int) (v_ArrVal_841 (Array Int Int))) (= 5 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_272)) v_ArrVal_838)) |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_272)))) (= (+ c_main_~i~0 (- 2)) 1) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= 5 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)))) is different from false [2022-01-31 01:42:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:42:01,098 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-01-31 01:42:01,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 01:42:01,099 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-01-31 01:42:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:42:01,099 INFO L225 Difference]: With dead ends: 79 [2022-01-31 01:42:01,099 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 01:42:01,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=92, Invalid=435, Unknown=7, NotChecked=336, Total=870 [2022-01-31 01:42:01,100 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:42:01,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 270 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 290 Invalid, 0 Unknown, 178 Unchecked, 0.1s Time] [2022-01-31 01:42:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 01:42:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-01-31 01:42:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:42:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-01-31 01:42:01,109 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 46 [2022-01-31 01:42:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:42:01,109 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-01-31 01:42:01,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:42:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-01-31 01:42:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 01:42:01,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:42:01,110 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:42:01,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-31 01:42:01,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:42:01,312 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:42:01,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:42:01,312 INFO L85 PathProgramCache]: Analyzing trace with hash 787197505, now seen corresponding path program 14 times [2022-01-31 01:42:01,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:42:01,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460667605] [2022-01-31 01:42:01,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:42:01,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:42:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:42:01,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:42:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:42:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:42:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:42:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:42:01,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:42:01,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460667605] [2022-01-31 01:42:01,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460667605] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:42:01,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814304369] [2022-01-31 01:42:01,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:42:01,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:42:01,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:42:01,478 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:42:01,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-31 01:42:01,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:42:01,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:42:01,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 01:42:01,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:42:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:42:01,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:42:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:42:01,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814304369] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:42:01,903 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:42:01,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 01:42:01,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515449294] [2022-01-31 01:42:01,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:42:01,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 01:42:01,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:42:01,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 01:42:01,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 01:42:01,905 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:42:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:42:02,295 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-01-31 01:42:02,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 01:42:02,297 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-01-31 01:42:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:42:02,297 INFO L225 Difference]: With dead ends: 77 [2022-01-31 01:42:02,297 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 01:42:02,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 01:42:02,298 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:42:02,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 79 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:42:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 01:42:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2022-01-31 01:42:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:42:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-01-31 01:42:02,306 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 48 [2022-01-31 01:42:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:42:02,307 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-01-31 01:42:02,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:42:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-01-31 01:42:02,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 01:42:02,307 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:42:02,307 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:42:02,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-31 01:42:02,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-31 01:42:02,508 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:42:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:42:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1807662315, now seen corresponding path program 15 times [2022-01-31 01:42:02,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:42:02,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373708135] [2022-01-31 01:42:02,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:42:02,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:42:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:42:02,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:42:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:42:02,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:42:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:42:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:42:02,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:42:02,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373708135] [2022-01-31 01:42:02,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373708135] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:42:02,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147305974] [2022-01-31 01:42:02,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:42:02,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:42:02,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:42:02,672 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:42:02,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-31 01:42:02,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-01-31 01:42:02,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:42:02,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 01:42:02,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:42:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:42:03,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:42:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:42:03,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147305974] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:42:03,126 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:42:03,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 01:42:03,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862917952] [2022-01-31 01:42:03,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:42:03,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 01:42:03,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:42:03,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 01:42:03,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 01:42:03,127 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:42:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:42:03,343 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-01-31 01:42:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 01:42:03,344 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-01-31 01:42:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:42:03,344 INFO L225 Difference]: With dead ends: 81 [2022-01-31 01:42:03,344 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 01:42:03,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2022-01-31 01:42:03,345 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 93 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:42:03,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 52 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:42:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 01:42:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2022-01-31 01:42:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:42:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-01-31 01:42:03,354 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2022-01-31 01:42:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:42:03,354 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-01-31 01:42:03,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:42:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-01-31 01:42:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 01:42:03,355 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:42:03,355 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:42:03,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-01-31 01:42:03,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-31 01:42:03,560 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:42:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:42:03,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1738973907, now seen corresponding path program 16 times [2022-01-31 01:42:03,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:42:03,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122200773] [2022-01-31 01:42:03,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:42:03,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:42:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:42:04,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:42:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:42:04,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:42:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:42:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:42:04,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:42:04,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122200773] [2022-01-31 01:42:04,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122200773] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:42:04,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315080663] [2022-01-31 01:42:04,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:42:04,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:42:04,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:42:04,452 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:42:04,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-31 01:42:04,532 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:42:04,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:42:04,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-31 01:42:04,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:42:04,556 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-31 01:42:04,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:04,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:42:04,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:04,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:42:04,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:04,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:42:04,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:04,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:42:04,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:04,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:42:04,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:04,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:42:05,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:05,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:42:05,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:05,297 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:42:05,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-01-31 01:42:05,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:05,481 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:42:05,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:42:05,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:05,657 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:42:05,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:42:05,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:05,851 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:42:05,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:42:06,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:06,066 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:42:06,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:42:06,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:42:06,289 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:42:06,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 23 [2022-01-31 01:42:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:42:06,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:44:10,442 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_344 Int) (v_main_~i~0_333 Int) (v_ArrVal_1027 (Array Int Int)) (v_main_~i~0_341 Int) (main_~a~0.offset Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (v_main_~i~0_335 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1027))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse8 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_1027 (+ (* 4 v_main_~i~0_344) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_341))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_339))))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_337) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_335))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_333))))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (= (* 5 ~N~0) (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5 .cse6)) (not (= .cse2 5)) (not (= .cse3 5)) (not (= 5 .cse5)) (not (= 5 .cse6)))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:44:16,468 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_344 Int) (v_main_~i~0_333 Int) (v_ArrVal_1027 (Array Int Int)) (v_main_~i~0_341 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (v_main_~i~0_335 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1027))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse8 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_1027 (+ (* 4 v_main_~i~0_344) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_341))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_339))))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_337) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_335))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_333))))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (= (* 5 ~N~0) (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5 .cse6)) (not (= .cse2 5)) (not (= .cse3 5)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= 5 .cse5)) (< (+ c_main_~i~0 2) ~N~0) (not (= 5 .cse6)))))))))))) is different from false [2022-01-31 01:44:30,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_344 Int) (v_main_~i~0_333 Int) (v_ArrVal_1027 (Array Int Int)) (v_main_~i~0_341 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (v_main_~i~0_335 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1027))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse8 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_1027 (+ (* 4 v_main_~i~0_344) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_341))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_339))))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_337) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_335))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_333))))) (or (< (+ c_main_~i~0 3) ~N~0) (not (= 5 .cse0)) (not (= 5 .cse1)) (= (* 5 ~N~0) (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5 .cse6)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse2 5)) (not (= .cse3 5)) (not (= 5 .cse5)) (not (= 5 .cse6)))))))))))) is different from false [2022-01-31 01:44:48,972 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_344 Int) (v_main_~i~0_333 Int) (v_ArrVal_1027 (Array Int Int)) (v_main_~i~0_341 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (v_main_~i~0_335 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1027))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse8 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_1027 (+ (* 4 v_main_~i~0_344) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_341))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_339))))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_337) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_335))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_333))))) (or (< (+ c_main_~i~0 4) ~N~0) (not (= 5 .cse0)) (not (= 5 .cse1)) (= (* 5 ~N~0) (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5 .cse6)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= .cse2 5)) (not (= .cse3 5)) (not (= 5 .cse5)) (not (= 5 .cse6)))))))))))) is different from false [2022-01-31 01:45:11,692 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_344 Int) (v_main_~i~0_333 Int) (v_ArrVal_1027 (Array Int Int)) (v_main_~i~0_341 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (v_main_~i~0_335 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1027))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse8 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_1027 (+ (* 4 v_main_~i~0_344) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_341))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_339))))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_337) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_335))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_333))))) (or (< (+ c_main_~i~0 5) ~N~0) (not (= 5 .cse0)) (not (= 5 .cse1)) (= (* 5 ~N~0) (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5 .cse6)) (not (= .cse2 5)) (not (= .cse3 5)) (not (< (+ c_main_~i~0 4) ~N~0)) (not (= 5 .cse5)) (not (= 5 .cse6)))))))))))) is different from false [2022-01-31 01:45:40,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_344 Int) (v_main_~i~0_333 Int) (v_ArrVal_1027 (Array Int Int)) (v_main_~i~0_341 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (v_main_~i~0_335 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1027))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse8 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_1027 (+ (* 4 v_main_~i~0_344) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_341))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_339))))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_337) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_335))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_333))))) (or (< (+ c_main_~i~0 6) ~N~0) (not (= 5 .cse0)) (not (= 5 .cse1)) (= (* 5 ~N~0) (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5 .cse6)) (not (= .cse2 5)) (not (= .cse3 5)) (not (< (+ c_main_~i~0 5) ~N~0)) (not (= 5 .cse5)) (not (= 5 .cse6)))))))))))) is different from false [2022-01-31 01:45:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2022-01-31 01:45:57,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315080663] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:45:57,845 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:45:57,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 26, 26] total 77 [2022-01-31 01:45:57,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485066375] [2022-01-31 01:45:57,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:45:57,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-01-31 01:45:57,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:45:57,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-01-31 01:45:57,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=4681, Unknown=53, NotChecked=858, Total=5852 [2022-01-31 01:45:57,847 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 77 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 74 states have internal predecessors, (115), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:46:05,060 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-01-31 01:46:05,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 01:46:05,061 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 74 states have internal predecessors, (115), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2022-01-31 01:46:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:46:05,061 INFO L225 Difference]: With dead ends: 81 [2022-01-31 01:46:05,061 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 01:46:05,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1799 ImplicationChecksByTransitivity, 103.2s TimeCoverageRelationStatistics Valid=324, Invalid=5499, Unknown=53, NotChecked=930, Total=6806 [2022-01-31 01:46:05,063 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 829 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 01:46:05,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 363 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 596 Invalid, 0 Unknown, 829 Unchecked, 0.5s Time] [2022-01-31 01:46:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 01:46:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-01-31 01:46:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:46:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-01-31 01:46:05,075 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 51 [2022-01-31 01:46:05,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:46:05,075 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-01-31 01:46:05,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 74 states have internal predecessors, (115), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-01-31 01:46:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 01:46:05,076 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:46:05,076 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:46:05,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-01-31 01:46:05,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:46:05,281 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:46:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:46:05,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1746646763, now seen corresponding path program 6 times [2022-01-31 01:46:05,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:46:05,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505460337] [2022-01-31 01:46:05,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:46:05,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:46:05,292 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:46:05,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399983440] [2022-01-31 01:46:05,292 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:46:05,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:46:05,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:46:05,294 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:46:05,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-01-31 01:46:05,447 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-01-31 01:46:05,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:46:05,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 01:46:05,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:46:05,525 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 15 treesize of output 11 [2022-01-31 01:46:05,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:05,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:46:05,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:05,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:46:05,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:05,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:46:05,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:05,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:46:05,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:05,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:46:06,043 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:46:06,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-01-31 01:46:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-31 01:46:06,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:46:06,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (not (< (+ main_~i~0 2) c_~N~0)) (forall ((v_ArrVal_1108 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1108) c_main_~a~0.base) (+ c_main_~a~0.offset 8 (* main_~i~0 4))) 5)) (< (+ main_~i~0 3) c_~N~0))) is different from false [2022-01-31 01:46:06,319 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1108 (Array Int Int)) (main_~i~0 Int)) (or (not (< (+ main_~i~0 2) c_~N~0)) (< (+ main_~i~0 3) c_~N~0) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1108) c_main_~a~0.base) (+ c_main_~a~0.offset 8 (* main_~i~0 4))) 5))) is different from false [2022-01-31 01:46:06,606 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:46:06,606 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-01-31 01:46:06,617 INFO L353 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-01-31 01:46:06,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 31 [2022-01-31 01:46:06,622 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 10 treesize of output 3 [2022-01-31 01:46:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 31 not checked. [2022-01-31 01:46:06,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:46:06,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505460337] [2022-01-31 01:46:06,672 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:46:06,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399983440] [2022-01-31 01:46:06,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399983440] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:46:06,672 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:46:06,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2022-01-31 01:46:06,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779301867] [2022-01-31 01:46:06,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:46:06,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 01:46:06,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:46:06,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 01:46:06,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=8, NotChecked=62, Total=342 [2022-01-31 01:46:06,673 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:46:10,837 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-01-31 01:46:10,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 01:46:10,837 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2022-01-31 01:46:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:46:10,838 INFO L225 Difference]: With dead ends: 84 [2022-01-31 01:46:10,838 INFO L226 Difference]: Without dead ends: 78 [2022-01-31 01:46:10,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=8, NotChecked=70, Total=420 [2022-01-31 01:46:10,839 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:46:10,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 159 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 70 Unchecked, 0.0s Time] [2022-01-31 01:46:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-31 01:46:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-01-31 01:46:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.1) internal successors, (77), 70 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:46:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-01-31 01:46:10,850 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 51 [2022-01-31 01:46:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:46:10,850 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-01-31 01:46:10,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-01-31 01:46:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 01:46:10,850 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:46:10,850 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:46:10,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-01-31 01:46:11,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:46:11,051 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:46:11,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:46:11,052 INFO L85 PathProgramCache]: Analyzing trace with hash 147649775, now seen corresponding path program 17 times [2022-01-31 01:46:11,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:46:11,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062200332] [2022-01-31 01:46:11,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:46:11,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:46:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:11,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:46:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:11,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:46:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:46:11,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:46:11,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062200332] [2022-01-31 01:46:11,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062200332] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:46:11,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636460411] [2022-01-31 01:46:11,302 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:46:11,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:46:11,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:46:11,308 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:46:11,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-01-31 01:46:11,466 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-01-31 01:46:11,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:46:11,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-31 01:46:11,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:46:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:46:11,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:46:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:46:11,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636460411] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:46:11,908 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:46:11,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-01-31 01:46:11,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82604108] [2022-01-31 01:46:11,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:46:11,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:46:11,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:46:11,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:46:11,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:46:11,910 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:12,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:46:12,723 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-01-31 01:46:12,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 01:46:12,724 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2022-01-31 01:46:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:46:12,724 INFO L225 Difference]: With dead ends: 97 [2022-01-31 01:46:12,724 INFO L226 Difference]: Without dead ends: 91 [2022-01-31 01:46:12,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=1364, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 01:46:12,726 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 72 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 01:46:12,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 64 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 01:46:12,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-31 01:46:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2022-01-31 01:46:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:46:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-01-31 01:46:12,738 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 53 [2022-01-31 01:46:12,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:46:12,738 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-01-31 01:46:12,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-01-31 01:46:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 01:46:12,739 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:46:12,739 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:46:12,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-01-31 01:46:12,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-31 01:46:12,955 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:46:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:46:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1800419009, now seen corresponding path program 18 times [2022-01-31 01:46:12,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:46:12,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658353159] [2022-01-31 01:46:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:46:12,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:46:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:46:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:13,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:46:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:46:13,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:46:13,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658353159] [2022-01-31 01:46:13,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658353159] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:46:13,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430082182] [2022-01-31 01:46:13,192 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:46:13,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:46:13,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:46:13,194 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:46:13,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-01-31 01:46:13,400 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-01-31 01:46:13,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:46:13,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-31 01:46:13,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:46:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:46:13,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:46:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:46:13,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430082182] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:46:13,919 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:46:13,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-01-31 01:46:13,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43602739] [2022-01-31 01:46:13,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:46:13,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:46:13,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:46:13,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:46:13,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:46:13,920 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:46:14,378 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2022-01-31 01:46:14,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 01:46:14,378 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-01-31 01:46:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:46:14,379 INFO L225 Difference]: With dead ends: 106 [2022-01-31 01:46:14,379 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 01:46:14,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 01:46:14,380 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 96 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:46:14,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 48 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:46:14,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 01:46:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2022-01-31 01:46:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:46:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-01-31 01:46:14,389 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 54 [2022-01-31 01:46:14,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:46:14,389 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-01-31 01:46:14,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-01-31 01:46:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 01:46:14,390 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:46:14,390 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:46:14,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-01-31 01:46:14,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-31 01:46:14,592 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:46:14,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:46:14,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2030473281, now seen corresponding path program 19 times [2022-01-31 01:46:14,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:46:14,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408763932] [2022-01-31 01:46:14,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:46:14,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:46:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:16,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:46:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:16,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:46:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:46:16,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:46:16,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408763932] [2022-01-31 01:46:16,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408763932] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:46:16,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938156985] [2022-01-31 01:46:16,242 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:46:16,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:46:16,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:46:16,243 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:46:16,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-01-31 01:46:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:16,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 93 conjunts are in the unsatisfiable core [2022-01-31 01:46:16,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:46:16,364 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 10 treesize of output 8 [2022-01-31 01:46:16,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:46:16,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:46:16,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:46:16,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:46:16,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:46:16,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:46:16,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:46:16,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:46:16,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:46:16,922 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:46:16,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:46:17,172 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:46:17,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:46:17,505 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:46:17,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 65 [2022-01-31 01:46:17,824 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:46:17,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:46:18,094 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:46:18,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:46:18,424 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:46:18,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:46:18,660 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:46:18,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2022-01-31 01:46:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:46:18,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:50:54,232 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_444 Int) (v_main_~i~0_442 Int) (v_main_~i~0_451 Int) (v_main_~i~0_440 Int) (main_~a~0.offset Int) (v_ArrVal_1320 (Array Int Int)) (v_main_~i~0_438 Int) (v_main_~i~0_448 Int) (v_main_~i~0_446 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1320))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse9 |c_main_~#sum~0.offset|)) (.cse7 (select v_ArrVal_1320 (+ main_~a~0.offset (* 4 v_main_~i~0_451))))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_448))))) (let ((.cse5 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse2 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_446))))) (let ((.cse0 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse2 .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_444))))) (let ((.cse3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_442))))) (let ((.cse4 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_440))))) (let ((.cse1 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_438))))) (or (= (* 5 ~N~0) (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= .cse2 5)) (not (= .cse1 5)) (not (= 5 .cse5)) (not (= .cse0 5)) (not (= 5 .cse4)) (not (= 5 .cse7)) (not (= 5 .cse3))))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:51:28,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_444 Int) (v_main_~i~0_442 Int) (v_main_~i~0_451 Int) (v_main_~i~0_440 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_1320 (Array Int Int)) (v_main_~i~0_438 Int) (v_main_~i~0_448 Int) (v_main_~i~0_446 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1320))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse9 |c_main_~#sum~0.offset|)) (.cse7 (select v_ArrVal_1320 (+ main_~a~0.offset (* 4 v_main_~i~0_451))))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_448))))) (let ((.cse5 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse2 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_446))))) (let ((.cse0 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse2 .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_444))))) (let ((.cse3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_442))))) (let ((.cse4 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_440))))) (let ((.cse1 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_438))))) (or (= (* 5 ~N~0) (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= .cse2 5)) (not (= .cse1 5)) (not (= 5 .cse5)) (not (= .cse0 5)) (not (= 5 .cse4)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= 5 .cse7)) (< (+ c_main_~i~0 2) ~N~0) (not (= 5 .cse3))))))))))))) is different from false [2022-01-31 01:53:00,822 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_444 Int) (v_main_~i~0_442 Int) (v_main_~i~0_451 Int) (v_main_~i~0_440 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_1320 (Array Int Int)) (v_main_~i~0_438 Int) (v_main_~i~0_448 Int) (v_main_~i~0_446 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1320))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse9 |c_main_~#sum~0.offset|)) (.cse7 (select v_ArrVal_1320 (+ main_~a~0.offset (* 4 v_main_~i~0_451))))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_448))))) (let ((.cse5 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse2 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_446))))) (let ((.cse0 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse2 .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_444))))) (let ((.cse3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_442))))) (let ((.cse4 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_440))))) (let ((.cse1 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_438))))) (or (= (* 5 ~N~0) (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= .cse2 5)) (not (= .cse1 5)) (< (+ c_main_~i~0 3) ~N~0) (not (= 5 .cse5)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse0 5)) (not (= 5 .cse4)) (not (= 5 .cse7)) (not (= 5 .cse3))))))))))))) is different from false