/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/array-fpi/condg.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:01:27,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:01:27,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:01:27,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:01:27,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:01:27,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:01:27,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:01:27,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:01:27,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:01:27,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:01:27,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:01:27,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:01:27,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:01:27,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:01:27,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:01:27,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:01:27,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:01:27,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:01:27,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:01:27,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:01:27,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:01:27,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:01:27,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:01:27,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:01:27,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:01:27,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:01:27,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:01:27,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:01:27,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:01:27,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:01:27,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:01:27,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:01:27,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:01:27,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:01:27,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:01:27,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:01:27,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:01:27,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:01:27,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:01:27,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:01:27,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:01:27,856 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:01:27,864 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:01:27,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:01:27,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:01:27,865 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:01:27,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:01:27,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:01:27,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:01:27,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:01:27,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:01:27,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:01:27,867 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:01:27,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:01:27,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:01:27,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:01:27,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:01:27,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:01:27,868 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:01:27,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:01:27,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:01:27,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:01:27,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:01:27,869 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:01:27,870 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 11:01:28,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:01:28,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:01:28,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:01:28,099 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:01:28,099 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:01:28,101 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condg.c [2022-01-31 11:01:28,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed75bdf90/fa59182d5bbc42c4bbb1fb2ab2659db3/FLAGd04d74c03 [2022-01-31 11:01:28,561 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:01:28,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condg.c [2022-01-31 11:01:28,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed75bdf90/fa59182d5bbc42c4bbb1fb2ab2659db3/FLAGd04d74c03 [2022-01-31 11:01:28,580 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed75bdf90/fa59182d5bbc42c4bbb1fb2ab2659db3 [2022-01-31 11:01:28,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:01:28,583 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:01:28,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:01:28,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:01:28,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:01:28,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:01:28" (1/1) ... [2022-01-31 11:01:28,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58070348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:01:28, skipping insertion in model container [2022-01-31 11:01:28,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:01:28" (1/1) ... [2022-01-31 11:01:28,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:01:28,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:01:28,748 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/condg.c[588,601] [2022-01-31 11:01:28,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:01:28,789 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:01:28,805 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/condg.c[588,601] [2022-01-31 11:01:28,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:01:28,836 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:01:28,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:01:28 WrapperNode [2022-01-31 11:01:28,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:01:28,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:01:28,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:01:28,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:01:28,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:01:28" (1/1) ... [2022-01-31 11:01:28,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:01:28" (1/1) ... [2022-01-31 11:01:28,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:01:28" (1/1) ... [2022-01-31 11:01:28,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:01:28" (1/1) ... [2022-01-31 11:01:28,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:01:28" (1/1) ... [2022-01-31 11:01:28,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:01:28" (1/1) ... [2022-01-31 11:01:28,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:01:28" (1/1) ... [2022-01-31 11:01:28,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:01:28,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:01:28,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:01:28,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:01:28,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:01:28" (1/1) ... [2022-01-31 11:01:28,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:01:28,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:01:28,929 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 11:01:28,949 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 11:01:28,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:01:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:01:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:01:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:01:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:01:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:01:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:01:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:01:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:01:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:01:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:01:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:01:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:01:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:01:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:01:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:01:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:01:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:01:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:01:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:01:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:01:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:01:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:01:29,047 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:01:29,049 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:01:29,234 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:01:29,240 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:01:29,241 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-31 11:01:29,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:01:29 BoogieIcfgContainer [2022-01-31 11:01:29,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:01:29,245 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:01:29,245 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:01:29,247 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:01:29,249 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:01:29" (1/1) ... [2022-01-31 11:01:29,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:01:29 BasicIcfg [2022-01-31 11:01:29,268 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:01:29,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:01:29,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:01:29,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:01:29,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:01:28" (1/4) ... [2022-01-31 11:01:29,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1a1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:01:29, skipping insertion in model container [2022-01-31 11:01:29,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:01:28" (2/4) ... [2022-01-31 11:01:29,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1a1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:01:29, skipping insertion in model container [2022-01-31 11:01:29,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:01:29" (3/4) ... [2022-01-31 11:01:29,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1a1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:01:29, skipping insertion in model container [2022-01-31 11:01:29,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:01:29" (4/4) ... [2022-01-31 11:01:29,275 INFO L111 eAbstractionObserver]: Analyzing ICFG condg.cJordan [2022-01-31 11:01:29,280 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:01:29,280 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:01:29,317 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:01:29,327 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 11:01:29,328 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:01:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 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 11:01:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 11:01:29,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:01:29,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:01:29,367 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:01:29,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:01:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash -589029312, now seen corresponding path program 1 times [2022-01-31 11:01:29,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:01:29,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900129632] [2022-01-31 11:01:29,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:29,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:01:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:29,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:01:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:29,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:01:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:29,608 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 11:01:29,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:01:29,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900129632] [2022-01-31 11:01:29,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900129632] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:01:29,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:01:29,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:01:29,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775324697] [2022-01-31 11:01:29,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:01:29,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:01:29,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:01:29,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:01:29,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:01:29,640 INFO L87 Difference]: Start difference. First operand has 38 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 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 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 11:01:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:01:29,697 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-01-31 11:01:29,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:01:29,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 24 [2022-01-31 11:01:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:01:29,706 INFO L225 Difference]: With dead ends: 38 [2022-01-31 11:01:29,706 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 11:01:29,708 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 11:01:29,711 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:01:29,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:01:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 11:01:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-01-31 11:01:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:01:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-01-31 11:01:29,737 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2022-01-31 11:01:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:01:29,738 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-01-31 11:01:29,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 11:01:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-01-31 11:01:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 11:01:29,739 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:01:29,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:01:29,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:01:29,740 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:01:29,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:01:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1798379644, now seen corresponding path program 1 times [2022-01-31 11:01:29,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:01:29,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840504219] [2022-01-31 11:01:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:29,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:01:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:29,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:01:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:29,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:01:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:29,887 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 11:01:29,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:01:29,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840504219] [2022-01-31 11:01:29,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840504219] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:01:29,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:01:29,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:01:29,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520828711] [2022-01-31 11:01:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:01:29,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:01:29,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:01:29,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:01:29,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:01:29,896 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 11:01:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:01:30,049 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-01-31 11:01:30,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:01:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 24 [2022-01-31 11:01:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:01:30,054 INFO L225 Difference]: With dead ends: 44 [2022-01-31 11:01:30,055 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 11:01:30,060 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 11:01:30,062 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:01:30,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 32 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:01:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 11:01:30,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-01-31 11:01:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:01:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-01-31 11:01:30,076 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2022-01-31 11:01:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:01:30,076 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-01-31 11:01:30,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 11:01:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-01-31 11:01:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:01:30,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:01:30,077 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:01:30,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:01:30,078 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:01:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:01:30,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1721523761, now seen corresponding path program 1 times [2022-01-31 11:01:30,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:01:30,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856555809] [2022-01-31 11:01:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:30,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:01:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:30,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:01:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:01:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:01:30,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:01:30,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856555809] [2022-01-31 11:01:30,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856555809] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:01:30,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413911360] [2022-01-31 11:01:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:30,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:01:30,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:01:30,523 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 11:01:30,531 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 11:01:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:30,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-31 11:01:30,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:01:30,743 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 11:01:30,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:30,823 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 11:01:30,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 11:01:30,932 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 11:01:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:01:30,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:01:31,105 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_43 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_43) c_main_~a~0.base) c_main_~a~0.offset)) 0)) is different from false [2022-01-31 11:01:31,158 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:01:31,158 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 11:01:31,166 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:01:31,167 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 11:01:31,172 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 9 [2022-01-31 11:01:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-31 11:01:31,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413911360] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:01:31,280 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:01:31,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2022-01-31 11:01:31,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225598122] [2022-01-31 11:01:31,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:01:31,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 11:01:31,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:01:31,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 11:01:31,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=397, Unknown=1, NotChecked=40, Total=506 [2022-01-31 11:01:31,283 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:01:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:01:31,771 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-01-31 11:01:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:01:31,771 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 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 11:01:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:01:31,773 INFO L225 Difference]: With dead ends: 65 [2022-01-31 11:01:31,773 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 11:01:31,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=696, Unknown=1, NotChecked=54, Total=870 [2022-01-31 11:01:31,774 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 59 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:01:31,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 419 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2022-01-31 11:01:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 11:01:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2022-01-31 11:01:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:01:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-01-31 11:01:31,781 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 31 [2022-01-31 11:01:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:01:31,782 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-01-31 11:01:31,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:01:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-01-31 11:01:31,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:01:31,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:01:31,783 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:01:31,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 11:01:32,001 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 11:01:32,002 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:01:32,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:01:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash -85930702, now seen corresponding path program 1 times [2022-01-31 11:01:32,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:01:32,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154843236] [2022-01-31 11:01:32,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:32,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:01:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:32,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:01:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:32,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:01:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:01:32,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:01:32,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154843236] [2022-01-31 11:01:32,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154843236] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:01:32,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908105482] [2022-01-31 11:01:32,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:32,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:01:32,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:01:32,349 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 11:01:32,375 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 11:01:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:32,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-31 11:01:32,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:01:32,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 11:01:32,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:32,520 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 23 treesize of output 22 [2022-01-31 11:01:32,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:32,687 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 36 treesize of output 23 [2022-01-31 11:01:32,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:32,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2022-01-31 11:01:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:01:32,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:01:32,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:01:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:01:33,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908105482] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:01:33,041 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:01:33,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2022-01-31 11:01:33,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851695494] [2022-01-31 11:01:33,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:01:33,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 11:01:33,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:01:33,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 11:01:33,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-01-31 11:01:33,043 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:01:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:01:33,409 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2022-01-31 11:01:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:01:33,409 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-01-31 11:01:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:01:33,412 INFO L225 Difference]: With dead ends: 80 [2022-01-31 11:01:33,412 INFO L226 Difference]: Without dead ends: 80 [2022-01-31 11:01:33,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2022-01-31 11:01:33,413 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:01:33,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 102 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 387 Invalid, 0 Unknown, 36 Unchecked, 0.2s Time] [2022-01-31 11:01:33,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-31 11:01:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 58. [2022-01-31 11:01:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:01:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-01-31 11:01:33,421 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 31 [2022-01-31 11:01:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:01:33,421 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-01-31 11:01:33,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:01:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-01-31 11:01:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 11:01:33,422 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:01:33,422 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, 1, 1, 1, 1, 1] [2022-01-31 11:01:33,455 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 11:01:33,647 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 11:01:33,648 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:01:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:01:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash -403415276, now seen corresponding path program 2 times [2022-01-31 11:01:33,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:01:33,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500218269] [2022-01-31 11:01:33,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:33,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:01:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:33,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:01:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:33,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:01:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:01:33,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:01:33,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500218269] [2022-01-31 11:01:33,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500218269] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:01:33,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154588657] [2022-01-31 11:01:33,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:01:33,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:01:33,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:01:33,734 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 11:01:33,755 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 11:01:33,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:01:33,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:01:33,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:01:33,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:01:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:01:33,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:01:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:01:33,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154588657] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:01:33,986 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:01:33,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-01-31 11:01:33,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431600531] [2022-01-31 11:01:33,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:01:33,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:01:33,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:01:33,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:01:33,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:01:33,990 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 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 11:01:34,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:01:34,333 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-01-31 11:01:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:01:34,334 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 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 11:01:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:01:34,335 INFO L225 Difference]: With dead ends: 86 [2022-01-31 11:01:34,335 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 11:01:34,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-01-31 11:01:34,336 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 135 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:01:34,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 98 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:01:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 11:01:34,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-01-31 11:01:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 46 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:01:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-01-31 11:01:34,342 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 33 [2022-01-31 11:01:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:01:34,342 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-01-31 11:01:34,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 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 11:01:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-01-31 11:01:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 11:01:34,343 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:01:34,343 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:01:34,371 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 11:01:34,555 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 11:01:34,556 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:01:34,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:01:34,556 INFO L85 PathProgramCache]: Analyzing trace with hash -573469705, now seen corresponding path program 1 times [2022-01-31 11:01:34,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:01:34,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907094007] [2022-01-31 11:01:34,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:34,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:01:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:34,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:01:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:34,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:01:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:01:34,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:01:34,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907094007] [2022-01-31 11:01:34,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907094007] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:01:34,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872422434] [2022-01-31 11:01:34,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:34,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:01:34,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:01:34,633 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 11:01:34,647 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 11:01:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:34,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-31 11:01:34,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:01:34,712 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 11:01:34,742 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 11:01:34,762 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 15 treesize of output 17 [2022-01-31 11:01:34,770 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 16 treesize of output 8 [2022-01-31 11:01:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:01:34,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:01:34,803 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_150 (Array Int Int))) (= (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_150) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) |c_main_#t~mem11|)) is different from false [2022-01-31 11:01:34,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_150 (Array Int Int))) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_150) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) is different from false [2022-01-31 11:01:34,823 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:01:34,823 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 18 treesize of output 19 [2022-01-31 11:01:34,825 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 18 treesize of output 14 [2022-01-31 11:01:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2022-01-31 11:01:34,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872422434] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:01:34,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:01:34,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-01-31 11:01:34,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370258293] [2022-01-31 11:01:34,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:01:34,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 11:01:34,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:01:34,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 11:01:34,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2022-01-31 11:01:34,866 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 11:01:34,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:01:34,962 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-01-31 11:01:34,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 11:01:34,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 11:01:34,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:01:34,963 INFO L225 Difference]: With dead ends: 56 [2022-01-31 11:01:34,964 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 11:01:34,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=68, Unknown=2, NotChecked=34, Total=132 [2022-01-31 11:01:34,965 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:01:34,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 113 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-01-31 11:01:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 11:01:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-01-31 11:01:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:01:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-01-31 11:01:34,969 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 38 [2022-01-31 11:01:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:01:34,969 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-01-31 11:01:34,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 11:01:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-01-31 11:01:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 11:01:34,970 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:01:34,971 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:01:35,003 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 11:01:35,183 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 11:01:35,184 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:01:35,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:01:35,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1914043128, now seen corresponding path program 3 times [2022-01-31 11:01:35,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:01:35,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004415966] [2022-01-31 11:01:35,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:35,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:01:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:36,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:01:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:36,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:01:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:01:36,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:01:36,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004415966] [2022-01-31 11:01:36,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004415966] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:01:36,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769267257] [2022-01-31 11:01:36,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:01:36,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:01:36,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:01:36,067 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 11:01:36,093 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 11:01:36,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:01:36,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:01:36,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 11:01:36,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:01:36,164 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 11:01:36,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:36,206 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 23 treesize of output 22 [2022-01-31 11:01:36,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:36,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:36,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:01:36,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:36,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:36,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:01:36,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-01-31 11:01:36,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:36,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-01-31 11:01:36,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:36,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-01-31 11:01:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:01:36,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:01:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:01:37,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769267257] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:01:37,363 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:01:37,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 39 [2022-01-31 11:01:37,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83216259] [2022-01-31 11:01:37,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:01:37,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-31 11:01:37,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:01:37,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-31 11:01:37,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 11:01:37,365 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 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 11:01:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:01:38,815 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-01-31 11:01:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 11:01:38,815 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 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 11:01:38,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:01:38,818 INFO L225 Difference]: With dead ends: 83 [2022-01-31 11:01:38,819 INFO L226 Difference]: Without dead ends: 83 [2022-01-31 11:01:38,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=354, Invalid=2508, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 11:01:38,822 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:01:38,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 154 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 741 Invalid, 0 Unknown, 11 Unchecked, 0.6s Time] [2022-01-31 11:01:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-31 11:01:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2022-01-31 11:01:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 60 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:01:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-01-31 11:01:38,840 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 38 [2022-01-31 11:01:38,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:01:38,840 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-01-31 11:01:38,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 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 11:01:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-01-31 11:01:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 11:01:38,842 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:01:38,842 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:01:38,867 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 11:01:39,067 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 11:01:39,067 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:01:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:01:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1348319980, now seen corresponding path program 4 times [2022-01-31 11:01:39,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:01:39,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629924836] [2022-01-31 11:01:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:39,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:01:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:39,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:01:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:39,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:01:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:01:39,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:01:39,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629924836] [2022-01-31 11:01:39,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629924836] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:01:39,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703387037] [2022-01-31 11:01:39,150 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:01:39,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:01:39,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:01:39,151 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 11:01:39,153 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 11:01:39,214 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:01:39,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:01:39,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:01:39,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:01:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:01:39,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:01:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:01:39,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703387037] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:01:39,393 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:01:39,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:01:39,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398982194] [2022-01-31 11:01:39,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:01:39,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:01:39,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:01:39,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:01:39,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:01:39,395 INFO L87 Difference]: Start difference. First operand 69 states and 79 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 11:01:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:01:39,710 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2022-01-31 11:01:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:01:39,711 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 40 [2022-01-31 11:01:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:01:39,712 INFO L225 Difference]: With dead ends: 109 [2022-01-31 11:01:39,712 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 11:01:39,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 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 11:01:39,713 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 89 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:01:39,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 110 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:01:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 11:01:39,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2022-01-31 11:01:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.173913043478261) internal successors, (81), 70 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:01:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2022-01-31 11:01:39,717 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 40 [2022-01-31 11:01:39,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:01:39,718 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2022-01-31 11:01:39,718 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 11:01:39,718 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2022-01-31 11:01:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 11:01:39,723 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:01:39,723 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:01:39,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-31 11:01:39,943 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 11:01:39,944 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:01:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:01:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1202682665, now seen corresponding path program 2 times [2022-01-31 11:01:39,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:01:39,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921572369] [2022-01-31 11:01:39,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:39,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:01:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:40,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:01:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:01:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:01:40,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:01:40,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921572369] [2022-01-31 11:01:40,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921572369] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:01:40,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063657220] [2022-01-31 11:01:40,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:01:40,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:01:40,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:01:40,036 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 11:01:40,044 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 11:01:40,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:01:40,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:01:40,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:01:40,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:01:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:01:40,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:01:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:01:40,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063657220] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:01:40,287 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:01:40,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:01:40,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389765696] [2022-01-31 11:01:40,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:01:40,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:01:40,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:01:40,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:01:40,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:01:40,292 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 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 11:01:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:01:40,502 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-01-31 11:01:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:01:40,503 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 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 41 [2022-01-31 11:01:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:01:40,503 INFO L225 Difference]: With dead ends: 103 [2022-01-31 11:01:40,504 INFO L226 Difference]: Without dead ends: 98 [2022-01-31 11:01:40,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 81 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 11:01:40,504 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 118 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:01:40,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 66 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:01:40,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-01-31 11:01:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2022-01-31 11:01:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 69 states have internal predecessors, (78), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:01:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-01-31 11:01:40,509 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 41 [2022-01-31 11:01:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:01:40,510 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-01-31 11:01:40,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 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 11:01:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-01-31 11:01:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 11:01:40,511 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:01:40,511 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:01:40,532 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 11:01:40,724 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 11:01:40,724 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:01:40,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:01:40,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1395365196, now seen corresponding path program 1 times [2022-01-31 11:01:40,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:01:40,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412955797] [2022-01-31 11:01:40,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:40,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:01:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:41,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:01:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:01:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:41,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 11:01:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:01:41,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:01:41,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412955797] [2022-01-31 11:01:41,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412955797] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:01:41,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495638783] [2022-01-31 11:01:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:01:41,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:01:41,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:01:41,016 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 11:01:41,017 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 11:01:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:01:41,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-31 11:01:41,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:01:41,115 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 11:01:41,122 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 11:01:41,146 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 23 treesize of output 22 [2022-01-31 11:01:41,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:41,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-31 11:01:41,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:41,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:01:41,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-01-31 11:01:41,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:41,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2022-01-31 11:01:41,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:01:41,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:01:41,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2022-01-31 11:01:41,738 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 53 treesize of output 30 [2022-01-31 11:01:42,964 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 35 treesize of output 15 [2022-01-31 11:01:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:01:43,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:01:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:01:55,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495638783] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:01:55,387 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:01:55,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 20] total 48 [2022-01-31 11:01:55,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584342248] [2022-01-31 11:01:55,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:01:55,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-31 11:01:55,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:01:55,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-31 11:01:55,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2052, Unknown=7, NotChecked=0, Total=2256 [2022-01-31 11:01:55,389 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 48 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 45 states have internal predecessors, (92), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:02:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:02:01,984 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-01-31 11:02:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 11:02:01,985 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 45 states have internal predecessors, (92), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 46 [2022-01-31 11:02:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:02:01,986 INFO L225 Difference]: With dead ends: 111 [2022-01-31 11:02:01,986 INFO L226 Difference]: Without dead ends: 96 [2022-01-31 11:02:01,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=453, Invalid=3958, Unknown=11, NotChecked=0, Total=4422 [2022-01-31 11:02:01,988 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 49 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 489 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:02:01,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 360 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 289 Invalid, 0 Unknown, 489 Unchecked, 0.2s Time] [2022-01-31 11:02:01,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-01-31 11:02:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 80. [2022-01-31 11:02:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 69 states have internal predecessors, (77), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:02:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-01-31 11:02:01,993 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 46 [2022-01-31 11:02:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:02:01,993 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-01-31 11:02:01,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 45 states have internal predecessors, (92), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:02:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-01-31 11:02:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 11:02:01,994 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:02:01,994 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:02:02,019 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 11:02:02,207 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 11:02:02,208 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:02:02,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:02:02,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1546292403, now seen corresponding path program 1 times [2022-01-31 11:02:02,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:02:02,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538940842] [2022-01-31 11:02:02,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:02:02,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:02:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:02,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:02:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:02,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:02:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 11:02:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-31 11:02:02,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:02:02,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538940842] [2022-01-31 11:02:02,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538940842] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:02:02,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493051175] [2022-01-31 11:02:02,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:02:02,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:02:02,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:02:02,287 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 11:02:02,288 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 11:02:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:02,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-31 11:02:02,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:02:02,373 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 11:02:02,410 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 11:02:02,430 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 11:02:02,440 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 11:02:02,467 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:02:02,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:02:02,512 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int))) (= (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_377) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) |c_main_#t~mem11|)) is different from false [2022-01-31 11:02:02,518 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int))) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_377) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) is different from false [2022-01-31 11:02:02,534 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:02:02,534 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 18 treesize of output 19 [2022-01-31 11:02:02,541 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 18 treesize of output 14 [2022-01-31 11:02:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2022-01-31 11:02:02,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493051175] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:02:02,574 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:02:02,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-01-31 11:02:02,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357559359] [2022-01-31 11:02:02,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:02:02,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 11:02:02,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:02:02,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 11:02:02,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2022-01-31 11:02:02,576 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 11:02:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:02:02,663 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-01-31 11:02:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 11:02:02,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-01-31 11:02:02,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:02:02,664 INFO L225 Difference]: With dead ends: 65 [2022-01-31 11:02:02,664 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 11:02:02,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=68, Unknown=2, NotChecked=34, Total=132 [2022-01-31 11:02:02,665 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:02:02,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-01-31 11:02:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 11:02:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-01-31 11:02:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:02:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-01-31 11:02:02,668 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 46 [2022-01-31 11:02:02,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:02:02,668 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-01-31 11:02:02,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 11:02:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-01-31 11:02:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 11:02:02,669 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:02:02,669 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2022-01-31 11:02:02,690 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 11:02:02,883 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 11:02:02,884 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:02:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:02:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1320022813, now seen corresponding path program 3 times [2022-01-31 11:02:02,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:02:02,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250394025] [2022-01-31 11:02:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:02:02,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:02:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:03,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:02:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:03,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:02:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:02:03,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:02:03,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250394025] [2022-01-31 11:02:03,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250394025] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:02:03,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896397595] [2022-01-31 11:02:03,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:02:03,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:02:03,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:02:03,344 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 11:02:03,353 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 11:02:03,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-31 11:02:03,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:02:03,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-31 11:02:03,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:02:03,453 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 11:02:03,464 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 11:02:03,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:03,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:02:03,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:03,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:02:03,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 14 treesize of output 16 [2022-01-31 11:02:03,613 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 11:02:03,635 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 11:02:03,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 11:02:03,766 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 11:02:03,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-01-31 11:02:03,861 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 11:02:03,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-01-31 11:02:03,947 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 11:02:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:02:03,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:02:06,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_ArrVal_443 Int) (main_~i~0 Int) (v_ArrVal_441 Int)) (or (< (+ v_main_~i~0_135 1) c_~N~0) (not (<= v_main_~i~0_135 (+ main_~i~0 1))) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset) 0))) is different from false [2022-01-31 11:02:08,326 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (= 0 (select (store (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset)) (< (+ v_main_~i~0_135 1) c_~N~0) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) is different from false [2022-01-31 11:02:10,373 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (= (select (store (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) (- 1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset) 0) (< (+ v_main_~i~0_135 1) c_~N~0) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) is different from false [2022-01-31 11:02:10,447 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_ArrVal_443 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (< (+ v_main_~i~0_135 1) c_~N~0) (= (select (store (store (let ((.cse0 (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset) 0) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) is different from false [2022-01-31 11:02:10,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (v_main_~i~0_135 Int) (v_ArrVal_443 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (<= (+ v_main_~i~0_135 1) c_main_~i~0) (= 0 (select (store (store (let ((.cse0 (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_434)) |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) (- 1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset)) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) is different from false [2022-01-31 11:02:10,755 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_144 Int)) (or (forall ((v_ArrVal_434 Int) (v_main_~i~0_135 Int) (v_ArrVal_443 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (<= (+ v_main_~i~0_135 1) v_main_~i~0_144) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_434)) |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset)) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_144)))) is different from false [2022-01-31 11:02:10,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (v_main_~i~0_135 Int) (v_main_~i~0_144 Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (<= (+ v_main_~i~0_135 1) v_main_~i~0_144) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_431) (+ (* 4 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_434)) |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) (- 1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_144)) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) is different from false [2022-01-31 11:02:11,004 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_145 Int)) (or (forall ((v_ArrVal_434 Int) (v_main_~i~0_135 Int) (v_main_~i~0_144 Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_145)) v_ArrVal_431) (+ (* 4 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_434)) |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset)) (<= (+ v_main_~i~0_135 1) v_main_~i~0_144) (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_145)))) is different from false [2022-01-31 11:02:11,047 INFO L353 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2022-01-31 11:02:11,049 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 3 case distinctions, treesize of input 88 treesize of output 73 [2022-01-31 11:02:11,056 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 78 treesize of output 72 [2022-01-31 11:02:11,063 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 162 treesize of output 158 [2022-01-31 11:02:11,080 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:02:11,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2022-01-31 11:02:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 24 not checked. [2022-01-31 11:02:11,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896397595] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:02:11,286 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:02:11,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 20] total 43 [2022-01-31 11:02:11,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363580012] [2022-01-31 11:02:11,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:02:11,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-31 11:02:11,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:02:11,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-31 11:02:11,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1044, Unknown=8, NotChecked=584, Total=1806 [2022-01-31 11:02:11,288 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:02:13,353 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (= c_main_~i~0 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_145 Int)) (or (forall ((v_ArrVal_434 Int) (v_main_~i~0_135 Int) (v_main_~i~0_144 Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_145)) v_ArrVal_431) (+ (* 4 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_434)) |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset)) (<= (+ v_main_~i~0_135 1) v_main_~i~0_144) (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_145)))) (= (select .cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 1) (or (< c_main_~i~0 c_~N~0) (= (select .cse1 c_main_~a~0.offset) 0)))) is different from false [2022-01-31 11:02:15,368 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (forall ((v_main_~i~0_144 Int)) (or (forall ((v_ArrVal_434 Int) (v_main_~i~0_135 Int) (v_ArrVal_443 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (<= (+ v_main_~i~0_135 1) v_main_~i~0_144) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_434)) |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset)) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_144)))) (= (+ (* c_main_~i~0 4) c_main_~a~0.offset (- 4)) 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (or (< c_main_~i~0 c_~N~0) (= (select .cse1 c_main_~a~0.offset) 0)) (= (select .cse1 0) 1))) is different from false [2022-01-31 11:02:16,391 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select .cse0 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 0) (< 2 c_~N~0) (= c_main_~i~0 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_135 Int) (v_ArrVal_443 Int) (main_~i~0 Int) (v_ArrVal_441 Int)) (or (< (+ v_main_~i~0_135 1) c_~N~0) (not (<= v_main_~i~0_135 (+ main_~i~0 1))) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset) 0))) (= (select .cse0 c_main_~a~0.offset) 0))) is different from false [2022-01-31 11:02:17,008 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (< 2 c_~N~0) (= (select .cse0 0) 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_135 Int) (v_ArrVal_443 Int) (main_~i~0 Int) (v_ArrVal_441 Int)) (or (< (+ v_main_~i~0_135 1) c_~N~0) (not (<= v_main_~i~0_135 (+ main_~i~0 1))) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset) 0))) (= (select .cse0 c_main_~a~0.offset) 0))) is different from false [2022-01-31 11:02:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:02:17,302 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-01-31 11:02:17,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 11:02:17,303 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-01-31 11:02:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:02:17,303 INFO L225 Difference]: With dead ends: 81 [2022-01-31 11:02:17,303 INFO L226 Difference]: Without dead ends: 81 [2022-01-31 11:02:17,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 76 SyntacticMatches, 13 SemanticMatches, 59 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=342, Invalid=2046, Unknown=12, NotChecked=1260, Total=3660 [2022-01-31 11:02:17,305 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 84 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 566 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:02:17,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 213 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 656 Invalid, 0 Unknown, 566 Unchecked, 0.3s Time] [2022-01-31 11:02:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-31 11:02:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2022-01-31 11:02:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 62 states have internal predecessors, (73), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:02:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-01-31 11:02:17,308 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 45 [2022-01-31 11:02:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:02:17,308 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-01-31 11:02:17,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:02:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-01-31 11:02:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 11:02:17,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:02:17,309 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2022-01-31 11:02:17,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-01-31 11:02:17,511 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 11:02:17,512 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:02:17,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:02:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1338309955, now seen corresponding path program 2 times [2022-01-31 11:02:17,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:02:17,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436194106] [2022-01-31 11:02:17,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:02:17,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:02:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:17,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:02:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:02:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-31 11:02:17,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:02:17,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436194106] [2022-01-31 11:02:17,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436194106] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:02:17,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479821141] [2022-01-31 11:02:17,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:02:17,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:02:17,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:02:17,615 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 11:02:17,616 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 11:02:17,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:02:17,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:02:17,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 11:02:17,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:02:17,711 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 11:02:17,806 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 11:02:17,826 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 15 treesize of output 17 [2022-01-31 11:02:17,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 15 treesize of output 17 [2022-01-31 11:02:17,858 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 16 treesize of output 8 [2022-01-31 11:02:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:02:17,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:02:17,893 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (not (= c_~N~0 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_498) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) is different from false [2022-01-31 11:02:17,903 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (= (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_498) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) |c_main_#t~mem11|)) is different from false [2022-01-31 11:02:17,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_498) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) is different from false [2022-01-31 11:02:17,922 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:02:17,922 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 18 treesize of output 19 [2022-01-31 11:02:17,924 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 18 treesize of output 14 [2022-01-31 11:02:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 12 not checked. [2022-01-31 11:02:17,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479821141] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:02:17,973 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:02:17,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 14 [2022-01-31 11:02:17,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487720439] [2022-01-31 11:02:17,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:02:17,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 11:02:17,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:02:17,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 11:02:17,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=88, Unknown=3, NotChecked=60, Total=182 [2022-01-31 11:02:17,977 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 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 11:02:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:02:18,231 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-01-31 11:02:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:02:18,231 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 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 45 [2022-01-31 11:02:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:02:18,232 INFO L225 Difference]: With dead ends: 93 [2022-01-31 11:02:18,232 INFO L226 Difference]: Without dead ends: 93 [2022-01-31 11:02:18,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=188, Unknown=3, NotChecked=90, Total=342 [2022-01-31 11:02:18,233 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:02:18,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 136 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 285 Invalid, 0 Unknown, 153 Unchecked, 0.2s Time] [2022-01-31 11:02:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-31 11:02:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2022-01-31 11:02:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.203125) internal successors, (77), 65 states have internal predecessors, (77), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:02:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2022-01-31 11:02:18,237 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 45 [2022-01-31 11:02:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:02:18,237 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2022-01-31 11:02:18,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 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 11:02:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-01-31 11:02:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 11:02:18,238 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:02:18,238 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2022-01-31 11:02:18,265 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 11:02:18,459 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 11:02:18,460 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:02:18,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:02:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1149202878, now seen corresponding path program 5 times [2022-01-31 11:02:18,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:02:18,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021042493] [2022-01-31 11:02:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:02:18,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:02:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:19,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:02:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:19,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:02:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-31 11:02:19,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:02:19,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021042493] [2022-01-31 11:02:19,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021042493] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:02:19,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181220768] [2022-01-31 11:02:19,307 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:02:19,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:02:19,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:02:19,312 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 11:02:19,336 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 11:02:19,438 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:02:19,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:02:19,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-31 11:02:19,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:02:19,465 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 11:02:19,472 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 11:02:19,483 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 23 treesize of output 22 [2022-01-31 11:02:19,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:19,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:02:19,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:19,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:19,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-01-31 11:02:19,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:19,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:19,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:02:19,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:19,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-01-31 11:02:19,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:19,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:19,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:02:19,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:19,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-01-31 11:02:19,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:19,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:02:19,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2022-01-31 11:02:20,126 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 39 treesize of output 35 [2022-01-31 11:02:20,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:20,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:20,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-01-31 11:02:20,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-31 11:02:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:02:20,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:02:20,984 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (<= 3 c_main_~i~0))) (and (or (forall ((v_ArrVal_564 (Array Int Int))) (<= (select (select (store (let ((.cse5 (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) 1))) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base .cse5))) (store .cse0 |c_main_~#sum~0.base| (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (store .cse1 |c_main_~#sum~0.offset| (let ((.cse2 (select .cse5 c_main_~a~0.offset)) (.cse4 (select .cse1 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse2 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse3 .cse4)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (+ c_main_~i~0 1))) .cse6) (or (forall ((v_ArrVal_564 (Array Int Int))) (<= 3 (select (select (store (let ((.cse12 (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) 1))) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base .cse12))) (store .cse7 |c_main_~#sum~0.base| (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (store .cse8 |c_main_~#sum~0.offset| (let ((.cse9 (select .cse12 c_main_~a~0.offset)) (.cse11 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse10 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 .cse11))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse9 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 .cse10 .cse11))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse10 .cse11)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) .cse6))) is different from false [2022-01-31 11:02:21,003 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 2 c_main_~i~0))) (and (or .cse0 (forall ((v_ArrVal_564 (Array Int Int))) (<= 3 (select (select (store (let ((.cse6 (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) 1))) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base .cse6))) (store .cse1 |c_main_~#sum~0.base| (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (let ((.cse3 (select .cse2 |c_main_~#sum~0.offset|)) (.cse4 (select .cse6 c_main_~a~0.offset))) (let ((.cse5 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse3 .cse4 .cse5)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (or .cse0 (forall ((v_ArrVal_564 (Array Int Int))) (<= (select (select (store (let ((.cse12 (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) 1))) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base .cse12))) (store .cse7 |c_main_~#sum~0.base| (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (store .cse8 |c_main_~#sum~0.offset| (let ((.cse9 (select .cse8 |c_main_~#sum~0.offset|)) (.cse10 (select .cse12 c_main_~a~0.offset))) (let ((.cse11 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 .cse10))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 .cse10 .cse11))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse9 .cse10 .cse11)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (+ c_main_~i~0 2)))))) is different from false [2022-01-31 11:02:21,025 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 2 c_main_~i~0))) (and (or .cse0 (forall ((v_ArrVal_564 (Array Int Int))) (<= 3 (select (select (store (let ((.cse6 (let ((.cse7 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse7 c_main_~a~0.offset) 1) (+ .cse7 c_main_~a~0.offset 4) 1)))) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base .cse6))) (store .cse1 |c_main_~#sum~0.base| (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (let ((.cse4 (select .cse6 c_main_~a~0.offset)) (.cse5 (select .cse2 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse3 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse4 .cse5)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (or .cse0 (forall ((v_ArrVal_564 (Array Int Int))) (<= (select (select (store (let ((.cse13 (let ((.cse14 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse14 c_main_~a~0.offset) 1) (+ .cse14 c_main_~a~0.offset 4) 1)))) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base .cse13))) (store .cse8 |c_main_~#sum~0.base| (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (store .cse9 |c_main_~#sum~0.offset| (let ((.cse11 (select .cse13 c_main_~a~0.offset)) (.cse12 (select .cse9 |c_main_~#sum~0.offset|))) (let ((.cse10 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse11 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse10 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse10 .cse11 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse11 .cse12)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (+ c_main_~i~0 2)))))) is different from false [2022-01-31 11:02:21,044 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (<= 1 c_main_~i~0))) (and (or (forall ((v_ArrVal_564 (Array Int Int))) (<= 3 (select (select (store (let ((.cse5 (let ((.cse6 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse6 c_main_~a~0.offset 4) 1) (+ .cse6 c_main_~a~0.offset 8) 1)))) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base .cse5))) (store .cse0 |c_main_~#sum~0.base| (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (store .cse1 |c_main_~#sum~0.offset| (let ((.cse2 (select .cse5 c_main_~a~0.offset)) (.cse4 (select .cse1 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse2 .cse3 .cse4)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) .cse7) (or .cse7 (forall ((v_ArrVal_564 (Array Int Int))) (<= (select (select (store (let ((.cse13 (let ((.cse14 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse14 c_main_~a~0.offset 4) 1) (+ .cse14 c_main_~a~0.offset 8) 1)))) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base .cse13))) (store .cse8 |c_main_~#sum~0.base| (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (store .cse9 |c_main_~#sum~0.offset| (let ((.cse10 (select .cse13 c_main_~a~0.offset)) (.cse12 (select .cse9 |c_main_~#sum~0.offset|))) (let ((.cse11 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse10 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse10 .cse11 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse10 .cse11 .cse12)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (+ c_main_~i~0 3)))))) is different from false [2022-01-31 11:02:21,077 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 1 c_main_~i~0))) (and (or .cse0 (forall ((v_ArrVal_564 (Array Int Int))) (<= (select (select (store (let ((.cse6 (let ((.cse7 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse7 c_main_~a~0.offset) 1) (+ .cse7 c_main_~a~0.offset 4) 1) (+ .cse7 c_main_~a~0.offset 8) 1)))) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base .cse6))) (store .cse1 |c_main_~#sum~0.base| (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (let ((.cse3 (select .cse2 |c_main_~#sum~0.offset|)) (.cse5 (select .cse6 c_main_~a~0.offset))) (let ((.cse4 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse3 .cse4 .cse5 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (+ c_main_~i~0 3)))) (or (forall ((v_ArrVal_564 (Array Int Int))) (<= 3 (select (select (store (let ((.cse13 (let ((.cse14 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse14 c_main_~a~0.offset) 1) (+ .cse14 c_main_~a~0.offset 4) 1) (+ .cse14 c_main_~a~0.offset 8) 1)))) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base .cse13))) (store .cse8 |c_main_~#sum~0.base| (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (store .cse9 |c_main_~#sum~0.offset| (let ((.cse10 (select .cse9 |c_main_~#sum~0.offset|)) (.cse12 (select .cse13 c_main_~a~0.offset))) (let ((.cse11 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse10 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse10 .cse11 .cse12 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse10 .cse11 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) .cse0))) is different from false [2022-01-31 11:02:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-31 11:02:21,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181220768] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:02:21,103 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:02:21,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 53 [2022-01-31 11:02:21,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368344271] [2022-01-31 11:02:21,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:02:21,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-31 11:02:21,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:02:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-31 11:02:21,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1995, Unknown=12, NotChecked=480, Total=2756 [2022-01-31 11:02:21,105 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 53 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 52 states have internal predecessors, (85), 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 11:02:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:02:22,153 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-01-31 11:02:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 11:02:22,154 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 52 states have internal predecessors, (85), 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 45 [2022-01-31 11:02:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:02:22,155 INFO L225 Difference]: With dead ends: 87 [2022-01-31 11:02:22,155 INFO L226 Difference]: Without dead ends: 87 [2022-01-31 11:02:22,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=391, Invalid=2923, Unknown=12, NotChecked=580, Total=3906 [2022-01-31 11:02:22,157 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 546 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:02:22,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 255 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 511 Invalid, 0 Unknown, 546 Unchecked, 0.3s Time] [2022-01-31 11:02:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-31 11:02:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-01-31 11:02:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 78 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:02:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2022-01-31 11:02:22,160 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 45 [2022-01-31 11:02:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:02:22,160 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2022-01-31 11:02:22,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 52 states have internal predecessors, (85), 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 11:02:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-01-31 11:02:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:02:22,161 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:02:22,161 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:02:22,188 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 11:02:22,367 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 11:02:22,368 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:02:22,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:02:22,368 INFO L85 PathProgramCache]: Analyzing trace with hash -387924192, now seen corresponding path program 6 times [2022-01-31 11:02:22,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:02:22,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117509843] [2022-01-31 11:02:22,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:02:22,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:02:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:22,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:02:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:22,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:02:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:02:22,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:02:22,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117509843] [2022-01-31 11:02:22,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117509843] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:02:22,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207907009] [2022-01-31 11:02:22,470 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:02:22,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:02:22,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:02:22,472 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 11:02:22,472 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 11:02:22,543 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 11:02:22,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:02:22,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:02:22,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:02:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:02:22,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:02:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:02:22,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207907009] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:02:22,820 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:02:22,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-01-31 11:02:22,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514735188] [2022-01-31 11:02:22,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:02:22,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 11:02:22,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:02:22,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 11:02:22,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2022-01-31 11:02:22,821 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 25 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 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 11:02:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:02:23,509 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2022-01-31 11:02:23,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 11:02:23,509 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 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 47 [2022-01-31 11:02:23,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:02:23,510 INFO L225 Difference]: With dead ends: 144 [2022-01-31 11:02:23,510 INFO L226 Difference]: Without dead ends: 141 [2022-01-31 11:02:23,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=1753, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 11:02:23,512 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 284 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 11:02:23,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 185 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 11:02:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-01-31 11:02:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2022-01-31 11:02:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 104 states have (on average 1.1442307692307692) internal successors, (119), 106 states have internal predecessors, (119), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 11:02:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2022-01-31 11:02:23,518 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 47 [2022-01-31 11:02:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:02:23,518 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2022-01-31 11:02:23,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 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 11:02:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2022-01-31 11:02:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 11:02:23,519 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:02:23,519 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-01-31 11:02:23,542 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 11:02:23,735 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 11:02:23,736 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:02:23,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:02:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1703195439, now seen corresponding path program 2 times [2022-01-31 11:02:23,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:02:23,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943777231] [2022-01-31 11:02:23,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:02:23,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:02:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:24,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:02:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:24,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:02:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:24,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 11:02:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:02:24,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:02:24,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943777231] [2022-01-31 11:02:24,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943777231] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:02:24,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008993578] [2022-01-31 11:02:24,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:02:24,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:02:24,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:02:24,212 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 11:02:24,235 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 11:02:24,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:02:24,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:02:24,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 11:02:24,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:02:24,385 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 11:02:24,455 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:02:24,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:02:24,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:24,492 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 11:02:24,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:24,503 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 11:02:24,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:24,523 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 11:02:24,585 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:02:24,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:02:24,623 INFO L353 Elim1Store]: treesize reduction 53, result has 5.4 percent of original size [2022-01-31 11:02:24,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 20 [2022-01-31 11:02:24,679 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:02:24,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:02:24,825 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 21 treesize of output 9 [2022-01-31 11:02:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:02:24,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:02:31,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_208 Int)) (or (forall ((v_ArrVal_681 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208)))) is different from false [2022-01-31 11:02:41,810 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 Int) (v_main_~i~0_208 Int)) (or (= (+ (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 2) v_main_~i~0_208)))) is different from false [2022-01-31 11:02:41,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_675 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_675) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) is different from false [2022-01-31 11:02:41,953 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_672 Int) (v_ArrVal_675 (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_672)) |c_main_~#sum~0.base| v_ArrVal_675) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) is different from false [2022-01-31 11:02:41,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_216 Int)) (or (forall ((v_ArrVal_672 Int) (v_ArrVal_675 (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_~a~0.offset (* 4 v_main_~i~0_216)) v_ArrVal_672)) |c_main_~#sum~0.base| v_ArrVal_675) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_216)))) is different from false [2022-01-31 11:02:41,980 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-31 11:02:41,980 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 11:02:41,986 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:02:41,987 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 11:02:41,990 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 11:02:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 16 not checked. [2022-01-31 11:02:42,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008993578] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:02:42,066 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:02:42,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 45 [2022-01-31 11:02:42,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027562794] [2022-01-31 11:02:42,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:02:42,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-31 11:02:42,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:02:42,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-31 11:02:42,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1389, Unknown=19, NotChecked=400, Total=1980 [2022-01-31 11:02:42,068 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 45 states, 44 states have (on average 2.340909090909091) internal successors, (103), 42 states have internal predecessors, (103), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:02:45,296 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (+ (- 1) c_main_~i~0)) (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (forall ((v_main_~i~0_216 Int)) (or (forall ((v_ArrVal_672 Int) (v_ArrVal_675 (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_~a~0.offset (* 4 v_main_~i~0_216)) v_ArrVal_672)) |c_main_~#sum~0.base| v_ArrVal_675) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_216)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 1)) is different from false [2022-01-31 11:02:48,158 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (+ (- 1) c_main_~i~0)) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 0) (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_208 Int)) (or (forall ((v_ArrVal_681 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208))))) is different from false [2022-01-31 11:02:50,807 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 Int) (v_main_~i~0_208 Int)) (or (= (+ (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 2) v_main_~i~0_208)))) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_208 Int)) (or (forall ((v_ArrVal_681 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208)))) (<= c_main_~i~0 2) (not (<= (+ (* c_main_~i~0 4) c_main_~a~0.offset) 7)) (= (select (select |c_#memory_int| c_main_~a~0.base) 4) 0)) is different from false [2022-01-31 11:02:51,322 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~a~0.offset 0) (forall ((v_ArrVal_681 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1)) (forall ((v_ArrVal_681 Int) (v_main_~i~0_208 Int)) (or (= (+ (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208)))) (= (select (select |c_#memory_int| c_main_~a~0.base) 4) 0)) is different from false [2022-01-31 11:02:53,331 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (+ (- 1) c_main_~i~0)) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 1) 1) (forall ((v_main_~i~0_208 Int)) (or (forall ((v_ArrVal_681 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208))))) is different from false [2022-01-31 11:02:55,368 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 Int) (v_main_~i~0_208 Int)) (or (= (+ (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 2) v_main_~i~0_208)))) (forall ((v_main_~i~0_208 Int)) (or (forall ((v_ArrVal_681 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208)))) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1) 1)) is different from false [2022-01-31 11:02:55,945 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1)) (forall ((v_ArrVal_681 Int) (v_main_~i~0_208 Int)) (or (= (+ (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208))))) is different from false [2022-01-31 11:02:57,950 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_208 Int)) (or (forall ((v_ArrVal_681 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208)))) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1) 1)) is different from false [2022-01-31 11:02:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:02:58,159 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2022-01-31 11:02:58,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-31 11:02:58,160 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.340909090909091) internal successors, (103), 42 states have internal predecessors, (103), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 53 [2022-01-31 11:02:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:02:58,161 INFO L225 Difference]: With dead ends: 192 [2022-01-31 11:02:58,161 INFO L226 Difference]: Without dead ends: 190 [2022-01-31 11:02:58,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=305, Invalid=2687, Unknown=30, NotChecked=1534, Total=4556 [2022-01-31 11:02:58,162 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 66 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 602 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:02:58,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 344 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 723 Invalid, 0 Unknown, 602 Unchecked, 0.3s Time] [2022-01-31 11:02:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-01-31 11:02:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 159. [2022-01-31 11:02:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 142 states have (on average 1.1549295774647887) internal successors, (164), 143 states have internal predecessors, (164), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 11:02:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 180 transitions. [2022-01-31 11:02:58,170 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 180 transitions. Word has length 53 [2022-01-31 11:02:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:02:58,170 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 180 transitions. [2022-01-31 11:02:58,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.340909090909091) internal successors, (103), 42 states have internal predecessors, (103), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:02:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 180 transitions. [2022-01-31 11:02:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 11:02:58,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:02:58,171 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:02:58,192 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 11:02:58,383 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 11:02:58,384 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:02:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:02:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash -435884436, now seen corresponding path program 7 times [2022-01-31 11:02:58,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:02:58,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410424449] [2022-01-31 11:02:58,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:02:58,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:02:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:59,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:02:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:59,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:02:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 11:02:59,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:02:59,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410424449] [2022-01-31 11:02:59,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410424449] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:02:59,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016929339] [2022-01-31 11:02:59,532 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:02:59,532 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:02:59,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:02:59,536 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 11:02:59,546 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 11:02:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:02:59,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 68 conjunts are in the unsatisfiable core [2022-01-31 11:02:59,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:02:59,651 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 11:02:59,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,688 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 23 treesize of output 22 [2022-01-31 11:02:59,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:02:59,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-01-31 11:02:59,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:02:59,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2022-01-31 11:03:00,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:03:00,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-01-31 11:03:00,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:03:00,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2022-01-31 11:03:00,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:03:00,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2022-01-31 11:03:00,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2022-01-31 11:03:00,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:00,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 23 [2022-01-31 11:03:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 11:03:00,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:03:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 11:03:03,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016929339] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:03:03,923 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:03:03,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 21] total 64 [2022-01-31 11:03:03,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989347273] [2022-01-31 11:03:03,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:03:03,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-01-31 11:03:03,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:03:03,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-01-31 11:03:03,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3686, Unknown=0, NotChecked=0, Total=4032 [2022-01-31 11:03:03,925 INFO L87 Difference]: Start difference. First operand 159 states and 180 transitions. Second operand has 64 states, 64 states have (on average 1.34375) internal successors, (86), 63 states have internal predecessors, (86), 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 11:03:06,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:03:06,628 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2022-01-31 11:03:06,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 11:03:06,628 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.34375) internal successors, (86), 63 states have internal predecessors, (86), 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 52 [2022-01-31 11:03:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:03:06,629 INFO L225 Difference]: With dead ends: 173 [2022-01-31 11:03:06,629 INFO L226 Difference]: Without dead ends: 173 [2022-01-31 11:03:06,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=496, Invalid=4906, Unknown=0, NotChecked=0, Total=5402 [2022-01-31 11:03:06,631 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 25 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 11:03:06,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 237 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1211 Invalid, 0 Unknown, 182 Unchecked, 1.9s Time] [2022-01-31 11:03:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-01-31 11:03:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2022-01-31 11:03:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 147 states have (on average 1.1564625850340136) internal successors, (170), 148 states have internal predecessors, (170), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 11:03:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2022-01-31 11:03:06,636 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 52 [2022-01-31 11:03:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:03:06,636 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2022-01-31 11:03:06,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.34375) internal successors, (86), 63 states have internal predecessors, (86), 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 11:03:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2022-01-31 11:03:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 11:03:06,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:03:06,637 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:03:06,658 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 11:03:06,851 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 11:03:06,852 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:03:06,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:03:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2049382218, now seen corresponding path program 8 times [2022-01-31 11:03:06,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:03:06,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391040006] [2022-01-31 11:03:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:03:06,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:03:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:03:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:06,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:03:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:03:06,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:03:06,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391040006] [2022-01-31 11:03:06,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391040006] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:03:06,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859592699] [2022-01-31 11:03:06,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:03:06,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:03:06,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:03:06,976 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 11:03:07,004 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 11:03:07,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:03:07,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:03:07,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:03:07,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:03:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:03:07,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:03:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:03:07,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859592699] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:03:07,297 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:03:07,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 11:03:07,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379062452] [2022-01-31 11:03:07,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:03:07,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:03:07,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:03:07,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:03:07,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:03:07,298 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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 11:03:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:03:07,701 INFO L93 Difference]: Finished difference Result 245 states and 274 transitions. [2022-01-31 11:03:07,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 11:03:07,702 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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 11:03:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:03:07,704 INFO L225 Difference]: With dead ends: 245 [2022-01-31 11:03:07,704 INFO L226 Difference]: Without dead ends: 242 [2022-01-31 11:03:07,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2022-01-31 11:03:07,705 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 285 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:03:07,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 104 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:03:07,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-01-31 11:03:07,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 214. [2022-01-31 11:03:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 189 states have (on average 1.1216931216931216) internal successors, (212), 193 states have internal predecessors, (212), 15 states have call successors, (15), 11 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-31 11:03:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 239 transitions. [2022-01-31 11:03:07,713 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 239 transitions. Word has length 54 [2022-01-31 11:03:07,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:03:07,713 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 239 transitions. [2022-01-31 11:03:07,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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 11:03:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 239 transitions. [2022-01-31 11:03:07,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 11:03:07,715 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:03:07,715 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:03:07,737 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 11:03:07,935 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 11:03:07,936 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:03:07,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:03:07,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1085843576, now seen corresponding path program 9 times [2022-01-31 11:03:07,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:03:07,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584720577] [2022-01-31 11:03:07,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:03:07,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:03:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:08,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:03:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:08,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:03:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:03:08,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:03:08,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584720577] [2022-01-31 11:03:08,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584720577] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:03:08,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514725419] [2022-01-31 11:03:08,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:03:08,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:03:08,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:03:08,056 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 11:03:08,083 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 11:03:08,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-01-31 11:03:08,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:03:08,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:03:08,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:03:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:03:08,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:03:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:03:08,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514725419] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:03:08,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:03:08,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 11:03:08,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189677041] [2022-01-31 11:03:08,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:03:08,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:03:08,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:03:08,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:03:08,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:03:08,483 INFO L87 Difference]: Start difference. First operand 214 states and 239 transitions. Second operand has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 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 11:03:08,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:03:08,963 INFO L93 Difference]: Finished difference Result 216 states and 239 transitions. [2022-01-31 11:03:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 11:03:08,964 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 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 54 [2022-01-31 11:03:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:03:08,965 INFO L225 Difference]: With dead ends: 216 [2022-01-31 11:03:08,965 INFO L226 Difference]: Without dead ends: 216 [2022-01-31 11:03:08,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-01-31 11:03:08,966 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 149 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:03:08,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 154 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 11:03:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-01-31 11:03:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 191. [2022-01-31 11:03:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 167 states have (on average 1.1077844311377245) internal successors, (185), 170 states have internal predecessors, (185), 14 states have call successors, (14), 11 states have call predecessors, (14), 9 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-31 11:03:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 210 transitions. [2022-01-31 11:03:08,973 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 210 transitions. Word has length 54 [2022-01-31 11:03:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:03:08,973 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 210 transitions. [2022-01-31 11:03:08,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 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 11:03:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 210 transitions. [2022-01-31 11:03:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 11:03:08,974 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:03:08,974 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:03:08,994 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 11:03:09,187 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 11:03:09,188 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:03:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:03:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash -738348411, now seen corresponding path program 3 times [2022-01-31 11:03:09,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:03:09,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657881137] [2022-01-31 11:03:09,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:03:09,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:03:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:09,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:03:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:09,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:03:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:09,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 11:03:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:09,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 11:03:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:03:09,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:03:09,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657881137] [2022-01-31 11:03:09,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657881137] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:03:09,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546657523] [2022-01-31 11:03:09,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:03:09,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:03:09,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:03:09,932 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 11:03:09,960 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 11:03:10,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-31 11:03:10,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:03:10,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-31 11:03:10,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:03:10,145 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 11:03:10,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:10,238 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 11:03:10,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:10,269 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 11:03:10,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:10,290 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 11:03:10,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:10,366 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 21 treesize of output 20 [2022-01-31 11:03:10,395 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 11:03:10,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-01-31 11:03:10,524 INFO L353 Elim1Store]: treesize reduction 30, result has 46.4 percent of original size [2022-01-31 11:03:10,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2022-01-31 11:03:11,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:03:11,709 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:03:11,709 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 39 treesize of output 28 [2022-01-31 11:03:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:03:11,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:03:34,055 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 2 c_~N~0)) (forall ((v_ArrVal_951 Int) (main_~i~0 Int) (v_ArrVal_948 (Array Int Int)) (v_main_~i~0_303 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_303)) (= (select (let ((.cse0 (store (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_948) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_951)) (.cse1 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ c_main_~a~0.offset 8)) 0) (not (< v_main_~i~0_303 c_~N~0)) (< (+ v_main_~i~0_303 1) c_~N~0)))) is different from false [2022-01-31 11:03:34,218 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_main_~i~0_311 Int) (v_ArrVal_951 Int) (v_ArrVal_948 (Array Int Int)) (v_main_~i~0_303 Int)) (or (<= v_main_~i~0_303 1) (= (select (let ((.cse0 (store (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_948) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_311)) v_ArrVal_951)) (.cse1 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset 8)) 0) (not (<= (+ v_main_~i~0_311 1) v_main_~i~0_303)) (<= c_main_~i~0 v_main_~i~0_303))) (<= c_main_~i~0 2)) is different from false [2022-01-31 11:03:34,253 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_main_~i~0 1) (forall ((v_main_~i~0_311 Int) (v_ArrVal_951 Int) (v_ArrVal_948 (Array Int Int)) (v_main_~i~0_303 Int)) (or (<= v_main_~i~0_303 1) (<= (+ c_main_~i~0 1) v_main_~i~0_303) (= (select (let ((.cse0 (store (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_948) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_311)) v_ArrVal_951)) (.cse1 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset 8)) 0) (not (<= (+ v_main_~i~0_311 1) v_main_~i~0_303))))) is different from false [2022-01-31 11:03:34,267 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:03:34,267 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 70 treesize of output 59 [2022-01-31 11:03:34,270 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 98 treesize of output 92 [2022-01-31 11:03:34,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:03:34,288 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:03:34,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 101 [2022-01-31 11:03:34,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:03:34,313 INFO L353 Elim1Store]: treesize reduction 22, result has 51.1 percent of original size [2022-01-31 11:03:34,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 114 [2022-01-31 11:03:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2022-01-31 11:03:34,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546657523] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:03:34,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:03:34,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 22] total 58 [2022-01-31 11:03:34,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849772361] [2022-01-31 11:03:34,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:03:34,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-31 11:03:34,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:03:34,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-31 11:03:34,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=2639, Unknown=11, NotChecked=324, Total=3306 [2022-01-31 11:03:34,732 INFO L87 Difference]: Start difference. First operand 191 states and 210 transitions. Second operand has 58 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 55 states have internal predecessors, (118), 8 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 11:03:50,253 WARN L228 SmtUtils]: Spent 11.21s on a formula simplification. DAG size of input: 55 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:03:51,108 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~i~0 4)) (.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= (select .cse0 (+ .cse1 c_main_~a~0.offset)) 0) (not (< c_main_~i~0 c_~N~0))) (<= c_main_~i~0 3) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= 12 (* c_~N~0 4)) (= c_main_~a~0.offset 0) (= (select .cse0 8) 1) (or (not (< 2 c_~N~0)) (forall ((v_ArrVal_951 Int) (main_~i~0 Int) (v_ArrVal_948 (Array Int Int)) (v_main_~i~0_303 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_303)) (= (select (let ((.cse2 (store (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_948) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_951)) (.cse3 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse2 .cse3 (+ (select .cse2 .cse3) (- 1)))) (+ c_main_~a~0.offset 8)) 0) (not (< v_main_~i~0_303 c_~N~0)) (< (+ v_main_~i~0_303 1) c_~N~0)))) (or (= (select .cse0 (+ .cse1 c_main_~a~0.offset 4)) 0) (not (< (+ c_main_~i~0 1) c_~N~0))) (<= c_~N~0 3) (or (not (< (+ c_main_~i~0 2) c_~N~0)) (= (select .cse0 (+ .cse1 c_main_~a~0.offset 8)) 0)) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1))) is different from false [2022-01-31 11:03:51,888 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (= c_main_~i~0 0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= 12 (* c_~N~0 4)) (= c_main_~a~0.offset 0) (= (select .cse0 8) 1) (or (not (< 2 c_~N~0)) (forall ((v_ArrVal_951 Int) (main_~i~0 Int) (v_ArrVal_948 (Array Int Int)) (v_main_~i~0_303 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_303)) (= (select (let ((.cse1 (store (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_948) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_951)) (.cse2 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ c_main_~a~0.offset 8)) 0) (not (< v_main_~i~0_303 c_~N~0)) (< (+ v_main_~i~0_303 1) c_~N~0)))) (<= c_~N~0 3) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1))) is different from false [2022-01-31 11:03:52,709 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= 12 (* c_~N~0 4)) (= c_main_~a~0.offset 0) (= (select .cse0 8) 1) (or (not (< 2 c_~N~0)) (forall ((v_ArrVal_951 Int) (main_~i~0 Int) (v_ArrVal_948 (Array Int Int)) (v_main_~i~0_303 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_303)) (= (select (let ((.cse1 (store (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_948) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_951)) (.cse2 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ c_main_~a~0.offset 8)) 0) (not (< v_main_~i~0_303 c_~N~0)) (< (+ v_main_~i~0_303 1) c_~N~0)))) (<= c_~N~0 3) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1))) is different from false [2022-01-31 11:03:53,866 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~i~0 4)) (.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse4 (= (select .cse1 8) 1)) (.cse0 (* c_~N~0 4)) (.cse3 (= .cse2 8)) (.cse7 (= (select .cse1 (+ c_main_~a~0.offset 8)) 1))) (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (< c_main_~i~0 c_~N~0) (<= 12 .cse0) (= c_main_~a~0.offset 0) (or (= (+ (select .cse1 (+ .cse2 c_main_~a~0.offset)) 1) 1) (not .cse3)) (<= 3 c_~N~0) .cse4 (or (forall ((v_ArrVal_951 Int) (v_ArrVal_949 Int) (v_main_~i~0_305 Int) (v_main_~i~0_303 Int)) (or (not (<= (+ v_main_~i~0_305 1) v_main_~i~0_303)) (not (< v_main_~i~0_303 c_~N~0)) (= (select (let ((.cse5 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_949) (+ c_main_~a~0.offset (* 4 v_main_~i~0_305)) v_ArrVal_951)) (.cse6 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6)))) (+ c_main_~a~0.offset 8)) 0) (< (+ v_main_~i~0_303 1) c_~N~0))) (not (< 2 c_~N~0))) (or .cse4 (<= (+ .cse2 c_main_~a~0.offset 9) .cse0)) (<= c_~N~0 3) (or .cse3 .cse7) (or (not (< (+ c_main_~i~0 2) c_~N~0)) (= (select .cse1 (+ .cse2 c_main_~a~0.offset 8)) 0)) .cse7))) is different from false [2022-01-31 11:03:54,395 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_main_~i~0 4))) (let ((.cse4 (= .cse3 8)) (.cse2 (select |c_#memory_int| c_main_~a~0.base))) (and (<= c_main_~i~0 1) (or (forall ((v_ArrVal_951 Int) (main_~i~0 Int) (v_main_~i~0_303 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_303)) (not (< v_main_~i~0_303 c_~N~0)) (= (select (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_951)) (.cse1 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset 8)) 0) (< (+ v_main_~i~0_303 1) c_~N~0))) (not (< 2 c_~N~0))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (< c_main_~i~0 c_~N~0) (= c_main_~a~0.offset 0) (or (= (+ (select .cse2 (+ .cse3 c_main_~a~0.offset)) 1) 1) (not .cse4)) (<= 3 c_~N~0) (or (= (select .cse2 8) 1) (<= (+ .cse3 c_main_~a~0.offset 9) (* c_~N~0 4))) (<= c_~N~0 3) (or .cse4 (= (select .cse2 (+ c_main_~a~0.offset 8)) 1))))) is different from false [2022-01-31 11:03:54,970 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (let ((.cse3 (= .cse4 8)) (.cse2 (select |c_#memory_int| c_main_~a~0.base))) (and (or (forall ((v_ArrVal_951 Int) (main_~i~0 Int) (v_main_~i~0_303 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_303)) (not (< v_main_~i~0_303 c_~N~0)) (= (select (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_951)) (.cse1 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset 8)) 0) (< (+ v_main_~i~0_303 1) c_~N~0))) (not (< 2 c_~N~0))) (or (<= 3 c_main_~i~0) (= (select .cse2 (+ c_main_~a~0.offset 8)) 1)) (or (<= (+ c_main_~i~0 1) c_~N~0) (= (select .cse2 8) 0)) (= c_main_~a~0.offset 0) (<= c_~N~0 3) (or .cse3 (and (<= 3 c_~N~0) (<= c_main_~i~0 2))) (or (not .cse3) (and (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (or (<= (+ c_main_~i~0 2) c_~N~0) (= (select .cse2 .cse4) 1)))) (exists ((v_main_~i~0_296 Int)) (let ((.cse7 (* 4 v_main_~i~0_296))) (let ((.cse6 (= 8 .cse7)) (.cse5 (select |c_#memory_int| c_main_~a~0.base))) (and (<= c_main_~i~0 (+ v_main_~i~0_296 1)) (or (= (select .cse5 (+ c_main_~a~0.offset 8)) 1) .cse6) (or (not .cse6) (= (+ (select .cse5 (+ c_main_~a~0.offset .cse7)) 1) 1)) (< v_main_~i~0_296 c_~N~0)))))))) is different from false [2022-01-31 11:03:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:03:55,513 INFO L93 Difference]: Finished difference Result 215 states and 233 transitions. [2022-01-31 11:03:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 11:03:55,513 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 55 states have internal predecessors, (118), 8 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-01-31 11:03:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:03:55,514 INFO L225 Difference]: With dead ends: 215 [2022-01-31 11:03:55,515 INFO L226 Difference]: Without dead ends: 192 [2022-01-31 11:03:55,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 97 SyntacticMatches, 12 SemanticMatches, 83 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1912 ImplicationChecksByTransitivity, 43.4s TimeCoverageRelationStatistics Valid=613, Invalid=5104, Unknown=19, NotChecked=1404, Total=7140 [2022-01-31 11:03:55,517 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 80 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:03:55,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 319 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 658 Invalid, 0 Unknown, 385 Unchecked, 0.3s Time] [2022-01-31 11:03:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-01-31 11:03:55,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2022-01-31 11:03:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 167 states have (on average 1.1017964071856288) internal successors, (184), 170 states have internal predecessors, (184), 14 states have call successors, (14), 11 states have call predecessors, (14), 9 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-31 11:03:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 209 transitions. [2022-01-31 11:03:55,529 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 209 transitions. Word has length 61 [2022-01-31 11:03:55,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:03:55,530 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 209 transitions. [2022-01-31 11:03:55,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 55 states have internal predecessors, (118), 8 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 11:03:55,530 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 209 transitions. [2022-01-31 11:03:55,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 11:03:55,531 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:03:55,531 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:03:55,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-01-31 11:03:55,747 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 11:03:55,747 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:03:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:03:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1479409542, now seen corresponding path program 2 times [2022-01-31 11:03:55,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:03:55,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244700032] [2022-01-31 11:03:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:03:55,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:03:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:55,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:03:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:55,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:03:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:55,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 11:03:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:55,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 11:03:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-01-31 11:03:55,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:03:55,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244700032] [2022-01-31 11:03:55,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244700032] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:03:55,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631911841] [2022-01-31 11:03:55,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:03:55,833 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:03:55,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:03:55,834 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 11:03:55,841 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 11:03:55,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:03:55,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:03:55,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-31 11:03:55,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:03:55,969 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 11:03:56,062 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 11:03:56,077 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 11:03:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 11:03:56,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:03:56,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array Int Int))) (= (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1006) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) |c_main_#t~mem11|)) is different from false [2022-01-31 11:03:56,161 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 18 treesize of output 14 [2022-01-31 11:03:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 2 not checked. [2022-01-31 11:03:56,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631911841] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:03:56,210 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:03:56,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 12 [2022-01-31 11:03:56,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597739407] [2022-01-31 11:03:56,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:03:56,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:03:56,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:03:56,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:03:56,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2022-01-31 11:03:56,211 INFO L87 Difference]: Start difference. First operand 191 states and 209 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 11:03:56,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:03:56,400 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2022-01-31 11:03:56,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:03:56,400 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2022-01-31 11:03:56,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:03:56,401 INFO L225 Difference]: With dead ends: 173 [2022-01-31 11:03:56,401 INFO L226 Difference]: Without dead ends: 156 [2022-01-31 11:03:56,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=186, Unknown=1, NotChecked=28, Total=272 [2022-01-31 11:03:56,402 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:03:56,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 92 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 259 Invalid, 0 Unknown, 56 Unchecked, 0.1s Time] [2022-01-31 11:03:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-01-31 11:03:56,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2022-01-31 11:03:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 122 states have (on average 1.0737704918032787) internal successors, (131), 124 states have internal predecessors, (131), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 11:03:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2022-01-31 11:03:56,407 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 61 [2022-01-31 11:03:56,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:03:56,408 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2022-01-31 11:03:56,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 11:03:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2022-01-31 11:03:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 11:03:56,408 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:03:56,409 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1] [2022-01-31 11:03:56,432 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 11:03:56,627 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 11:03:56,628 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:03:56,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:03:56,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1777309258, now seen corresponding path program 10 times [2022-01-31 11:03:56,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:03:56,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109737383] [2022-01-31 11:03:56,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:03:56,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:03:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:58,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:03:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:03:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:03:58,220 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 11:03:58,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:03:58,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109737383] [2022-01-31 11:03:58,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109737383] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:03:58,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909625956] [2022-01-31 11:03:58,221 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:03:58,221 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:03:58,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:03:58,222 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 11:03:58,223 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 11:03:58,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:03:58,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:03:58,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-31 11:03:58,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:03:58,345 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 11:03:58,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,396 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 23 treesize of output 22 [2022-01-31 11:03:58,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-01-31 11:03:58,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-01-31 11:03:58,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-01-31 11:03:58,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:58,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-01-31 11:03:59,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:03:59,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2022-01-31 11:03:59,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:03:59,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 73 [2022-01-31 11:03:59,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:03:59,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 80 [2022-01-31 11:03:59,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:03:59,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 73 [2022-01-31 11:03:59,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:03:59,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2022-01-31 11:04:00,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:00,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 26 [2022-01-31 11:04:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 11:04:00,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:04:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 11:04:08,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909625956] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:04:08,979 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:04:08,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 25] total 76 [2022-01-31 11:04:08,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842699581] [2022-01-31 11:04:08,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:04:08,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-01-31 11:04:08,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:04:08,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-01-31 11:04:08,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=5284, Unknown=0, NotChecked=0, Total=5700 [2022-01-31 11:04:08,981 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand has 76 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 75 states have internal predecessors, (98), 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 11:04:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:04:17,354 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-01-31 11:04:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 11:04:17,355 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 75 states have internal predecessors, (98), 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 59 [2022-01-31 11:04:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:04:17,356 INFO L225 Difference]: With dead ends: 161 [2022-01-31 11:04:17,356 INFO L226 Difference]: Without dead ends: 161 [2022-01-31 11:04:17,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2589 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=629, Invalid=7381, Unknown=0, NotChecked=0, Total=8010 [2022-01-31 11:04:17,357 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-01-31 11:04:17,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 265 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1788 Invalid, 0 Unknown, 175 Unchecked, 5.7s Time] [2022-01-31 11:04:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-01-31 11:04:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2022-01-31 11:04:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 139 states have (on average 1.079136690647482) internal successors, (150), 141 states have internal predecessors, (150), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 11:04:17,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2022-01-31 11:04:17,361 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 59 [2022-01-31 11:04:17,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:04:17,361 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2022-01-31 11:04:17,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 75 states have internal predecessors, (98), 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 11:04:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2022-01-31 11:04:17,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 11:04:17,362 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:04:17,362 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1] [2022-01-31 11:04:17,379 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 11:04:17,562 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 11:04:17,563 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:04:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:04:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash 732020524, now seen corresponding path program 11 times [2022-01-31 11:04:17,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:04:17,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187352144] [2022-01-31 11:04:17,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:17,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:04:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:04:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:04:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 27 proven. 34 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:04:17,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:04:17,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187352144] [2022-01-31 11:04:17,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187352144] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:04:17,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047923710] [2022-01-31 11:04:17,701 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:04:17,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:04:17,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:04:17,704 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 11:04:17,729 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 11:04:18,317 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-01-31 11:04:18,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:04:18,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 11:04:18,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:04:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:04:18,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:04:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:04:18,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047923710] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:04:18,785 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:04:18,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 35 [2022-01-31 11:04:18,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689678310] [2022-01-31 11:04:18,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:04:18,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-31 11:04:18,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:04:18,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-31 11:04:18,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 11:04:18,787 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 34 states have internal predecessors, (96), 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 11:04:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:04:20,102 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2022-01-31 11:04:20,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 11:04:20,103 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 34 states have internal predecessors, (96), 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 61 [2022-01-31 11:04:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:04:20,104 INFO L225 Difference]: With dead ends: 230 [2022-01-31 11:04:20,104 INFO L226 Difference]: Without dead ends: 227 [2022-01-31 11:04:20,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=745, Invalid=4805, Unknown=0, NotChecked=0, Total=5550 [2022-01-31 11:04:20,105 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 601 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 11:04:20,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 251 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 11:04:20,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-01-31 11:04:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 195. [2022-01-31 11:04:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 173 states have (on average 1.0578034682080926) internal successors, (183), 175 states have internal predecessors, (183), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 11:04:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 206 transitions. [2022-01-31 11:04:20,111 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 206 transitions. Word has length 61 [2022-01-31 11:04:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:04:20,112 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 206 transitions. [2022-01-31 11:04:20,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 34 states have internal predecessors, (96), 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 11:04:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 206 transitions. [2022-01-31 11:04:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 11:04:20,112 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:04:20,113 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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 11:04:20,141 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 11:04:20,313 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 11:04:20,314 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:04:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:04:20,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1453306092, now seen corresponding path program 4 times [2022-01-31 11:04:20,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:04:20,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635938416] [2022-01-31 11:04:20,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:20,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:04:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:21,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:04:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:21,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:04:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 11:04:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:21,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 11:04:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:04:21,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:04:21,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635938416] [2022-01-31 11:04:21,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635938416] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:04:21,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143939608] [2022-01-31 11:04:21,174 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:04:21,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:04:21,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:04:21,175 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 11:04:21,206 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 11:04:21,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:04:21,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:04:21,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-31 11:04:21,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:04:21,414 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 11:04:21,479 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:04:21,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:04:21,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:21,545 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 11:04:21,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:21,585 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 11:04:21,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:21,600 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 11:04:21,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:21,612 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 11:04:21,675 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:04:21,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:04:21,719 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:04:21,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:04:21,764 INFO L353 Elim1Store]: treesize reduction 53, result has 5.4 percent of original size [2022-01-31 11:04:21,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 20 [2022-01-31 11:04:21,831 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:04:21,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:04:22,143 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 21 treesize of output 9 [2022-01-31 11:04:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:04:22,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:04:30,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_400 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_400)) (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0)))) is different from false [2022-01-31 11:04:30,940 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_400 Int) (v_ArrVal_1257 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_400)))) is different from false [2022-01-31 11:04:31,513 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_400 Int) (v_ArrVal_1257 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_400)) (= (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0))) is different from false [2022-01-31 11:05:00,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1250 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1250) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 1)) is different from false [2022-01-31 11:05:01,006 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 Int) (v_ArrVal_1250 (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_1246)) |c_main_~#sum~0.base| v_ArrVal_1250) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 1)) is different from false [2022-01-31 11:05:01,017 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_410 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_410)) (forall ((v_ArrVal_1246 Int) (v_ArrVal_1250 (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) (+ (* 4 v_main_~i~0_410) c_main_~a~0.offset) v_ArrVal_1246)) |c_main_~#sum~0.base| v_ArrVal_1250) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 1)))) is different from false [2022-01-31 11:05:01,032 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-31 11:05:01,033 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 11:05:01,038 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:05:01,038 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 11:05:01,041 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 11:05:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 31 not checked. [2022-01-31 11:05:01,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143939608] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:05:01,165 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:05:01,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 63 [2022-01-31 11:05:01,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930418021] [2022-01-31 11:05:01,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:05:01,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-01-31 11:05:01,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:05:01,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-01-31 11:05:01,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2893, Unknown=42, NotChecked=690, Total=3906 [2022-01-31 11:05:01,167 INFO L87 Difference]: Start difference. First operand 195 states and 206 transitions. Second operand has 63 states, 62 states have (on average 2.2096774193548385) internal successors, (137), 60 states have internal predecessors, (137), 8 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 11:05:03,545 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_410 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_410)) (forall ((v_ArrVal_1246 Int) (v_ArrVal_1250 (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) (+ (* 4 v_main_~i~0_410) c_main_~a~0.offset) v_ArrVal_1246)) |c_main_~#sum~0.base| v_ArrVal_1250) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 1)))) (= c_main_~i~0 2) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= c_main_~i~0 2) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 1) (<= (+ 2 (div (* (- 1) c_main_~a~0.offset) 4)) c_main_~i~0)) is different from false [2022-01-31 11:05:08,229 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (and (= (select (select |c_#memory_int| c_main_~a~0.base) .cse0) 0) (= .cse0 8) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_400 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_400)) (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0)))))) is different from false [2022-01-31 11:05:45,717 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_400 Int) (v_ArrVal_1254 Int) (v_ArrVal_1257 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_400)) (= (select (store (let ((.cse2 (* c_main_~i~0 4))) (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_1254)) (.cse1 (+ .cse2 c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0))) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) 8) 0) (forall ((v_main_~i~0_400 Int) (v_ArrVal_1257 Int)) (or (= (select (store (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse3 .cse4 (+ (- 1) (select .cse3 .cse4)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_400))))) is different from false [2022-01-31 11:05:46,404 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_400 Int) (v_ArrVal_1254 Int) (v_ArrVal_1257 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_400)) (= (select (store (let ((.cse2 (* c_main_~i~0 4))) (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_1254)) (.cse1 (+ .cse2 c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0))) (forall ((v_main_~i~0_400 Int) (v_ArrVal_1257 Int)) (or (= (select (store (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse3 .cse4 (+ (- 1) (select .cse3 .cse4)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_400))))) is different from false [2022-01-31 11:05:48,418 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_400 Int) (v_ArrVal_1257 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_400)) (= (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0))) (forall ((v_main_~i~0_400 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_400)) (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0))))) is different from false [2022-01-31 11:05:49,029 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0)) (forall ((v_main_~i~0_400 Int) (v_ArrVal_1257 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_400))))) is different from false [2022-01-31 11:05:51,077 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_400 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_400)) (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0)))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 0)) is different from false [2022-01-31 11:05:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:05:51,413 INFO L93 Difference]: Finished difference Result 226 states and 240 transitions. [2022-01-31 11:05:51,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 11:05:51,414 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.2096774193548385) internal successors, (137), 60 states have internal predecessors, (137), 8 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 68 [2022-01-31 11:05:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:05:51,415 INFO L225 Difference]: With dead ends: 226 [2022-01-31 11:05:51,415 INFO L226 Difference]: Without dead ends: 224 [2022-01-31 11:05:51,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 112 SyntacticMatches, 14 SemanticMatches, 92 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 89.3s TimeCoverageRelationStatistics Valid=561, Invalid=5861, Unknown=110, NotChecked=2210, Total=8742 [2022-01-31 11:05:51,416 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 90 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 674 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:05:51,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 421 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1253 Invalid, 0 Unknown, 674 Unchecked, 0.6s Time] [2022-01-31 11:05:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-01-31 11:05:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2022-01-31 11:05:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 195 states have (on average 1.0615384615384615) internal successors, (207), 197 states have internal predecessors, (207), 16 states have call successors, (16), 12 states have call predecessors, (16), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-31 11:05:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 236 transitions. [2022-01-31 11:05:51,423 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 236 transitions. Word has length 68 [2022-01-31 11:05:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:05:51,423 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 236 transitions. [2022-01-31 11:05:51,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.2096774193548385) internal successors, (137), 60 states have internal predecessors, (137), 8 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 11:05:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 236 transitions. [2022-01-31 11:05:51,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 11:05:51,424 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:05:51,424 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:05:51,453 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 11:05:51,651 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 11:05:51,651 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:05:51,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:05:51,651 INFO L85 PathProgramCache]: Analyzing trace with hash -641012291, now seen corresponding path program 5 times [2022-01-31 11:05:51,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:05:51,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449172070] [2022-01-31 11:05:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:05:51,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:05:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:05:52,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:05:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:05:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:05:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:05:52,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 11:05:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:05:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:05:52,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:05:52,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449172070] [2022-01-31 11:05:52,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449172070] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:05:52,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352549740] [2022-01-31 11:05:52,388 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:05:52,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:05:52,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:05:52,392 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 11:05:52,422 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 11:05:52,794 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 11:05:52,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:05:52,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-31 11:05:52,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:05:52,817 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 11:05:52,858 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 11:05:52,926 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:05:52,926 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 11:05:52,970 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:05:52,970 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 11:05:53,014 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:05:53,014 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 11:05:53,072 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 11:05:53,083 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 11:05:53,093 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 11:05:53,104 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 11:05:53,112 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 11:05:53,179 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:05:53,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:05:53,220 INFO L353 Elim1Store]: treesize reduction 53, result has 5.4 percent of original size [2022-01-31 11:05:53,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 20 [2022-01-31 11:05:53,281 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:05:53,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:05:53,327 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:05:53,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:05:53,401 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:05:53,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:05:53,569 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 21 treesize of output 9 [2022-01-31 11:05:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 11 proven. 69 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:05:53,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:05:59,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_427 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_427)) (forall ((v_ArrVal_1355 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1)))) is different from false [2022-01-31 11:06:00,511 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1354 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int)) (or (= (+ (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 1) v_main_~i~0_427)))) is different from false [2022-01-31 11:06:02,553 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_428 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_428)) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int)) (or (= (+ (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))))) is different from false [2022-01-31 11:06:04,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int) (v_main_~i~0_428 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_428)) (= (+ (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1352) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))) is different from false [2022-01-31 11:06:06,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_429 Int)) (or (forall ((v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int) (v_main_~i~0_428 Int)) (or (not (<= (+ v_main_~i~0_429 1) v_main_~i~0_428)) (= (+ (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_429)) v_ArrVal_1352) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_429)))) is different from false [2022-01-31 11:06:08,747 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_main_~i~0_429 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int) (v_main_~i~0_428 Int)) (or (not (<= (+ v_main_~i~0_429 1) v_main_~i~0_428)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_429)) (= (+ (select (store (store (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_429)) v_ArrVal_1352) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))) is different from false [2022-01-31 11:06:10,881 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_main_~i~0_429 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int) (v_main_~i~0_428 Int)) (or (= (+ (select (store (store (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_429)) v_ArrVal_1352) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 2) v_main_~i~0_429)) (not (<= (+ v_main_~i~0_429 1) v_main_~i~0_428)) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))) is different from false [2022-01-31 11:06:12,944 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_main_~i~0_429 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int) (v_main_~i~0_428 Int) (v_ArrVal_1348 Int)) (or (= (+ (select (store (store (store (let ((.cse2 (* c_main_~i~0 4))) (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_1348)) (.cse1 (+ .cse2 c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_429)) v_ArrVal_1352) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 2) v_main_~i~0_429)) (not (<= (+ v_main_~i~0_429 1) v_main_~i~0_428)) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))) is different from false [2022-01-31 11:06:16,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1346 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) is different from false [2022-01-31 11:06:16,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1341 Int) (v_ArrVal_1346 (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_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) is different from false [2022-01-31 11:06:16,307 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_439 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_439)) (forall ((v_ArrVal_1341 Int) (v_ArrVal_1346 (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_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)))) is different from false [2022-01-31 11:06:16,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1341 Int) (v_ArrVal_1346 (Array Int Int)) (v_main_~i~0_439 Int) (v_ArrVal_1338 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_439)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1338) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1))) is different from false [2022-01-31 11:06:16,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_440 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_440)) (forall ((v_ArrVal_1341 Int) (v_ArrVal_1346 (Array Int Int)) (v_main_~i~0_439 Int) (v_ArrVal_1338 Int)) (or (not (<= (+ v_main_~i~0_440 1) v_main_~i~0_439)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_440) c_main_~a~0.offset) v_ArrVal_1338) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1))))) is different from false [2022-01-31 11:06:16,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1341 Int) (v_main_~i~0_440 Int) (v_ArrVal_1346 (Array Int Int)) (v_ArrVal_1336 Int) (v_main_~i~0_439 Int) (v_ArrVal_1338 Int)) (or (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1336) (+ (* 4 v_main_~i~0_440) c_main_~a~0.offset) v_ArrVal_1338) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1) (not (<= (+ v_main_~i~0_440 1) v_main_~i~0_439)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_440)))) is different from false [2022-01-31 11:06:16,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_441 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_441)) (forall ((v_ArrVal_1341 Int) (v_main_~i~0_440 Int) (v_ArrVal_1346 (Array Int Int)) (v_ArrVal_1336 Int) (v_main_~i~0_439 Int) (v_ArrVal_1338 Int)) (or (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_441)) v_ArrVal_1336) (+ (* 4 v_main_~i~0_440) c_main_~a~0.offset) v_ArrVal_1338) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1) (not (<= (+ v_main_~i~0_440 1) v_main_~i~0_439)) (not (<= (+ v_main_~i~0_441 1) v_main_~i~0_440)))))) is different from false [2022-01-31 11:06:16,479 INFO L353 Elim1Store]: treesize reduction 267, result has 15.5 percent of original size [2022-01-31 11:06:16,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 61 [2022-01-31 11:06:16,488 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:06:16,489 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 11:06:16,492 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 11:06:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 67 not checked. [2022-01-31 11:06:16,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352549740] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:06:16,569 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:06:16,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 27] total 60 [2022-01-31 11:06:16,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037213424] [2022-01-31 11:06:16,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:06:16,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-01-31 11:06:16,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:06:16,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-01-31 11:06:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1783, Unknown=17, NotChecked=1500, Total=3540 [2022-01-31 11:06:16,571 INFO L87 Difference]: Start difference. First operand 222 states and 236 transitions. Second operand has 60 states, 59 states have (on average 2.23728813559322) internal successors, (132), 57 states have internal predecessors, (132), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:06:18,645 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (forall ((v_main_~i~0_441 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_441)) (forall ((v_ArrVal_1341 Int) (v_main_~i~0_440 Int) (v_ArrVal_1346 (Array Int Int)) (v_ArrVal_1336 Int) (v_main_~i~0_439 Int) (v_ArrVal_1338 Int)) (or (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_441)) v_ArrVal_1336) (+ (* 4 v_main_~i~0_440) c_main_~a~0.offset) v_ArrVal_1338) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1) (not (<= (+ v_main_~i~0_440 1) v_main_~i~0_439)) (not (<= (+ v_main_~i~0_441 1) v_main_~i~0_440)))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 1)) is different from false [2022-01-31 11:06:20,661 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_440 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_440)) (forall ((v_ArrVal_1341 Int) (v_ArrVal_1346 (Array Int Int)) (v_main_~i~0_439 Int) (v_ArrVal_1338 Int)) (or (not (<= (+ v_main_~i~0_440 1) v_main_~i~0_439)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_440) c_main_~a~0.offset) v_ArrVal_1338) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1))))) (= (select (select |c_#memory_int| c_main_~a~0.base) 4) 1) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= (+ (* c_main_~i~0 4) c_main_~a~0.offset (- 8)) 0)) is different from false [2022-01-31 11:06:22,683 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) 4) 1) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= (+ 2 (div (+ (* (- 1) c_main_~a~0.offset) 4) 4)) c_main_~i~0) (forall ((v_main_~i~0_439 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_439)) (forall ((v_ArrVal_1341 Int) (v_ArrVal_1346 (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_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1))))) is different from false [2022-01-31 11:06:24,944 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 0) (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_429 Int)) (or (forall ((v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int) (v_main_~i~0_428 Int)) (or (not (<= (+ v_main_~i~0_429 1) v_main_~i~0_428)) (= (+ (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_429)) v_ArrVal_1352) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_429))))) is different from false [2022-01-31 11:06:26,990 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_428 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_428)) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int)) (or (= (+ (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= c_main_~i~0 2) (not (<= (+ (* c_main_~i~0 4) c_main_~a~0.offset) 7)) (= (select (select |c_#memory_int| c_main_~a~0.base) 4) 0)) is different from false [2022-01-31 11:06:29,050 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_427 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_427)) (forall ((v_ArrVal_1355 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= (+ 2 (div (+ (* (- 1) c_main_~a~0.offset) 4) 4)) c_main_~i~0) (= (select (select |c_#memory_int| c_main_~a~0.base) 4) 0)) is different from false [2022-01-31 11:06:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:06:29,574 INFO L93 Difference]: Finished difference Result 259 states and 275 transitions. [2022-01-31 11:06:29,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 11:06:29,575 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.23728813559322) internal successors, (132), 57 states have internal predecessors, (132), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 67 [2022-01-31 11:06:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:06:29,576 INFO L225 Difference]: With dead ends: 259 [2022-01-31 11:06:29,576 INFO L226 Difference]: Without dead ends: 259 [2022-01-31 11:06:29,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 105 SyntacticMatches, 24 SemanticMatches, 75 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=354, Invalid=2787, Unknown=23, NotChecked=2688, Total=5852 [2022-01-31 11:06:29,578 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 67 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 2590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1305 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:06:29,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 425 Invalid, 2590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1197 Invalid, 0 Unknown, 1305 Unchecked, 0.6s Time] [2022-01-31 11:06:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-01-31 11:06:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 237. [2022-01-31 11:06:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 206 states have (on average 1.0631067961165048) internal successors, (219), 209 states have internal predecessors, (219), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 11:06:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 250 transitions. [2022-01-31 11:06:29,585 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 250 transitions. Word has length 67 [2022-01-31 11:06:29,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:06:29,585 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 250 transitions. [2022-01-31 11:06:29,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.23728813559322) internal successors, (132), 57 states have internal predecessors, (132), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:06:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 250 transitions. [2022-01-31 11:06:29,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 11:06:29,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:06:29,587 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1] [2022-01-31 11:06:29,607 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 11:06:29,791 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 11:06:29,791 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:06:29,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:06:29,792 INFO L85 PathProgramCache]: Analyzing trace with hash -181723968, now seen corresponding path program 4 times [2022-01-31 11:06:29,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:06:29,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723159411] [2022-01-31 11:06:29,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:06:29,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:06:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:06:30,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:06:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:06:30,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:06:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:06:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-31 11:06:30,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:06:30,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723159411] [2022-01-31 11:06:30,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723159411] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:06:30,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271685198] [2022-01-31 11:06:30,803 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:06:30,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:06:30,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:06:30,814 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 11:06:30,817 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 11:06:30,944 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:06:30,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:06:30,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-31 11:06:30,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:06:31,014 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 11:06:31,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,092 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 23 treesize of output 22 [2022-01-31 11:06:31,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,153 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 23 treesize of output 22 [2022-01-31 11:06:31,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,219 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 23 treesize of output 22 [2022-01-31 11:06:31,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,272 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 23 treesize of output 22 [2022-01-31 11:06:31,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,321 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 23 treesize of output 22 [2022-01-31 11:06:31,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,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 14 treesize of output 16 [2022-01-31 11:06:31,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,404 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 11:06:31,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,425 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 11:06:31,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,447 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 11:06:31,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,470 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 11:06:31,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,492 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 11:06:31,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:06:31,575 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:06:31,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-01-31 11:06:31,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,657 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 23 treesize of output 22 [2022-01-31 11:06:31,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,708 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 23 treesize of output 22 [2022-01-31 11:06:31,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,754 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 23 treesize of output 22 [2022-01-31 11:06:31,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,797 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 23 treesize of output 22 [2022-01-31 11:06:31,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:06:31,860 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 23 treesize of output 22 [2022-01-31 11:06:31,899 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 11:06:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:06:31,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:06:34,057 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_456 Int)) (or (forall ((v_ArrVal_1471 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_456)))) is different from false [2022-01-31 11:06:48,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_457 Int)) (or (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_main_~i~0_456 Int)) (or (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_457)))) is different from false [2022-01-31 11:06:50,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1468 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_457)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)))) is different from false [2022-01-31 11:06:52,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_458 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_458)) (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1468 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))))) is different from false [2022-01-31 11:06:54,246 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_458)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)))) is different from false [2022-01-31 11:06:56,413 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_459 Int)) (or (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_459)))) is different from false [2022-01-31 11:06:58,508 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1464 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (= (select (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_459)))) is different from false [2022-01-31 11:07:00,798 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_460 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_460)) (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1464 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (= (select (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))))) is different from false [2022-01-31 11:07:02,916 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1464 Int) (v_main_~i~0_460 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_460)) (= 0 (select (store (store (store (store (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 11:07:05,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1464 Int) (v_main_~i~0_460 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1460 (Array Int Int)) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (= (select (store (store (store (store (store (let ((.cse0 (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 11:07:06,682 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1464 Int) (v_main_~i~0_460 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_ArrVal_1460 (Array Int Int)) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (= (select (store (store (store (store (store (let ((.cse0 (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 11:07:07,004 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (= (select (store (store (store (store (store (let ((.cse0 (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_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 11:07:07,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_470 Int)) (or (forall ((v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (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_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_470)))) is different from false [2022-01-31 11:07:07,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_470 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 11:07:07,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_471 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_471)) (forall ((v_main_~i~0_470 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))))) is different from false [2022-01-31 11:07:07,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= 1 v_main_~i~0_460)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_471)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 11:07:08,132 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_472 Int)) (or (forall ((v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_472)))) is different from false [2022-01-31 11:07:08,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_472 Int) (v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1448 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_472)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1448) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 11:07:08,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_473 Int)) (or (forall ((v_main_~i~0_472 Int) (v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1448 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_473)) v_ArrVal_1448) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)) (not (<= (+ v_main_~i~0_473 1) v_main_~i~0_472)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_473)))) is different from false [2022-01-31 11:07:08,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_472 Int) (v_main_~i~0_473 Int) (v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1445 Int) (v_ArrVal_1448 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_473)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)) (not (<= (+ v_main_~i~0_473 1) v_main_~i~0_472)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_473)) v_ArrVal_1448) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))) is different from false [2022-01-31 11:07:09,490 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_474 Int)) (or (forall ((v_main_~i~0_472 Int) (v_main_~i~0_473 Int) (v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1445 Int) (v_ArrVal_1448 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_474 1) v_main_~i~0_473)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_474)) v_ArrVal_1445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_473)) v_ArrVal_1448) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)) (not (<= (+ v_main_~i~0_473 1) v_main_~i~0_472)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_474)))) is different from false [2022-01-31 11:07:09,645 INFO L353 Elim1Store]: treesize reduction 785, result has 8.5 percent of original size [2022-01-31 11:07:09,646 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 6 case distinctions, treesize of input 151 treesize of output 130 [2022-01-31 11:07:09,658 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 120 treesize of output 114 [2022-01-31 11:07:09,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:09,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:09,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:09,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:09,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:09,669 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:07:09,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-01-31 11:07:09,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:09,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:09,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:09,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:09,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:09,677 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 9 [2022-01-31 11:07:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 94 not checked. [2022-01-31 11:07:09,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271685198] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:07:09,752 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:07:09,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 32] total 67 [2022-01-31 11:07:09,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323808745] [2022-01-31 11:07:09,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:07:09,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-01-31 11:07:09,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:07:09,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-01-31 11:07:09,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1794, Unknown=43, NotChecked=2268, Total=4422 [2022-01-31 11:07:09,754 INFO L87 Difference]: Start difference. First operand 237 states and 250 transitions. Second operand has 67 states, 66 states have (on average 2.015151515151515) internal successors, (133), 64 states have internal predecessors, (133), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:07:11,816 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_474 Int)) (or (forall ((v_main_~i~0_472 Int) (v_main_~i~0_473 Int) (v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1445 Int) (v_ArrVal_1448 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_474 1) v_main_~i~0_473)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_474)) v_ArrVal_1445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_473)) v_ArrVal_1448) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)) (not (<= (+ v_main_~i~0_473 1) v_main_~i~0_472)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_474)))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 1)) is different from false [2022-01-31 11:07:13,896 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (forall ((v_main_~i~0_473 Int)) (or (forall ((v_main_~i~0_472 Int) (v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1448 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_473)) v_ArrVal_1448) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)) (not (<= (+ v_main_~i~0_473 1) v_main_~i~0_472)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_473)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse1 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (= (select .cse1 0) 1))) is different from false [2022-01-31 11:07:15,958 WARN L838 $PredicateComparison]: unable to prove that (and (<= 2 c_main_~i~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_472 Int)) (or (forall ((v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_472))))) is different from false [2022-01-31 11:07:18,001 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_471 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_471)) (forall ((v_main_~i~0_470 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))))) (<= 3 c_main_~i~0)) is different from false [2022-01-31 11:07:20,048 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_470 Int)) (or (forall ((v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (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_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_470)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (<= 4 c_main_~i~0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0)) is different from false [2022-01-31 11:07:22,313 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 0) (= c_main_~i~0 0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_460 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_460)) (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1464 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (= (select (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459))))))) is different from false [2022-01-31 11:07:24,385 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (= (select (select |c_#memory_int| c_main_~a~0.base) 0) 0) (forall ((v_main_~i~0_459 Int)) (or (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_459)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_456 Int)) (or (forall ((v_ArrVal_1471 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_456))))) is different from false [2022-01-31 11:07:26,453 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) 0) 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_458 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_458)) (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1468 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))))) (forall ((v_main_~i~0_456 Int)) (or (forall ((v_ArrVal_1471 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_456)))) (<= (+ 2 (div (* (- 1) c_main_~a~0.offset) 4)) c_main_~i~0)) is different from false [2022-01-31 11:07:28,495 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) 0) 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= (+ 3 (div (* (- 1) c_main_~a~0.offset) 4)) c_main_~i~0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_457 Int)) (or (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_main_~i~0_456 Int)) (or (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_457)))) (forall ((v_main_~i~0_456 Int)) (or (forall ((v_ArrVal_1471 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_456))))) is different from false [2022-01-31 11:07:30,622 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) 0) 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= (+ 4 (div (* (- 1) c_main_~a~0.offset) 4)) c_main_~i~0) (forall ((v_main_~i~0_456 Int)) (or (forall ((v_ArrVal_1471 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_456))))) is different from false [2022-01-31 11:07:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:07:30,916 INFO L93 Difference]: Finished difference Result 259 states and 275 transitions. [2022-01-31 11:07:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 11:07:30,917 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.015151515151515) internal successors, (133), 64 states have internal predecessors, (133), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2022-01-31 11:07:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:07:30,918 INFO L225 Difference]: With dead ends: 259 [2022-01-31 11:07:30,918 INFO L226 Difference]: Without dead ends: 259 [2022-01-31 11:07:30,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 104 SyntacticMatches, 18 SemanticMatches, 81 ConstructedPredicates, 31 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=390, Invalid=2333, Unknown=53, NotChecked=4030, Total=6806 [2022-01-31 11:07:30,919 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1789 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:07:30,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 518 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1372 Invalid, 0 Unknown, 1789 Unchecked, 0.6s Time] [2022-01-31 11:07:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-01-31 11:07:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 231. [2022-01-31 11:07:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 202 states have (on average 1.0544554455445545) internal successors, (213), 204 states have internal predecessors, (213), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-31 11:07:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 242 transitions. [2022-01-31 11:07:30,926 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 242 transitions. Word has length 66 [2022-01-31 11:07:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:07:30,926 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 242 transitions. [2022-01-31 11:07:30,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.015151515151515) internal successors, (133), 64 states have internal predecessors, (133), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:07:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 242 transitions. [2022-01-31 11:07:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 11:07:30,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:07:30,927 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1] [2022-01-31 11:07:30,955 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 11:07:31,151 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 11:07:31,152 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:07:31,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:07:31,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1205272096, now seen corresponding path program 12 times [2022-01-31 11:07:31,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:07:31,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340120205] [2022-01-31 11:07:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:07:31,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:07:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:07:33,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:07:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:07:33,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:07:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:07:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 72 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-31 11:07:33,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:07:33,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340120205] [2022-01-31 11:07:33,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340120205] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:07:33,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542508257] [2022-01-31 11:07:33,061 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:07:33,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:07:33,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:07:33,062 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 11:07:33,063 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 11:07:33,439 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-01-31 11:07:33,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:07:33,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 107 conjunts are in the unsatisfiable core [2022-01-31 11:07:33,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:07:33,490 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 11:07:33,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,549 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 23 treesize of output 22 [2022-01-31 11:07:33,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:07:33,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-01-31 11:07:33,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:33,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2022-01-31 11:07:34,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-01-31 11:07:34,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,265 INFO L353 Elim1Store]: treesize reduction 144, result has 23.4 percent of original size [2022-01-31 11:07:34,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 80 [2022-01-31 11:07:34,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:34,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,695 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-01-31 11:07:34,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 89 [2022-01-31 11:07:34,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:34,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:34,922 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-01-31 11:07:34,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 87 [2022-01-31 11:07:35,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:35,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,176 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-01-31 11:07:35,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 94 [2022-01-31 11:07:35,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:35,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,456 INFO L353 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-01-31 11:07:35,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 97 [2022-01-31 11:07:35,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:35,710 INFO L353 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2022-01-31 11:07:35,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 98 [2022-01-31 11:07:35,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:35,985 INFO L353 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-01-31 11:07:35,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 95 treesize of output 98 [2022-01-31 11:07:36,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:36,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:07:36,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,648 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-01-31 11:07:36,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 89 [2022-01-31 11:07:36,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:36,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:37,012 INFO L353 Elim1Store]: treesize reduction 94, result has 42.7 percent of original size [2022-01-31 11:07:37,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 106 [2022-01-31 11:07:37,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:37,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:37,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:07:37,602 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:07:37,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 87 [2022-01-31 11:07:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 22 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:07:38,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:10:32,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_498 Int) (v_main_~i~0_501 Int)) (or (let ((.cse0 (<= v_main_~i~0_501 (+ 3 v_main_~i~0_498))) (.cse12 (<= (+ v_main_~i~0_501 1) c_main_~i~0))) (and (or .cse0 (forall ((v_main_~i~0_509 Int) (v_ArrVal_1586 Int) (v_ArrVal_1588 Int)) (or (<= (+ v_main_~i~0_509 1) (select (select (let ((.cse1 (let ((.cse10 (store (let ((.cse11 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse11 c_main_~a~0.offset) 1) (+ .cse11 c_main_~a~0.offset 4) 1)) (+ (* 4 v_main_~i~0_509) c_main_~a~0.offset) 1))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse10))) (store .cse2 |c_main_~#sum~0.base| (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (store .cse3 |c_main_~#sum~0.offset| (let ((.cse4 (select .cse10 c_main_~a~0.offset)) (.cse9 (select .cse3 |c_main_~#sum~0.offset|))) (let ((.cse7 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse9))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (let ((.cse8 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse7 .cse9))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse5 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse7 .cse8 .cse9))) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))) (let ((.cse6 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse7 .cse8 .cse9))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (+ .cse4 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_501))) .cse5 .cse6 .cse7 .cse8 .cse9))))))))))))) (store .cse1 c_main_~a~0.base (store (store (select .cse1 c_main_~a~0.base) c_main_~a~0.offset v_ArrVal_1586) (+ (* 4 v_main_~i~0_498) c_main_~a~0.offset) v_ArrVal_1588))) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (<= v_main_~i~0_509 (+ 3 v_main_~i~0_498)) (<= (+ v_main_~i~0_501 1) v_main_~i~0_509))) .cse12) (or (forall ((v_main_~i~0_509 Int) (v_ArrVal_1586 Int) (v_ArrVal_1588 Int)) (or (<= (select (select (let ((.cse13 (let ((.cse22 (store (let ((.cse23 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse23 c_main_~a~0.offset) 1) (+ .cse23 c_main_~a~0.offset 4) 1)) (+ (* 4 v_main_~i~0_509) c_main_~a~0.offset) 1))) (let ((.cse14 (store |c_#memory_int| c_main_~a~0.base .cse22))) (store .cse14 |c_main_~#sum~0.base| (let ((.cse15 (select .cse14 |c_main_~#sum~0.base|))) (store .cse15 |c_main_~#sum~0.offset| (let ((.cse16 (select .cse22 c_main_~a~0.offset)) (.cse21 (select .cse15 |c_main_~#sum~0.offset|))) (let ((.cse19 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse16 .cse21))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (let ((.cse20 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse16 .cse19 .cse21))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse17 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse16 .cse19 .cse20 .cse21))) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))) (let ((.cse18 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse19 .cse20 .cse21))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (+ .cse16 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_501))) .cse17 .cse18 .cse19 .cse20 .cse21))))))))))))) (store .cse13 c_main_~a~0.base (store (store (select .cse13 c_main_~a~0.base) c_main_~a~0.offset v_ArrVal_1586) (+ (* 4 v_main_~i~0_498) c_main_~a~0.offset) v_ArrVal_1588))) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (+ 5 v_main_~i~0_498)) (<= v_main_~i~0_509 (+ 3 v_main_~i~0_498)) (<= (+ v_main_~i~0_501 1) v_main_~i~0_509))) .cse0 .cse12))) (< 5 v_main_~i~0_501) (< v_main_~i~0_498 1))) is different from false