/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/sina3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:49:44,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:49:44,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:49:44,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:49:44,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:49:44,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:49:44,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:49:44,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:49:44,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:49:44,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:49:44,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:49:44,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:49:44,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:49:44,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:49:44,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:49:44,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:49:44,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:49:44,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:49:44,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:49:44,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:49:44,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:49:44,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:49:44,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:49:44,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:49:44,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:49:44,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:49:44,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:49:44,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:49:44,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:49:44,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:49:44,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:49:44,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:49:44,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:49:44,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:49:44,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:49:44,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:49:44,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:49:44,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:49:44,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:49:44,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:49:44,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:49:44,947 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:49:44,953 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:49:44,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:49:44,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:49:44,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:49:44,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:49:44,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:49:44,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:49:44,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:49:44,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:49:44,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:49:44,955 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:49:44,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:49:44,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:49:44,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:49:44,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:49:44,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:49:44,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:49:44,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:49:44,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:49:44,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:49:44,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:49:44,957 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:49:44,957 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:49:45,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:49:45,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:49:45,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:49:45,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:49:45,109 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:49:45,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina3.c [2022-01-31 11:49:45,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8875567bd/df5da2dfb32b4ab0a0cd6d33aac1e7ad/FLAG00405b3e7 [2022-01-31 11:49:45,549 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:49:45,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina3.c [2022-01-31 11:49:45,563 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8875567bd/df5da2dfb32b4ab0a0cd6d33aac1e7ad/FLAG00405b3e7 [2022-01-31 11:49:45,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8875567bd/df5da2dfb32b4ab0a0cd6d33aac1e7ad [2022-01-31 11:49:45,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:49:45,973 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:49:45,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:49:45,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:49:45,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:49:45,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:49:45" (1/1) ... [2022-01-31 11:49:45,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39789b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:45, skipping insertion in model container [2022-01-31 11:49:45,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:49:45" (1/1) ... [2022-01-31 11:49:45,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:49:46,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:49:46,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina3.c[588,601] [2022-01-31 11:49:46,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:49:46,131 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:49:46,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina3.c[588,601] [2022-01-31 11:49:46,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:49:46,156 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:49:46,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:46 WrapperNode [2022-01-31 11:49:46,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:49:46,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:49:46,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:49:46,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:49:46,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:46" (1/1) ... [2022-01-31 11:49:46,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:46" (1/1) ... [2022-01-31 11:49:46,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:46" (1/1) ... [2022-01-31 11:49:46,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:46" (1/1) ... [2022-01-31 11:49:46,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:46" (1/1) ... [2022-01-31 11:49:46,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:46" (1/1) ... [2022-01-31 11:49:46,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:46" (1/1) ... [2022-01-31 11:49:46,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:49:46,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:49:46,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:49:46,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:49:46,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:46" (1/1) ... [2022-01-31 11:49:46,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:49:46,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:46,220 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:49:46,230 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:49:46,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:49:46,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:49:46,249 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:49:46,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:49:46,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:49:46,249 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:49:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:49:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:49:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:49:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:49:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:49:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:49:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:49:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:49:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:49:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:49:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:49:46,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:49:46,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:49:46,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:49:46,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:49:46,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:49:46,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:49:46,301 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:49:46,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:49:46,426 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:49:46,430 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:49:46,430 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-31 11:49:46,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:49:46 BoogieIcfgContainer [2022-01-31 11:49:46,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:49:46,432 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:49:46,432 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:49:46,444 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:49:46,447 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:49:46" (1/1) ... [2022-01-31 11:49:46,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:49:46 BasicIcfg [2022-01-31 11:49:46,478 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:49:46,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:49:46,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:49:46,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:49:46,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:49:45" (1/4) ... [2022-01-31 11:49:46,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e8fb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:49:46, skipping insertion in model container [2022-01-31 11:49:46,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:46" (2/4) ... [2022-01-31 11:49:46,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e8fb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:49:46, skipping insertion in model container [2022-01-31 11:49:46,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:49:46" (3/4) ... [2022-01-31 11:49:46,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e8fb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:49:46, skipping insertion in model container [2022-01-31 11:49:46,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:49:46" (4/4) ... [2022-01-31 11:49:46,486 INFO L111 eAbstractionObserver]: Analyzing ICFG sina3.cJordan [2022-01-31 11:49:46,489 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:49:46,490 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:49:46,537 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:49:46,543 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:49:46,543 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:49:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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:49:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 11:49:46,559 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:46,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:46,560 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:46,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1091141799, now seen corresponding path program 1 times [2022-01-31 11:49:46,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:46,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858002931] [2022-01-31 11:49:46,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:46,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:46,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:46,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:46,794 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:49:46,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:46,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858002931] [2022-01-31 11:49:46,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858002931] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:49:46,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:49:46,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:49:46,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796622140] [2022-01-31 11:49:46,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:49:46,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:49:46,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:46,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:49:46,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:49:46,828 INFO L87 Difference]: Start difference. First operand has 40 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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:49:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:46,896 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-01-31 11:49:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:49:46,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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 26 [2022-01-31 11:49:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:46,905 INFO L225 Difference]: With dead ends: 40 [2022-01-31 11:49:46,905 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 11:49:46,907 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:49:46,912 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:46,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:49:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 11:49:46,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-01-31 11:49:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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:49:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-01-31 11:49:46,943 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-01-31 11:49:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:46,944 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-01-31 11:49:46,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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:49:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-01-31 11:49:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 11:49:46,945 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:46,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:46,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:49:46,946 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:46,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:46,947 INFO L85 PathProgramCache]: Analyzing trace with hash -565853652, now seen corresponding path program 1 times [2022-01-31 11:49:46,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:46,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359912705] [2022-01-31 11:49:46,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:46,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:47,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:47,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:47,023 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:49:47,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:47,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359912705] [2022-01-31 11:49:47,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359912705] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:49:47,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:49:47,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:49:47,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785245475] [2022-01-31 11:49:47,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:49:47,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:49:47,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:49:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:49:47,026 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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:49:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:47,138 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-01-31 11:49:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:49:47,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 26 [2022-01-31 11:49:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:47,141 INFO L225 Difference]: With dead ends: 47 [2022-01-31 11:49:47,141 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 11:49:47,141 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:49:47,142 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:47,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 33 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:49:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 11:49:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2022-01-31 11:49:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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:49:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-01-31 11:49:47,152 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2022-01-31 11:49:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:47,152 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-01-31 11:49:47,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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:49:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-01-31 11:49:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 11:49:47,153 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:47,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:47,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:49:47,154 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash -952007550, now seen corresponding path program 1 times [2022-01-31 11:49:47,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:47,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836766533] [2022-01-31 11:49:47,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:47,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:47,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:47,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:47,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:47,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836766533] [2022-01-31 11:49:47,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836766533] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:47,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165287825] [2022-01-31 11:49:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:47,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:47,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:47,967 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:49:47,983 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:49:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:48,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-31 11:49:48,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:48,163 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:49:48,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:48,184 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 11:49:48,185 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 28 treesize of output 24 [2022-01-31 11:49:48,286 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:49:48,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:48,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-01-31 11:49:48,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:48,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-01-31 11:49:48,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:48,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 11:49:49,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:49,107 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-31 11:49:49,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2022-01-31 11:49:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:49,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:49,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:49,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:49,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:49,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165287825] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:49,654 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:49,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 43 [2022-01-31 11:49:49,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565637177] [2022-01-31 11:49:49,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:49,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-31 11:49:49,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:49,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-31 11:49:49,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1570, Unknown=0, NotChecked=0, Total=1806 [2022-01-31 11:49:49,659 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 43 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 40 states have internal predecessors, (70), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:49:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:50,264 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-01-31 11:49:50,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 11:49:50,265 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 40 states have internal predecessors, (70), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-01-31 11:49:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:50,266 INFO L225 Difference]: With dead ends: 68 [2022-01-31 11:49:50,266 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 11:49:50,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=331, Invalid=2219, Unknown=0, NotChecked=0, Total=2550 [2022-01-31 11:49:50,268 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 57 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:50,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 187 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 599 Invalid, 0 Unknown, 53 Unchecked, 0.4s Time] [2022-01-31 11:49:50,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 11:49:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2022-01-31 11:49:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 51 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:49:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2022-01-31 11:49:50,276 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 34 [2022-01-31 11:49:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:50,277 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2022-01-31 11:49:50,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 40 states have internal predecessors, (70), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:49:50,277 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-01-31 11:49:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 11:49:50,278 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:50,278 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, 1, 1, 1] [2022-01-31 11:49:50,297 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:49:50,478 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:49:50,479 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1786778562, now seen corresponding path program 2 times [2022-01-31 11:49:50,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:50,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484028964] [2022-01-31 11:49:50,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:50,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:50,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:50,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:49:50,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:50,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484028964] [2022-01-31 11:49:50,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484028964] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:50,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180015872] [2022-01-31 11:49:50,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:49:50,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:50,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:50,548 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:49:50,549 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:49:50,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:49:50,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:50,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:49:50,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:49:50,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:49:50,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180015872] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:50,715 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:50,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:49:50,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35449295] [2022-01-31 11:49:50,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:50,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:49:50,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:49:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:49:50,718 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 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:49:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:50,936 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2022-01-31 11:49:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:49:50,936 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 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 36 [2022-01-31 11:49:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:50,937 INFO L225 Difference]: With dead ends: 86 [2022-01-31 11:49:50,937 INFO L226 Difference]: Without dead ends: 86 [2022-01-31 11:49:50,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 11:49:50,938 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 68 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:50,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 82 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:49:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-31 11:49:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2022-01-31 11:49:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 57 states have internal predecessors, (65), 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:49:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2022-01-31 11:49:50,943 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 36 [2022-01-31 11:49:50,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:50,943 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2022-01-31 11:49:50,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 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:49:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-01-31 11:49:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 11:49:50,944 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:50,944 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, 1, 1, 1] [2022-01-31 11:49:50,962 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:49:51,151 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:49:51,152 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1321507392, now seen corresponding path program 3 times [2022-01-31 11:49:51,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:51,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200343214] [2022-01-31 11:49:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:51,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:51,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:51,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:49:51,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:51,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200343214] [2022-01-31 11:49:51,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200343214] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:51,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421150131] [2022-01-31 11:49:51,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:49:51,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:51,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:51,226 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:49:51,227 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:49:51,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:49:51,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:51,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:49:51,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:49:51,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:49:51,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421150131] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:51,411 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:51,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:49:51,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213656196] [2022-01-31 11:49:51,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:51,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:49:51,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:51,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:49:51,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:49:51,412 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 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:49:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:51,591 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-01-31 11:49:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:49:51,607 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 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 36 [2022-01-31 11:49:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:51,611 INFO L225 Difference]: With dead ends: 81 [2022-01-31 11:49:51,611 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 11:49:51,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:49:51,614 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 54 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:51,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 64 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:49:51,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 11:49:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2022-01-31 11:49:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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:49:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-01-31 11:49:51,622 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 36 [2022-01-31 11:49:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:51,622 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-01-31 11:49:51,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 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:49:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-01-31 11:49:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 11:49:51,623 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:51,623 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:51,641 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:49:51,827 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:49:51,828 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:51,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1683451304, now seen corresponding path program 4 times [2022-01-31 11:49:51,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:51,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068347932] [2022-01-31 11:49:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:51,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:52,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:52,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068347932] [2022-01-31 11:49:52,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068347932] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:52,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987179163] [2022-01-31 11:49:52,958 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:49:52,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:52,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:52,960 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:49:52,979 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:49:53,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:49:53,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:53,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 65 conjunts are in the unsatisfiable core [2022-01-31 11:49:53,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:53,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-01-31 11:49:53,065 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:49:53,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,125 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:49:53,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-01-31 11:49:53,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,519 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:49:53,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-01-31 11:49:53,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:53,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:53,918 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:49:54,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:54,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:54,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:54,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2022-01-31 11:49:54,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:54,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:54,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:54,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:54,326 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 69 treesize of output 56 [2022-01-31 11:49:54,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:54,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:54,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:54,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:54,543 INFO L353 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2022-01-31 11:49:54,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 66 [2022-01-31 11:49:54,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:54,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:54,775 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-31 11:49:54,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-01-31 11:49:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:54,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:57,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_67 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_67)) (forall ((v_ArrVal_230 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_230) c_main_~a~0.offset) (+ c_~N~0 1))))) is different from false [2022-01-31 11:50:09,734 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_73 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_73)) (forall ((v_ArrVal_222 Int) (v_ArrVal_230 Int) (v_main_~i~0_67 Int)) (or (= (select (store (let ((.cse4 (store |c_#memory_int| c_main_~b~0.base (store (select |c_#memory_int| c_main_~b~0.base) (+ (* v_main_~i~0_73 4) c_main_~b~0.offset) v_ArrVal_222)))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse2 (select (select .cse4 c_main_~a~0.base) c_main_~a~0.offset)) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse0 (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse1 .cse2 .cse3))))))) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_230) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= 1 v_main_~i~0_67)))))) is different from false [2022-01-31 11:50:11,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 Int) (v_ArrVal_230 Int) (v_main_~i~0_67 Int) (v_main_~i~0_73 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_73)) (= (select (store (let ((.cse4 (store |c_#memory_int| c_main_~b~0.base (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset) 1) (+ (* v_main_~i~0_73 4) c_main_~b~0.offset) v_ArrVal_222)))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse2 (select (select .cse4 c_main_~a~0.base) c_main_~a~0.offset)) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse0 (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ .cse1 (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse2 .cse3))))))) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_230) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= 1 v_main_~i~0_67)))) is different from false [2022-01-31 11:50:12,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 Int) (v_ArrVal_230 Int) (v_main_~i~0_67 Int) (v_main_~i~0_73 Int)) (or (not (<= 1 v_main_~i~0_73)) (= (select (store (let ((.cse4 (store |c_#memory_int| c_main_~b~0.base (store (store (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset 1) (+ (* v_main_~i~0_73 4) c_main_~b~0.offset) v_ArrVal_222)))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse5 |c_main_~#sum~0.offset|)) (.cse3 (select (select .cse4 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse0 (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse1 .cse2 .cse3))))))) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_230) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= 1 v_main_~i~0_67)))) is different from false [2022-01-31 11:51:09,322 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_67 Int) (v_main_~i~0_73 Int)) (or (not (<= 1 v_main_~i~0_73)) (and (forall ((v_ArrVal_222 Int) (v_ArrVal_230 Int)) (<= (+ c_main_~i~0 3) (select (store (let ((.cse4 (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base (let ((.cse7 (* c_main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse7) 1) (+ c_main_~a~0.offset .cse7 8) 1))))) (store .cse6 c_main_~b~0.base (store (store (select .cse6 c_main_~b~0.base) c_main_~b~0.offset 1) (+ (* v_main_~i~0_73 4) c_main_~b~0.offset) v_ArrVal_222))))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse5 |c_main_~#sum~0.offset|)) (.cse3 (select (select .cse4 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse0 (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ .cse1 .cse2 (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse3))))))) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_230) c_main_~a~0.offset))) (forall ((v_ArrVal_222 Int) (v_ArrVal_230 Int)) (<= (select (store (let ((.cse12 (let ((.cse14 (store |c_#memory_int| c_main_~a~0.base (let ((.cse15 (* c_main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse15) 1) (+ c_main_~a~0.offset .cse15 8) 1))))) (store .cse14 c_main_~b~0.base (store (store (select .cse14 c_main_~b~0.base) c_main_~b~0.offset 1) (+ (* v_main_~i~0_73 4) c_main_~b~0.offset) v_ArrVal_222))))) (let ((.cse13 (select .cse12 |c_main_~#sum~0.base|))) (let ((.cse10 (select .cse13 |c_main_~#sum~0.offset|)) (.cse11 (select (select .cse12 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse9 (select (select (store .cse12 |c_main_~#sum~0.base| (store .cse13 |c_main_~#sum~0.offset| (+ .cse10 .cse11))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse8 (store .cse12 |c_main_~#sum~0.base| (store .cse13 |c_main_~#sum~0.offset| (+ .cse9 .cse10 .cse11))))) (store (select .cse8 c_main_~a~0.base) c_main_~a~0.offset (+ .cse9 .cse10 (select (select .cse8 c_main_~b~0.base) c_main_~b~0.offset) .cse11))))))) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_230) c_main_~a~0.offset) (+ c_main_~i~0 3)))) (not (<= 1 v_main_~i~0_67)))) is different from false [2022-01-31 11:51:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-01-31 11:51:09,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987179163] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:51:09,362 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:51:09,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 24] total 67 [2022-01-31 11:51:09,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966814687] [2022-01-31 11:51:09,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:51:09,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-01-31 11:51:09,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:51:09,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-01-31 11:51:09,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=3422, Unknown=38, NotChecked=620, Total=4422 [2022-01-31 11:51:09,364 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 67 states, 65 states have (on average 1.4) internal successors, (91), 64 states have internal predecessors, (91), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:51:12,384 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_main_~a~0.base))) (and (<= c_~N~0 2) (forall ((v_main_~i~0_73 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_73)) (forall ((v_ArrVal_222 Int) (v_ArrVal_230 Int) (v_main_~i~0_67 Int)) (or (= (select (store (let ((.cse4 (store |c_#memory_int| c_main_~b~0.base (store (select |c_#memory_int| c_main_~b~0.base) (+ (* v_main_~i~0_73 4) c_main_~b~0.offset) v_ArrVal_222)))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse2 (select (select .cse4 c_main_~a~0.base) c_main_~a~0.offset)) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse0 (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse1 .cse2 .cse3))))))) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_230) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= 1 v_main_~i~0_67)))))) (= 1 (select (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset))) (= c_main_~i~0 0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (select .cse6 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (< 1 c_~N~0) (= c_main_~b~0.offset 0) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) (< (+ c_main_~b~0.base 1) |c_main_~#sum~0.base|) (= (select .cse6 (+ c_main_~a~0.offset 8)) 1) (not (= c_main_~b~0.base c_main_~a~0.base)))) is different from false [2022-01-31 11:51:14,695 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset))) (.cse3 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (and (forall ((v_main_~i~0_67 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_67)) (forall ((v_ArrVal_230 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_230) c_main_~a~0.offset) (+ c_~N~0 1))))) (exists ((|main_~#sum~0.offset| Int) (main_~b~0.base Int) (|main_~#sum~0.base| Int)) (let ((.cse1 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse0 (+ (- 1) .cse1))) (and (= .cse0 1) (= (+ .cse1 1) (select .cse2 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (= (select .cse2 (+ c_main_~a~0.offset 8)) .cse0) (< (+ main_~b~0.base 1) |main_~#sum~0.base|) (= (select (select |c_#memory_int| main_~b~0.base) (* c_main_~i~0 4)) 1) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|))))) (<= c_~N~0 2) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (= .cse3 0) (= 1 .cse4) (= c_main_~i~0 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (< 1 c_~N~0) (= 3 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) .cse4)) (= (select (select |c_#memory_int| c_main_~a~0.base) .cse3) (+ c_~N~0 1)) (= c_main_~b~0.offset 0))) is different from false [2022-01-31 11:51:16,760 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_67 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_67)) (forall ((v_ArrVal_230 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_230) c_main_~a~0.offset) (+ c_~N~0 1))))) (exists ((|main_~#sum~0.offset| Int) (main_~b~0.base Int) (|main_~#sum~0.base| Int)) (and (= (select (select |c_#memory_int| main_~b~0.base) 0) 1) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (< (+ main_~b~0.base 1) |main_~#sum~0.base|) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|))) (<= c_~N~0 2) (= c_main_~a~0.offset 0) (< 1 c_~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 3)) is different from false [2022-01-31 11:51:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:51:17,056 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2022-01-31 11:51:17,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 11:51:17,057 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 1.4) internal successors, (91), 64 states have internal predecessors, (91), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-01-31 11:51:17,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:51:17,057 INFO L225 Difference]: With dead ends: 84 [2022-01-31 11:51:17,057 INFO L226 Difference]: Without dead ends: 84 [2022-01-31 11:51:17,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 82.0s TimeCoverageRelationStatistics Valid=446, Invalid=4657, Unknown=41, NotChecked=1176, Total=6320 [2022-01-31 11:51:17,060 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 34 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 737 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:51:17,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 318 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 639 Invalid, 0 Unknown, 737 Unchecked, 0.4s Time] [2022-01-31 11:51:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-31 11:51:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2022-01-31 11:51:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 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:51:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-01-31 11:51:17,064 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 42 [2022-01-31 11:51:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:51:17,065 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-01-31 11:51:17,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 1.4) internal successors, (91), 64 states have internal predecessors, (91), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:51:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-01-31 11:51:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:51:17,066 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:51:17,066 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:51:17,084 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:51:17,282 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:51:17,283 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:51:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:51:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1227784684, now seen corresponding path program 5 times [2022-01-31 11:51:17,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:51:17,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121198095] [2022-01-31 11:51:17,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:51:17,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:51:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:51:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:17,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:51:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:51:17,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:51:17,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121198095] [2022-01-31 11:51:17,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121198095] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:51:17,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522225411] [2022-01-31 11:51:17,354 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:51:17,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:51:17,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:51:17,356 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:51:17,356 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:51:17,455 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:51:17,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:51:17,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:51:17,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:51:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:51:17,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:51:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:51:17,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522225411] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:51:17,607 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:51:17,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:51:17,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354618307] [2022-01-31 11:51:17,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:51:17,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:51:17,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:51:17,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:51:17,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:51:17,608 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 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:51:17,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:51:17,903 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2022-01-31 11:51:17,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:51:17,903 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-01-31 11:51:17,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:51:17,905 INFO L225 Difference]: With dead ends: 125 [2022-01-31 11:51:17,905 INFO L226 Difference]: Without dead ends: 125 [2022-01-31 11:51:17,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 85 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:51:17,906 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 75 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:51:17,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 109 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:51:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-01-31 11:51:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 82. [2022-01-31 11:51:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 73 states have internal predecessors, (82), 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:51:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2022-01-31 11:51:17,911 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 44 [2022-01-31 11:51:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:51:17,911 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2022-01-31 11:51:17,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 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:51:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2022-01-31 11:51:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 11:51:17,912 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:51:17,912 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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:51:17,931 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:51:18,129 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:51:18,129 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:51:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:51:18,130 INFO L85 PathProgramCache]: Analyzing trace with hash 270672468, now seen corresponding path program 6 times [2022-01-31 11:51:18,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:51:18,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866745802] [2022-01-31 11:51:18,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:51:18,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:51:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:18,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:51:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:18,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:51:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:51:18,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:51:18,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866745802] [2022-01-31 11:51:18,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866745802] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:51:18,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011462384] [2022-01-31 11:51:18,208 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:51:18,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:51:18,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:51:18,209 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:51:18,237 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:51:18,280 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 11:51:18,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:51:18,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:51:18,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:51:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-31 11:51:18,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:51:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-31 11:51:18,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011462384] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:51:18,456 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:51:18,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2022-01-31 11:51:18,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255432730] [2022-01-31 11:51:18,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:51:18,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 11:51:18,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:51:18,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 11:51:18,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-01-31 11:51:18,457 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 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:51:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:51:18,650 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-01-31 11:51:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:51:18,650 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 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 46 [2022-01-31 11:51:18,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:51:18,651 INFO L225 Difference]: With dead ends: 109 [2022-01-31 11:51:18,651 INFO L226 Difference]: Without dead ends: 104 [2022-01-31 11:51:18,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-01-31 11:51:18,652 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:51:18,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 88 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:51:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-01-31 11:51:18,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2022-01-31 11:51:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.08) internal successors, (81), 75 states have internal predecessors, (81), 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:51:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-01-31 11:51:18,656 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 46 [2022-01-31 11:51:18,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:51:18,657 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-01-31 11:51:18,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 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:51:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-01-31 11:51:18,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:51:18,657 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:51:18,657 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:51:18,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 11:51:18,867 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:51:18,869 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:51:18,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:51:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1757175437, now seen corresponding path program 1 times [2022-01-31 11:51:18,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:51:18,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813606496] [2022-01-31 11:51:18,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:51:18,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:51:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:20,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:51:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:51:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 11:51:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:51:20,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:51:20,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813606496] [2022-01-31 11:51:20,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813606496] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:51:20,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727461597] [2022-01-31 11:51:20,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:51:20,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:51:20,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:51:20,103 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:51:20,104 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:51:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:20,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-31 11:51:20,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:51:20,186 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 11:51:20,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-01-31 11:51:20,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:51:20,218 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:51:20,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:20,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-01-31 11:51:20,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-01-31 11:51:20,514 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 35 treesize of output 40 [2022-01-31 11:51:20,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:20,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2022-01-31 11:51:20,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:20,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:51:20,727 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 56 treesize of output 49 [2022-01-31 11:51:20,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-01-31 11:51:20,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:20,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 7 [2022-01-31 11:51:20,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2022-01-31 11:51:22,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:51:22,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 22 [2022-01-31 11:51:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:51:22,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:51:22,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 (Array Int Int))) (= (select (store v_ArrVal_422 (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse0 c_main_~b~0.base) (+ (* c_main_~i~0 4) 4 c_main_~b~0.offset))))) (+ c_main_~a~0.offset 8)) (+ c_~N~0 1))) is different from false [2022-01-31 11:51:22,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse0 c_main_~b~0.base) (+ 4 c_main_~b~0.offset)) (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (+ c_~N~0 1))) is different from false [2022-01-31 11:51:22,662 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 (Array Int Int))) (= (+ c_~N~0 1) (let ((.cse0 (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse1 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse1 |c_main_~#sum~0.offset| (+ (select .cse1 |c_main_~#sum~0.offset|) (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8))))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse0 c_main_~b~0.base) (+ 4 c_main_~b~0.offset)))))) is different from false [2022-01-31 11:51:22,738 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse1 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse1 |c_main_~#sum~0.offset| (let ((.cse4 (* c_main_~i~0 8))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|)) (.cse3 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse4)))) (+ .cse2 .cse3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse4 8)))))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse0 c_main_~b~0.base) (+ 4 c_main_~b~0.offset)))) (+ c_~N~0 1))) is different from false [2022-01-31 11:51:22,745 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse1 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse1 |c_main_~#sum~0.offset| (let ((.cse2 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (.cse3 (select .cse1 |c_main_~#sum~0.offset|))) (+ .cse2 .cse3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse0 c_main_~b~0.base) (+ 4 c_main_~b~0.offset)))) (+ c_~N~0 1))) is different from false [2022-01-31 11:51:22,762 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0.offset Int) (v_ArrVal_422 (Array Int Int))) (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| c_main_~b~0.base (store (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) main_~b~0.offset) 1)))) (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 (select .cse1 c_main_~a~0.base) c_main_~a~0.offset))) (+ .cse3 .cse4 (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 8)))))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse0 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (+ c_~N~0 1))) is different from false [2022-01-31 11:51:22,770 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0.offset Int) (v_ArrVal_422 (Array Int Int))) (= (+ c_~N~0 1) (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| c_main_~b~0.base (store (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) main_~b~0.offset 4) 1)))) (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 (select .cse1 c_main_~a~0.base) c_main_~a~0.offset)) (.cse4 (select .cse2 |c_main_~#sum~0.offset|))) (+ .cse3 .cse4 (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 8)))))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse0 c_main_~b~0.base) (+ main_~b~0.offset 4)))))) is different from false [2022-01-31 11:51:22,777 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:51:22,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 285 treesize of output 169 [2022-01-31 11:51:22,789 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0.offset Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 (+ (* c_main_~i~0 4) main_~b~0.offset 4)) 1)) (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| c_main_~b~0.base v_arrayElimArr_1))) (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 (select .cse1 c_main_~a~0.base) c_main_~a~0.offset)) (.cse4 (select .cse2 |c_main_~#sum~0.offset|))) (+ .cse3 .cse4 (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 8)))))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse0 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (+ c_~N~0 1)))) is different from false [2022-01-31 11:51:22,805 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0.offset Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (let ((.cse1 (+ main_~b~0.offset 4))) (or (= (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| c_main_~b~0.base v_arrayElimArr_1))) (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 (select .cse2 c_main_~a~0.base) c_main_~a~0.offset)) (.cse5 (select .cse3 |c_main_~#sum~0.offset|))) (+ .cse4 .cse5 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse0 c_main_~b~0.base) .cse1) (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (+ c_~N~0 1)) (not (= (select v_arrayElimArr_1 .cse1) 1))))) is different from false [2022-01-31 11:51:23,001 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0.offset Int) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((v_ArrVal_422 (Array Int Int))) (<= (let ((.cse0 (store (let ((.cse1 (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 (* c_main_~i~0 8)) 1)) c_main_~b~0.base v_arrayElimArr_1))) (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 (select .cse1 c_main_~a~0.base) c_main_~a~0.offset))) (+ (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 8)) .cse3 .cse4)))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse0 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (+ c_main_~i~0 2))) (forall ((v_ArrVal_422 (Array Int Int))) (<= (+ c_main_~i~0 2) (let ((.cse5 (store (let ((.cse6 (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 (* c_main_~i~0 8)) 1)) c_main_~b~0.base v_arrayElimArr_1))) (store .cse6 |c_main_~#sum~0.base| (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (store .cse7 |c_main_~#sum~0.offset| (let ((.cse8 (select .cse7 |c_main_~#sum~0.offset|)) (.cse9 (select (select .cse6 c_main_~a~0.base) c_main_~a~0.offset))) (+ (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse8 .cse9))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse8 .cse9)))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse5 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse5 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (not (= (select v_arrayElimArr_1 (+ main_~b~0.offset 4)) 1)))) is different from false [2022-01-31 11:51:23,036 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0.offset Int) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((v_ArrVal_422 (Array Int Int))) (<= (let ((.cse0 (store (let ((.cse1 (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 (* c_main_~i~0 8) 8) 1)) c_main_~b~0.base v_arrayElimArr_1))) (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 (select .cse1 c_main_~a~0.base) c_main_~a~0.offset))) (+ (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 8)) .cse3 .cse4)))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse0 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (+ c_main_~i~0 3))) (forall ((v_ArrVal_422 (Array Int Int))) (<= (+ c_main_~i~0 3) (let ((.cse5 (store (let ((.cse6 (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 (* c_main_~i~0 8) 8) 1)) c_main_~b~0.base v_arrayElimArr_1))) (store .cse6 |c_main_~#sum~0.base| (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (store .cse7 |c_main_~#sum~0.offset| (let ((.cse8 (select .cse7 |c_main_~#sum~0.offset|)) (.cse9 (select (select .cse6 c_main_~a~0.base) c_main_~a~0.offset))) (+ (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse8 .cse9))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse8 .cse9)))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse5 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse5 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (not (= (select v_arrayElimArr_1 (+ main_~b~0.offset 4)) 1)))) is different from false [2022-01-31 11:51:23,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0.offset Int) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((v_ArrVal_422 (Array Int Int))) (<= (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse5 (* c_main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse5) 1) (+ c_main_~a~0.offset .cse5 8) 1))) c_main_~b~0.base v_arrayElimArr_1))) (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 (select .cse1 c_main_~a~0.base) c_main_~a~0.offset))) (+ .cse3 .cse4 (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 8)))))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse0 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (+ c_main_~i~0 3))) (forall ((v_ArrVal_422 (Array Int Int))) (<= (+ c_main_~i~0 3) (let ((.cse6 (store (let ((.cse7 (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse11 (* c_main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse11) 1) (+ c_main_~a~0.offset .cse11 8) 1))) c_main_~b~0.base v_arrayElimArr_1))) (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 (select .cse7 c_main_~a~0.base) c_main_~a~0.offset))) (+ .cse9 .cse10 (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 8)))))))) c_main_~a~0.base v_ArrVal_422))) (+ (select (select .cse6 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse6 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (not (= (select v_arrayElimArr_1 (+ main_~b~0.offset 4)) 1)))) is different from false [2022-01-31 11:51:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-01-31 11:51:23,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727461597] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:51:23,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:51:23,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 25] total 64 [2022-01-31 11:51:23,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720232863] [2022-01-31 11:51:23,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:51:23,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-01-31 11:51:23,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:51:23,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-01-31 11:51:23,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2393, Unknown=21, NotChecked=1332, Total=4032 [2022-01-31 11:51:23,106 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 64 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 61 states have internal predecessors, (101), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:51:31,541 WARN L228 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 66 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:51:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:51:36,372 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-01-31 11:51:36,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 11:51:36,372 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 61 states have internal predecessors, (101), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 50 [2022-01-31 11:51:36,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:51:36,373 INFO L225 Difference]: With dead ends: 87 [2022-01-31 11:51:36,373 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 11:51:36,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 67 SyntacticMatches, 18 SemanticMatches, 72 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=398, Invalid=3409, Unknown=23, NotChecked=1572, Total=5402 [2022-01-31 11:51:36,374 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 658 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:51:36,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 418 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 690 Invalid, 0 Unknown, 658 Unchecked, 0.4s Time] [2022-01-31 11:51:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 11:51:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-01-31 11:51:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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:51:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-01-31 11:51:36,377 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 50 [2022-01-31 11:51:36,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:51:36,377 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-01-31 11:51:36,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 61 states have internal predecessors, (101), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:51:36,377 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-01-31 11:51:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:51:36,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:51:36,378 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2022-01-31 11:51:36,395 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:51:36,591 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:51:36,591 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:51:36,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:51:36,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1605127086, now seen corresponding path program 7 times [2022-01-31 11:51:36,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:51:36,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241849209] [2022-01-31 11:51:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:51:36,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:51:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:38,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:51:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:51:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:51:38,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:51:38,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241849209] [2022-01-31 11:51:38,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241849209] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:51:38,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743181435] [2022-01-31 11:51:38,228 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:51:38,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:51:38,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:51:38,229 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:51:38,230 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:51:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:38,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 89 conjunts are in the unsatisfiable core [2022-01-31 11:51:38,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:51:38,320 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 11:51:38,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-01-31 11:51:38,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:51:38,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:51:38,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:38,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:51:38,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:38,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:38,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:38,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-01-31 11:51:38,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:38,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:38,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:38,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 61 [2022-01-31 11:51:39,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,046 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 60 treesize of output 71 [2022-01-31 11:51:39,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,180 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 60 treesize of output 71 [2022-01-31 11:51:39,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:51:39,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2022-01-31 11:51:39,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:51:39,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-01-31 11:51:39,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:51:39,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:39,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2022-01-31 11:51:40,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:40,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:40,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:51:40,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:51:40,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:40,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2022-01-31 11:51:40,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:40,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:40,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:40,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:40,322 INFO L353 Elim1Store]: treesize reduction 65, result has 39.3 percent of original size [2022-01-31 11:51:40,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 80 treesize of output 97 [2022-01-31 11:51:40,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:40,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:40,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:40,707 INFO L353 Elim1Store]: treesize reduction 131, result has 26.0 percent of original size [2022-01-31 11:51:40,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 91 treesize of output 98 [2022-01-31 11:51:40,998 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-31 11:51:40,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2022-01-31 11:51:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:51:41,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:51:43,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_144 Int)) (or (forall ((v_ArrVal_523 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_144)))) is different from false [2022-01-31 11:52:00,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_145 Int)) (or (forall ((v_ArrVal_522 Int) (v_main_~i~0_144 Int) (v_ArrVal_523 Int)) (or (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_145)))) is different from false [2022-01-31 11:52:02,117 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 Int) (v_main_~i~0_144 Int) (v_main_~i~0_145 Int) (v_ArrVal_523 Int)) (or (= (+ c_~N~0 1) (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset)) (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_145)))) is different from false [2022-01-31 11:52:10,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_152 Int)) (or (forall ((v_ArrVal_511 Int) (v_ArrVal_522 Int) (v_main_~i~0_144 Int) (v_main_~i~0_145 Int) (v_ArrVal_523 Int)) (or (= (select (store (store (let ((.cse5 (store |c_#memory_int| c_main_~b~0.base (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 4 v_main_~i~0_152) c_main_~b~0.offset) v_ArrVal_511)))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse6 |c_main_~#sum~0.offset|)) (.cse4 (select (select .cse5 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse0 (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ .cse1 .cse2 .cse3 .cse4 (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset))))))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (not (<= 1 v_main_~i~0_145)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_152)))) is different from false [2022-01-31 11:52:12,888 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_main_~i~0_144 Int) (v_main_~i~0_145 Int) (v_main_~i~0_152 Int) (v_ArrVal_523 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_152)) (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (not (<= 1 v_main_~i~0_145)) (= (select (store (store (let ((.cse5 (store |c_#memory_int| c_main_~b~0.base (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset) v_ArrVal_510) (+ (* 4 v_main_~i~0_152) c_main_~b~0.offset) v_ArrVal_511)))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse1 (select (select .cse5 c_main_~a~0.base) c_main_~a~0.offset)) (.cse2 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse0 (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse1 .cse2 .cse3 .cse4)))))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1)))) is different from false [2022-01-31 11:52:15,142 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_153 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_153)) (forall ((v_ArrVal_511 Int) (v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_main_~i~0_144 Int) (v_main_~i~0_145 Int) (v_main_~i~0_152 Int) (v_ArrVal_523 Int)) (or (= (select (store (store (let ((.cse5 (store |c_#memory_int| c_main_~b~0.base (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 4 v_main_~i~0_153) c_main_~b~0.offset) v_ArrVal_510) (+ (* 4 v_main_~i~0_152) c_main_~b~0.offset) v_ArrVal_511)))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse1 (select (select .cse5 c_main_~a~0.base) c_main_~a~0.offset)) (.cse2 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse0 (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ .cse1 .cse2 .cse3 (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse4)))))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (not (<= 1 v_main_~i~0_145)) (not (<= (+ v_main_~i~0_153 1) v_main_~i~0_152)))))) is different from false [2022-01-31 11:52:17,387 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_main_~i~0_144 Int) (v_main_~i~0_145 Int) (v_main_~i~0_153 Int) (v_main_~i~0_152 Int) (v_ArrVal_523 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_153)) (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (not (<= 1 v_main_~i~0_145)) (not (<= (+ v_main_~i~0_153 1) v_main_~i~0_152)) (= (select (store (store (let ((.cse5 (store |c_#memory_int| c_main_~b~0.base (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset) 1) (+ (* 4 v_main_~i~0_153) c_main_~b~0.offset) v_ArrVal_510) (+ (* 4 v_main_~i~0_152) c_main_~b~0.offset) v_ArrVal_511)))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse1 (select (select .cse5 c_main_~a~0.base) c_main_~a~0.offset)) (.cse3 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse0 (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ .cse1 .cse2 .cse3 (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse4)))))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1)))) is different from false [2022-01-31 11:55:53,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_144 Int) (v_main_~i~0_145 Int) (v_main_~i~0_153 Int) (v_main_~i~0_152 Int)) (or (and (forall ((v_ArrVal_511 Int) (v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_ArrVal_523 Int)) (<= (+ c_main_~i~0 4) (select (store (store (let ((.cse5 (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base (let ((.cse8 (* c_main_~i~0 8))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse8) 1) (+ c_main_~a~0.offset .cse8 8) 1) (+ c_main_~a~0.offset 16 .cse8) 1))))) (store .cse7 c_main_~b~0.base (store (store (store (select .cse7 c_main_~b~0.base) c_main_~b~0.offset 1) (+ (* 4 v_main_~i~0_153) c_main_~b~0.offset) v_ArrVal_510) (+ (* 4 v_main_~i~0_152) c_main_~b~0.offset) v_ArrVal_511))))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse6 |c_main_~#sum~0.offset|)) (.cse3 (select (select .cse5 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse0 (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ .cse1 .cse2 (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse3 .cse4)))))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset))) (forall ((v_ArrVal_511 Int) (v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_ArrVal_523 Int)) (<= (select (store (store (let ((.cse14 (let ((.cse16 (store |c_#memory_int| c_main_~a~0.base (let ((.cse17 (* c_main_~i~0 8))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse17) 1) (+ c_main_~a~0.offset .cse17 8) 1) (+ c_main_~a~0.offset 16 .cse17) 1))))) (store .cse16 c_main_~b~0.base (store (store (store (select .cse16 c_main_~b~0.base) c_main_~b~0.offset 1) (+ (* 4 v_main_~i~0_153) c_main_~b~0.offset) v_ArrVal_510) (+ (* 4 v_main_~i~0_152) c_main_~b~0.offset) v_ArrVal_511))))) (let ((.cse15 (select .cse14 |c_main_~#sum~0.base|))) (let ((.cse10 (select .cse15 |c_main_~#sum~0.offset|)) (.cse12 (select (select .cse14 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse13 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse10 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse11 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse10 .cse12 .cse13))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse9 (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse10 .cse11 .cse12 .cse13))))) (store (select .cse9 c_main_~a~0.base) c_main_~a~0.offset (+ .cse10 .cse11 (select (select .cse9 c_main_~b~0.base) c_main_~b~0.offset) .cse12 .cse13)))))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_main_~i~0 4)))) (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (not (<= 1 v_main_~i~0_145)) (not (<= (+ v_main_~i~0_153 1) v_main_~i~0_152)) (not (<= 1 v_main_~i~0_153)))) is different from false [2022-01-31 11:55:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-01-31 11:55:53,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743181435] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:55:53,105 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:55:53,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 30, 32] total 86 [2022-01-31 11:55:53,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727227055] [2022-01-31 11:55:53,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:55:53,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-01-31 11:55:53,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:55:53,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-01-31 11:55:53,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=5487, Unknown=101, NotChecked=1272, Total=7310 [2022-01-31 11:55:53,108 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 86 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:55:59,772 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (= 1 (select (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset))) (= 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_153 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_153)) (forall ((v_ArrVal_511 Int) (v_ArrVal_522 Int) (v_ArrVal_510 Int) (v_main_~i~0_144 Int) (v_main_~i~0_145 Int) (v_main_~i~0_152 Int) (v_ArrVal_523 Int)) (or (= (select (store (store (let ((.cse5 (store |c_#memory_int| c_main_~b~0.base (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 4 v_main_~i~0_153) c_main_~b~0.offset) v_ArrVal_510) (+ (* 4 v_main_~i~0_152) c_main_~b~0.offset) v_ArrVal_511)))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse1 (select (select .cse5 c_main_~a~0.base) c_main_~a~0.offset)) (.cse2 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse0 (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ .cse1 .cse2 .cse3 (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse4)))))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (not (<= 1 v_main_~i~0_145)) (not (<= (+ v_main_~i~0_153 1) v_main_~i~0_152)))))) (= c_main_~b~0.offset 0) (exists ((v_main_~i~0_135 Int)) (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* 8 v_main_~i~0_135))) (and (<= v_main_~i~0_135 2) (< v_main_~i~0_135 c_~N~0) (<= 2 v_main_~i~0_135) (<= c_~N~0 (+ v_main_~i~0_135 1)) (= (select .cse7 (+ .cse8 c_main_~a~0.offset)) 1) (= (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 1)))) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) (= (select (select |c_#memory_int| c_main_~a~0.base) 0) 1) (not (= c_main_~b~0.base c_main_~a~0.base))) is different from false [2022-01-31 11:56:01,929 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse0 (select |c_#memory_int| c_main_~b~0.base))) (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (= (select .cse0 c_main_~b~0.offset) 1) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= 3 c_~N~0) (= (select .cse1 8) 1) (= c_main_~b~0.offset 0) (exists ((v_main_~i~0_135 Int)) (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse3 (* 8 v_main_~i~0_135))) (and (<= v_main_~i~0_135 2) (< v_main_~i~0_135 c_~N~0) (<= 2 v_main_~i~0_135) (<= c_~N~0 (+ v_main_~i~0_135 1)) (= (select .cse2 (+ .cse3 c_main_~a~0.offset)) 1) (= (select .cse2 (+ .cse3 c_main_~a~0.offset (- 8))) 1)))) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) (forall ((v_main_~i~0_152 Int)) (or (forall ((v_ArrVal_511 Int) (v_ArrVal_522 Int) (v_main_~i~0_144 Int) (v_main_~i~0_145 Int) (v_ArrVal_523 Int)) (or (= (select (store (store (let ((.cse9 (store |c_#memory_int| c_main_~b~0.base (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 4 v_main_~i~0_152) c_main_~b~0.offset) v_ArrVal_511)))) (let ((.cse10 (select .cse9 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse10 |c_main_~#sum~0.offset|)) (.cse8 (select (select .cse9 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse6 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse5 .cse8))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse7 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse5 .cse6 .cse8))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse4 (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse5 .cse6 .cse7 .cse8))))) (store (select .cse4 c_main_~a~0.base) c_main_~a~0.offset (+ .cse5 .cse6 .cse7 .cse8 (select (select .cse4 c_main_~b~0.base) c_main_~b~0.offset))))))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (not (<= 1 v_main_~i~0_145)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_152)))) (or (= (select .cse1 (+ c_main_~a~0.offset (* c_~N~0 8) (- 8))) 1) (< 3 c_~N~0)) (= (select .cse1 0) 1) (not (= c_main_~b~0.base c_main_~a~0.base)) (= (select .cse0 0) 1))) is different from false [2022-01-31 11:56:09,608 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (or (= (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_main_~b~0.offset) c_~N~0) (<= (+ c_main_~i~0 1) c_~N~0)) (forall ((v_ArrVal_522 Int) (v_main_~i~0_144 Int) (v_main_~i~0_145 Int) (v_ArrVal_523 Int)) (or (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= 1 v_main_~i~0_145)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= c_main_~b~0.offset 0) (= (select (select |c_#memory_int| c_main_~b~0.base) 0) 1)) is different from false [2022-01-31 11:56:11,654 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_145 Int)) (or (forall ((v_ArrVal_522 Int) (v_main_~i~0_144 Int) (v_ArrVal_523 Int)) (or (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_145)))) (exists ((|main_~#sum~0.offset| Int) (main_~b~0.base Int) (|main_~#sum~0.base| Int)) (let ((.cse1 (select (select |c_#memory_int| main_~b~0.base) (* c_main_~i~0 4)))) (let ((.cse0 (+ (* (- 1) .cse1) (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)))))) (and (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) .cse0) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (not (= main_~b~0.base |main_~#sum~0.base|)) (= .cse1 1) (= 3 .cse0))))) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (= c_main_~i~0 0) (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_~a~0.offset (* c_main_~i~0 8))) (+ c_~N~0 1)) (= c_main_~b~0.offset 0) (exists ((v_main_~i~0_135 Int)) (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse3 (* 8 v_main_~i~0_135))) (and (<= v_main_~i~0_135 2) (< v_main_~i~0_135 c_~N~0) (<= 2 v_main_~i~0_135) (<= c_~N~0 (+ v_main_~i~0_135 1)) (= (select .cse2 (+ .cse3 c_main_~a~0.offset)) 1) (= (select .cse2 (+ .cse3 c_main_~a~0.offset (- 8))) 1))))) is different from false [2022-01-31 11:56:13,849 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_145 Int)) (or (forall ((v_ArrVal_522 Int) (v_main_~i~0_144 Int) (v_ArrVal_523 Int)) (or (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_145)) v_ArrVal_522) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_145)))) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (= c_main_~i~0 0) (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_~a~0.offset (* c_main_~i~0 8))) (+ c_~N~0 1)) (= c_main_~b~0.offset 0)) is different from false [2022-01-31 11:56:15,852 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (exists ((v_main_~i~0_135 Int)) (let ((.cse1 (* c_main_~i~0 8)) (.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse0 (* 8 v_main_~i~0_135))) (and (<= v_main_~i~0_135 2) (< v_main_~i~0_135 c_~N~0) (<= 2 v_main_~i~0_135) (or (= .cse0 (+ .cse1 8)) (= (select .cse2 (+ .cse0 c_main_~a~0.offset (- 8))) 1)) (or (= .cse0 .cse1) (= (select .cse2 (+ .cse0 c_main_~a~0.offset)) 1)) (<= c_~N~0 (+ v_main_~i~0_135 1))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select (select |c_#memory_int| c_main_~a~0.base) 0) (+ c_~N~0 1)) (= c_main_~a~0.offset 0) (exists ((|main_~#sum~0.offset| Int) (main_~b~0.base Int) (|main_~#sum~0.base| Int)) (let ((.cse4 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (let ((.cse3 (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (* (- 1) .cse4)))) (and (= .cse3 1) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| main_~b~0.base) 0) .cse3) (= .cse4 3) (not (= main_~b~0.base |main_~#sum~0.base|)))))) (forall ((v_main_~i~0_144 Int)) (or (forall ((v_ArrVal_523 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_144)))) (= c_main_~b~0.offset 0) (<= (+ (div (* (- 1) c_main_~a~0.offset) 8) 1) c_main_~i~0)) is different from false [2022-01-31 11:56:18,039 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select (select |c_#memory_int| c_main_~a~0.base) 0) (+ c_~N~0 1)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_144 Int)) (or (forall ((v_ArrVal_523 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_144)))) (= c_main_~b~0.offset 0) (<= (+ (div (* (- 1) c_main_~a~0.offset) 8) 1) c_main_~i~0)) is different from false [2022-01-31 11:56:20,043 WARN L838 $PredicateComparison]: unable to prove that (and (< 2 c_~N~0) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select (select |c_#memory_int| c_main_~a~0.base) 0) (+ c_~N~0 1)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_144 Int)) (or (forall ((v_ArrVal_523 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_523) c_main_~a~0.offset) (+ c_~N~0 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_144)))) (= c_main_~b~0.offset 0) (<= c_~N~0 3) (exists ((|main_~#sum~0.offset| Int) (main_~b~0.base Int) (|main_~#sum~0.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select (select |c_#memory_int| main_~b~0.base) 0) 1) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (+ .cse0 1)) (= .cse0 3) (not (= main_~b~0.base |main_~#sum~0.base|))))) (<= (+ (div (* (- 1) c_main_~a~0.offset) 8) 1) c_main_~i~0)) is different from false [2022-01-31 11:56:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:56:22,954 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2022-01-31 11:56:22,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-31 11:56:22,955 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-01-31 11:56:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:56:22,956 INFO L225 Difference]: With dead ends: 113 [2022-01-31 11:56:22,956 INFO L226 Difference]: Without dead ends: 113 [2022-01-31 11:56:22,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 110 ConstructedPredicates, 16 IntricatePredicates, 1 DeprecatedPredicates, 3442 ImplicationChecksByTransitivity, 273.7s TimeCoverageRelationStatistics Valid=694, Invalid=8380, Unknown=110, NotChecked=3248, Total=12432 [2022-01-31 11:56:22,958 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 811 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:56:22,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 369 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 430 Invalid, 0 Unknown, 811 Unchecked, 0.3s Time] [2022-01-31 11:56:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-31 11:56:22,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2022-01-31 11:56:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 96 states have (on average 1.125) internal successors, (108), 97 states have internal predecessors, (108), 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:56:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-01-31 11:56:22,963 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 50 [2022-01-31 11:56:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:56:22,964 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-01-31 11:56:22,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:56:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-01-31 11:56:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 11:56:22,965 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:56:22,965 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1] [2022-01-31 11:56:22,981 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:56:23,171 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:56:23,171 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:56:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:56:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1510631796, now seen corresponding path program 8 times [2022-01-31 11:56:23,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:56:23,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542902973] [2022-01-31 11:56:23,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:56:23,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:56:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:56:23,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:56:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:56:23,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:56:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:56:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 11:56:23,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:56:23,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542902973] [2022-01-31 11:56:23,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542902973] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:56:23,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908349884] [2022-01-31 11:56:23,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:56:23,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:56:23,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:56:23,259 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:56:23,260 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:56:23,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:56:23,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:56:23,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:56:23,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:56:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 11:56:23,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:56:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 11:56:23,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908349884] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:56:23,540 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:56:23,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:56:23,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894662697] [2022-01-31 11:56:23,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:56:23,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:56:23,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:56:23,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:56:23,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:56:23,542 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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:56:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:56:23,843 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2022-01-31 11:56:23,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:56:23,843 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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:56:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:56:23,844 INFO L225 Difference]: With dead ends: 159 [2022-01-31 11:56:23,844 INFO L226 Difference]: Without dead ends: 156 [2022-01-31 11:56:23,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 11:56:23,845 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 115 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:56:23,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 95 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:56:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-01-31 11:56:23,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 117. [2022-01-31 11:56:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 105 states have internal predecessors, (113), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 11:56:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2022-01-31 11:56:23,850 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 52 [2022-01-31 11:56:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:56:23,850 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2022-01-31 11:56:23,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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:56:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2022-01-31 11:56:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 11:56:23,851 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:56:23,851 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1] [2022-01-31 11:56:23,868 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:56:24,067 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:56:24,068 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:56:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:56:24,068 INFO L85 PathProgramCache]: Analyzing trace with hash -754062360, now seen corresponding path program 9 times [2022-01-31 11:56:24,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:56:24,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693543637] [2022-01-31 11:56:24,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:56:24,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:56:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:56:24,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:56:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:56:24,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:56:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:56:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:56:24,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:56:24,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693543637] [2022-01-31 11:56:24,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693543637] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:56:24,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016576888] [2022-01-31 11:56:24,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:56:24,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:56:24,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:56:24,164 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:56:24,166 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:56:24,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:56:24,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:56:24,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:56:24,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:56:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:56:24,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:56:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:56:24,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016576888] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:56:24,536 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:56:24,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:56:24,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798181152] [2022-01-31 11:56:24,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:56:24,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:56:24,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:56:24,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:56:24,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:56:24,537 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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:56:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:56:24,938 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-01-31 11:56:24,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:56:24,939 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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:56:24,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:56:24,940 INFO L225 Difference]: With dead ends: 127 [2022-01-31 11:56:24,940 INFO L226 Difference]: Without dead ends: 127 [2022-01-31 11:56:24,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 11:56:24,940 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 126 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:56:24,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 102 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:56:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-01-31 11:56:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2022-01-31 11:56:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.075268817204301) internal successors, (100), 94 states have internal predecessors, (100), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 11:56:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2022-01-31 11:56:24,944 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 54 [2022-01-31 11:56:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:56:24,944 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2022-01-31 11:56:24,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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:56:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2022-01-31 11:56:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 11:56:24,945 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:56:24,945 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2022-01-31 11:56:24,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 11:56:25,168 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:56:25,168 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:56:25,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:56:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1124834845, now seen corresponding path program 2 times [2022-01-31 11:56:25,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:56:25,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386918118] [2022-01-31 11:56:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:56:25,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:56:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:56:26,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:56:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:56:26,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:56:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:56:26,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 11:56:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:56:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:56:26,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:56:26,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386918118] [2022-01-31 11:56:26,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386918118] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:56:26,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385830501] [2022-01-31 11:56:26,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:56:26,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:56:26,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:56:26,382 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:56:26,383 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:56:26,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:56:26,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:56:26,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 89 conjunts are in the unsatisfiable core [2022-01-31 11:56:26,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:56:26,485 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 11:56:26,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-01-31 11:56:26,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:56:26,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:56:26,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:26,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-01-31 11:56:26,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:26,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:26,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:26,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-01-31 11:56:27,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-01-31 11:56:27,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-01-31 11:56:27,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,379 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:56:27,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 68 [2022-01-31 11:56:27,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:56:27,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 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:56:27,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:56:27,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:27,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2022-01-31 11:56:28,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:28,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:28,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:28,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2022-01-31 11:56:28,308 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2022-01-31 11:56:28,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:28,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:28,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:28,315 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 33 treesize of output 19 [2022-01-31 11:56:28,475 INFO L353 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-01-31 11:56:28,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-01-31 11:56:28,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:56:28,748 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 49 treesize of output 48 [2022-01-31 11:56:29,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 15 [2022-01-31 11:56:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:56:29,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:56:32,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_221 Int)) (or (forall ((v_ArrVal_774 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) (+ c_main_~a~0.offset 8)) (+ c_~N~0 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_221)))) is different from false [2022-01-31 11:57:30,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_main_~i~0_221 Int) (v_ArrVal_770 (Array Int Int))) (or (= (select (store (store v_ArrVal_770 (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse0 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse0 c_main_~b~0.base) (+ (* c_main_~i~0 4) 4 c_main_~b~0.offset))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) (+ c_main_~a~0.offset 8)) (+ c_~N~0 1)) (not (<= (+ c_main_~i~0 2) v_main_~i~0_221)))) is different from false [2022-01-31 11:57:30,694 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_main_~i~0_221 Int) (v_ArrVal_770 (Array Int Int))) (or (= (+ c_~N~0 1) (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 c_main_~b~0.base) (+ 4 c_main_~b~0.offset)) (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0))) (not (<= 2 v_main_~i~0_221)))) is different from false [2022-01-31 11:57:30,725 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_main_~i~0_221 Int) (v_ArrVal_770 (Array Int Int))) (or (= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse2 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (+ (select .cse2 |c_main_~#sum~0.offset|) (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse1 c_main_~b~0.base) (+ 4 c_main_~b~0.offset))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_~N~0 1)) (not (<= 2 v_main_~i~0_221)))) is different from false [2022-01-31 11:57:30,739 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_main_~i~0_221 Int) (v_ArrVal_770 (Array Int Int))) (or (= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse2 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8)) (select .cse2 |c_main_~#sum~0.offset|))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse1 c_main_~b~0.base) (+ 4 c_main_~b~0.offset))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_~N~0 1)) (not (<= 2 v_main_~i~0_221)))) is different from false [2022-01-31 11:57:30,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_main_~i~0_221 Int) (v_ArrVal_770 (Array Int Int))) (or (= (+ c_~N~0 1) (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse2 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (let ((.cse5 (* c_main_~i~0 8))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.offset|)) (.cse4 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse5)))) (+ .cse3 .cse4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse5 8)))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 c_main_~b~0.base) (+ 4 c_main_~b~0.offset)) (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0))) (not (<= 2 v_main_~i~0_221)))) is different from false [2022-01-31 11:57:30,775 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_main_~i~0_221 Int) (v_ArrVal_770 (Array Int Int))) (or (= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse2 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (let ((.cse5 (* c_main_~i~0 8))) (let ((.cse3 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse5 8))) (.cse4 (select .cse2 |c_main_~#sum~0.offset|))) (+ .cse3 .cse4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 16 .cse5)))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 c_main_~b~0.base) (+ 4 c_main_~b~0.offset)) (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_~N~0 1)) (not (<= 2 v_main_~i~0_221)))) is different from false [2022-01-31 11:57:30,798 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_main_~i~0_221 Int) (v_ArrVal_770 (Array Int Int))) (or (= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse2 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (let ((.cse6 (* c_main_~i~0 8))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.offset|)) (.cse4 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse6)))) (let ((.cse5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse6 8)))) (+ .cse3 .cse4 .cse5 (select (select (store |c_#memory_int| |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 16 .cse6))))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 c_main_~b~0.base) (+ 4 c_main_~b~0.offset)) (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_~N~0 1)) (not (<= 2 v_main_~i~0_221)))) is different from false [2022-01-31 11:57:30,819 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_main_~i~0_221 Int) (v_ArrVal_770 (Array Int Int))) (or (= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse2 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (let ((.cse3 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (.cse4 (select .cse2 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) .cse0))) (+ .cse3 (select (select (store |c_#memory_int| |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 16)) .cse4 .cse5)))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse1 c_main_~b~0.base) (+ 4 c_main_~b~0.offset))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_~N~0 1)) (not (<= 2 v_main_~i~0_221)))) is different from false [2022-01-31 11:57:30,879 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_763 Int) (v_ArrVal_774 Int) (v_main_~i~0_221 Int) (v_ArrVal_770 (Array Int Int))) (or (not (<= 2 v_main_~i~0_221)) (= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| c_main_~b~0.base (store (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset) v_ArrVal_763)))) (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 .cse3 |c_main_~#sum~0.offset|)) (.cse5 (select (select .cse2 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse6 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) .cse0))) (+ (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) .cse4 .cse5 .cse6))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 c_main_~b~0.base) (+ 4 c_main_~b~0.offset)) (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_~N~0 1)))) is different from false [2022-01-31 11:57:30,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_229 Int)) (or (forall ((v_ArrVal_763 Int) (v_ArrVal_774 Int) (v_main_~i~0_221 Int) (v_ArrVal_770 (Array Int Int))) (or (= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| c_main_~b~0.base (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 4 v_main_~i~0_229) c_main_~b~0.offset) v_ArrVal_763)))) (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 (select .cse2 c_main_~a~0.base) c_main_~a~0.offset)) (.cse5 (select .cse3 |c_main_~#sum~0.offset|))) (let ((.cse6 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) .cse0))) (+ .cse4 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) .cse5 .cse6))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse1 c_main_~b~0.base) (+ 4 c_main_~b~0.offset))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_~N~0 1)) (not (<= 2 v_main_~i~0_221)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_229)))) is different from false [2022-01-31 11:57:31,029 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_763 Int) (v_ArrVal_774 Int) (main_~b~0.offset Int) (v_main_~i~0_221 Int) (v_main_~i~0_229 Int) (v_ArrVal_770 (Array Int Int))) (or (= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| c_main_~b~0.base (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) main_~b~0.offset) 1) (+ main_~b~0.offset (* 4 v_main_~i~0_229)) v_ArrVal_763)))) (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 .cse3 |c_main_~#sum~0.offset|)) (.cse5 (select (select .cse2 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse6 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) .cse0))) (+ .cse4 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) .cse5 .cse6))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse1 c_main_~b~0.base) (+ main_~b~0.offset 4))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_~N~0 1)) (not (<= 2 v_main_~i~0_221)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_229)))) is different from false [2022-01-31 11:57:31,119 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_763 Int) (v_ArrVal_774 Int) (main_~b~0.offset Int) (v_main_~i~0_221 Int) (v_main_~i~0_229 Int) (v_ArrVal_770 (Array Int Int))) (or (= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| c_main_~b~0.base (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) main_~b~0.offset 4) 1) (+ main_~b~0.offset (* 4 v_main_~i~0_229)) v_ArrVal_763)))) (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 .cse3 |c_main_~#sum~0.offset|)) (.cse6 (select (select .cse2 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse5 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse6))) c_main_~a~0.base) .cse0))) (+ .cse4 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) .cse5 .cse6))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse1 c_main_~b~0.base) (+ main_~b~0.offset 4))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_~N~0 1)) (not (<= (+ c_main_~i~0 2) v_main_~i~0_229)) (not (<= 2 v_main_~i~0_221)))) is different from false [2022-01-31 11:57:31,173 INFO L353 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2022-01-31 11:57:31,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 801 treesize of output 343 [2022-01-31 11:57:31,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (main_~b~0.offset Int) (v_main_~i~0_221 Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (or (not (= 1 (select v_arrayElimArr_2 (+ (* c_main_~i~0 4) main_~b~0.offset 4)))) (= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| c_main_~b~0.base v_arrayElimArr_2))) (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 (select .cse2 c_main_~a~0.base) c_main_~a~0.offset)) (.cse6 (select .cse3 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse6))) c_main_~a~0.base) .cse0))) (+ .cse4 .cse5 .cse6 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ c_main_~a~0.offset 16))))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse1 c_main_~b~0.base) (+ main_~b~0.offset 4))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_~N~0 1)) (not (<= 2 v_main_~i~0_221)))) is different from false [2022-01-31 11:57:31,303 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (main_~b~0.offset Int) (v_main_~i~0_221 Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (let ((.cse0 (+ main_~b~0.offset 4))) (or (not (= (select v_arrayElimArr_2 .cse0) 1)) (= (let ((.cse1 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse1 (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| c_main_~b~0.base v_arrayElimArr_2))) (store .cse3 |c_main_~#sum~0.base| (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (store .cse4 |c_main_~#sum~0.offset| (let ((.cse5 (select (select .cse3 c_main_~a~0.base) c_main_~a~0.offset)) (.cse7 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse6 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse5 .cse7))) c_main_~a~0.base) .cse1))) (+ .cse5 .cse6 .cse7 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse5 .cse6 .cse7))) c_main_~a~0.base) (+ c_main_~a~0.offset 16))))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse2 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse2 c_main_~b~0.base) .cse0)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse1)) (+ c_~N~0 1)) (not (<= 2 v_main_~i~0_221))))) is different from false [2022-01-31 11:57:32,046 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0.offset Int) (v_main_~i~0_221 Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 (+ main_~b~0.offset 4)) 1)) (and (forall ((v_ArrVal_774 Int) (v_ArrVal_770 (Array Int Int))) (<= (+ c_main_~i~0 2) (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (let ((.cse2 (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 (* c_main_~i~0 8)) 1)) c_main_~b~0.base v_arrayElimArr_2))) (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 .cse3 |c_main_~#sum~0.offset|)) (.cse5 (select (select .cse2 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse6 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) .cse0))) (+ .cse4 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) .cse5 .cse6))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse1 c_main_~b~0.base) (+ main_~b~0.offset 4))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)))) (forall ((v_ArrVal_774 Int) (v_ArrVal_770 (Array Int Int))) (<= (let ((.cse7 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse7 (let ((.cse8 (store (let ((.cse9 (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 (* c_main_~i~0 8)) 1)) c_main_~b~0.base v_arrayElimArr_2))) (store .cse9 |c_main_~#sum~0.base| (let ((.cse10 (select .cse9 |c_main_~#sum~0.base|))) (store .cse10 |c_main_~#sum~0.offset| (let ((.cse11 (select .cse10 |c_main_~#sum~0.offset|)) (.cse12 (select (select .cse9 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse13 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse11 .cse12))) c_main_~a~0.base) .cse7))) (+ .cse11 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse11 .cse12 .cse13))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) .cse12 .cse13))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse8 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse8 c_main_~b~0.base) (+ main_~b~0.offset 4))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse7)) (+ c_main_~i~0 2)))) (not (<= 2 v_main_~i~0_221)))) is different from false [2022-01-31 11:57:32,282 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0.offset Int) (v_main_~i~0_221 Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 (+ main_~b~0.offset 4)) 1)) (not (<= 2 v_main_~i~0_221)) (and (forall ((v_ArrVal_774 Int) (v_ArrVal_770 (Array Int Int))) (<= (+ c_main_~i~0 3) (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (let ((.cse2 (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 (* c_main_~i~0 8) 8) 1)) c_main_~b~0.base v_arrayElimArr_2))) (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 .cse3 |c_main_~#sum~0.offset|)) (.cse5 (select (select .cse2 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse6 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) .cse0))) (+ .cse4 .cse5 .cse6 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ c_main_~a~0.offset 16))))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)))) (forall ((v_ArrVal_774 Int) (v_ArrVal_770 (Array Int Int))) (<= (let ((.cse7 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse7 (let ((.cse8 (store (let ((.cse9 (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 (* c_main_~i~0 8) 8) 1)) c_main_~b~0.base v_arrayElimArr_2))) (store .cse9 |c_main_~#sum~0.base| (let ((.cse10 (select .cse9 |c_main_~#sum~0.base|))) (store .cse10 |c_main_~#sum~0.offset| (let ((.cse11 (select .cse10 |c_main_~#sum~0.offset|)) (.cse12 (select (select .cse9 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse13 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse11 .cse12))) c_main_~a~0.base) .cse7))) (+ .cse11 .cse12 .cse13 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse11 .cse12 .cse13))) c_main_~a~0.base) (+ c_main_~a~0.offset 16))))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse8 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse8 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse7)) (+ c_main_~i~0 3)))))) is different from false [2022-01-31 11:57:32,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0.offset Int) (v_main_~i~0_221 Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 (+ main_~b~0.offset 4)) 1)) (and (forall ((v_ArrVal_774 Int) (v_ArrVal_770 (Array Int Int))) (<= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse7 (* c_main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse7) 1) (+ c_main_~a~0.offset .cse7 8) 1))) c_main_~b~0.base v_arrayElimArr_2))) (store .cse2 |c_main_~#sum~0.base| (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (store .cse3 |c_main_~#sum~0.offset| (let ((.cse5 (select (select .cse2 c_main_~a~0.base) c_main_~a~0.offset)) (.cse6 (select .cse3 |c_main_~#sum~0.offset|))) (let ((.cse4 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse5 .cse6))) c_main_~a~0.base) .cse0))) (+ .cse4 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) .cse5 .cse6))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse1 c_main_~b~0.base) (+ main_~b~0.offset 4))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_main_~i~0 3))) (forall ((v_ArrVal_774 Int) (v_ArrVal_770 (Array Int Int))) (<= (+ c_main_~i~0 3) (let ((.cse8 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse8 (let ((.cse9 (store (let ((.cse10 (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse15 (* c_main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse15) 1) (+ c_main_~a~0.offset .cse15 8) 1))) c_main_~b~0.base v_arrayElimArr_2))) (store .cse10 |c_main_~#sum~0.base| (let ((.cse11 (select .cse10 |c_main_~#sum~0.base|))) (store .cse11 |c_main_~#sum~0.offset| (let ((.cse13 (select (select .cse10 c_main_~a~0.base) c_main_~a~0.offset)) (.cse14 (select .cse11 |c_main_~#sum~0.offset|))) (let ((.cse12 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse13 .cse14))) c_main_~a~0.base) .cse8))) (+ .cse12 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse12 .cse13 .cse14))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) .cse13 .cse14))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse9 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse9 c_main_~b~0.base) (+ main_~b~0.offset 4))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse8))))) (not (<= 2 v_main_~i~0_221)))) is different from false [2022-01-31 11:57:32,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0.offset Int) (v_main_~i~0_221 Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 (+ main_~b~0.offset 4)) 1)) (and (forall ((v_ArrVal_774 Int) (v_ArrVal_770 (Array Int Int))) (<= (+ c_main_~i~0 4) (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse7 (* c_main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse7 8) 1) (+ c_main_~a~0.offset 16 .cse7) 1))) c_main_~b~0.base v_arrayElimArr_2))) (store .cse2 |c_main_~#sum~0.base| (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (store .cse3 |c_main_~#sum~0.offset| (let ((.cse5 (select (select .cse2 c_main_~a~0.base) c_main_~a~0.offset)) (.cse6 (select .cse3 |c_main_~#sum~0.offset|))) (let ((.cse4 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse5 .cse6))) c_main_~a~0.base) .cse0))) (+ .cse4 .cse5 .cse6 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ c_main_~a~0.offset 16))))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)))) (forall ((v_ArrVal_774 Int) (v_ArrVal_770 (Array Int Int))) (<= (let ((.cse8 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse8 (let ((.cse9 (store (let ((.cse10 (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse15 (* c_main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse15 8) 1) (+ c_main_~a~0.offset 16 .cse15) 1))) c_main_~b~0.base v_arrayElimArr_2))) (store .cse10 |c_main_~#sum~0.base| (let ((.cse11 (select .cse10 |c_main_~#sum~0.base|))) (store .cse11 |c_main_~#sum~0.offset| (let ((.cse13 (select (select .cse10 c_main_~a~0.base) c_main_~a~0.offset)) (.cse14 (select .cse11 |c_main_~#sum~0.offset|))) (let ((.cse12 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse13 .cse14))) c_main_~a~0.base) .cse8))) (+ .cse12 .cse13 .cse14 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse12 .cse13 .cse14))) c_main_~a~0.base) (+ c_main_~a~0.offset 16))))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse9 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse9 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse8)) (+ c_main_~i~0 4)))) (not (<= 2 v_main_~i~0_221)))) is different from false [2022-01-31 11:57:33,350 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0.offset Int) (v_main_~i~0_221 Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 (+ main_~b~0.offset 4)) 1)) (not (<= 2 v_main_~i~0_221)) (and (forall ((v_ArrVal_774 Int) (v_ArrVal_770 (Array Int Int))) (<= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse7 (* c_main_~i~0 8))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse7) 1) (+ c_main_~a~0.offset .cse7 8) 1) (+ c_main_~a~0.offset 16 .cse7) 1))) c_main_~b~0.base v_arrayElimArr_2))) (store .cse2 |c_main_~#sum~0.base| (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (store .cse3 |c_main_~#sum~0.offset| (let ((.cse5 (select .cse3 |c_main_~#sum~0.offset|)) (.cse6 (select (select .cse2 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse4 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse5 .cse6))) c_main_~a~0.base) .cse0))) (+ .cse4 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) .cse5 .cse6))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_main_~i~0 4))) (forall ((v_ArrVal_774 Int) (v_ArrVal_770 (Array Int Int))) (<= (+ c_main_~i~0 4) (let ((.cse8 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse8 (let ((.cse9 (store (let ((.cse10 (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse15 (* c_main_~i~0 8))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse15) 1) (+ c_main_~a~0.offset .cse15 8) 1) (+ c_main_~a~0.offset 16 .cse15) 1))) c_main_~b~0.base v_arrayElimArr_2))) (store .cse10 |c_main_~#sum~0.base| (let ((.cse11 (select .cse10 |c_main_~#sum~0.base|))) (store .cse11 |c_main_~#sum~0.offset| (let ((.cse13 (select .cse11 |c_main_~#sum~0.offset|)) (.cse14 (select (select .cse10 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse12 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse13 .cse14))) c_main_~a~0.base) .cse8))) (+ .cse12 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse12 .cse13 .cse14))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) .cse13 .cse14))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse9 c_main_~b~0.base) (+ main_~b~0.offset 4)) (select (select .cse9 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse8))))))) is different from false [2022-01-31 11:57:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 32 not checked. [2022-01-31 11:57:33,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385830501] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:57:33,383 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:57:33,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 33] total 91 [2022-01-31 11:57:33,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986561462] [2022-01-31 11:57:33,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:57:33,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-01-31 11:57:33,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:57:33,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-01-31 11:57:33,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=4589, Unknown=69, NotChecked=3140, Total=8190 [2022-01-31 11:57:33,386 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand has 91 states, 88 states have (on average 1.5113636363636365) internal successors, (133), 89 states have internal predecessors, (133), 6 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:57:47,440 WARN L228 SmtUtils]: Spent 8.55s on a formula simplification. DAG size of input: 95 DAG size of output: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:57:49,606 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base)) (.cse10 (+ c_~N~0 1)) (.cse14 (select |c_#memory_int| c_main_~b~0.base)) (.cse13 (* c_main_~i~0 4))) (let ((.cse12 (select .cse14 (+ .cse13 c_main_~b~0.offset))) (.cse11 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse7 (+ c_main_~a~0.offset (* c_main_~i~0 8))) (.cse8 (not (= (select .cse9 0) .cse10)))) (and (= 0 (+ (- 1) c_main_~i~0)) (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (forall ((v_main_~i~0_229 Int)) (or (forall ((v_ArrVal_763 Int) (v_ArrVal_774 Int) (v_main_~i~0_221 Int) (v_ArrVal_770 (Array Int Int))) (or (= (let ((.cse0 (+ c_main_~a~0.offset 8))) (select (store (store v_ArrVal_770 .cse0 (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| c_main_~b~0.base (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 4 v_main_~i~0_229) c_main_~b~0.offset) v_ArrVal_763)))) (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 (select .cse2 c_main_~a~0.base) c_main_~a~0.offset)) (.cse5 (select .cse3 |c_main_~#sum~0.offset|))) (let ((.cse6 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) .cse0))) (+ .cse4 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) .cse5 .cse6))))))) c_main_~a~0.base v_ArrVal_770))) (+ (select (select .cse1 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select .cse1 c_main_~b~0.base) (+ 4 c_main_~b~0.offset))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) .cse0)) (+ c_~N~0 1)) (not (<= 2 v_main_~i~0_221)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_229)))) (< 2 c_~N~0) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (or (and (not (= .cse7 0)) .cse8) (and (= (select .cse9 8) .cse10) (not (= 8 .cse7)))) (or (= (+ .cse11 c_main_~b~0.offset) c_~N~0) .cse8) (= 1 .cse12) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse9 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (<= 3 c_~N~0) (= (+ (- 1) .cse12) 0) (= c_main_~b~0.offset 0) (= (select .cse9 (+ c_main_~a~0.offset 16)) 1) (= .cse11 0) (<= .cse10 .cse13) (<= c_~N~0 3) (or (= (select .cse9 .cse7) .cse10) .cse8) (= (select .cse9 (+ c_main_~a~0.offset 8)) 1) (not (= c_main_~b~0.base c_main_~a~0.base)) (= (select .cse14 0) 1)))) is different from false [2022-01-31 11:57:57,932 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_main_~a~0.base)) (.cse5 (+ c_~N~0 1))) (let ((.cse1 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (not (= (select .cse4 0) .cse5)))) (and (= 0 (+ (- 1) c_main_~i~0)) (exists ((|main_~#sum~0.offset| Int) (main_~b~0.offset Int) (main_~b~0.base Int) (|main_~#sum~0.base| Int)) (let ((.cse0 (select |c_#memory_int| main_~b~0.base))) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (not (= c_main_~a~0.base main_~b~0.base)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3) (not (= main_~b~0.base |main_~#sum~0.base|)) (= (select .cse0 (+ main_~b~0.offset 4)) 1) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8))) (- 3)) (select .cse0 (+ (* c_main_~i~0 4) main_~b~0.offset)))))) (= (+ (- 2) .cse1) 1) (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (= (select .cse2 (+ 4 c_main_~b~0.offset)) 1) (< 2 c_~N~0) (forall ((v_main_~i~0_221 Int)) (or (forall ((v_ArrVal_774 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) (+ c_main_~a~0.offset 8)) (+ c_~N~0 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_221)))) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (or (= (+ .cse1 c_main_~b~0.offset) c_~N~0) .cse3) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= 3 c_~N~0) (= (+ (- 1) (select .cse2 (+ (* c_main_~i~0 4) c_main_~b~0.offset))) 0) (= c_main_~b~0.offset 0) (<= c_~N~0 3) (<= c_main_~i~0 2) (or (= (select .cse4 (+ c_main_~a~0.offset (* c_main_~i~0 8))) .cse5) .cse3) (not (= c_main_~b~0.base c_main_~a~0.base))))) is different from false [2022-01-31 11:57:59,992 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (- 3)) 1) (< 2 c_~N~0) (forall ((v_main_~i~0_221 Int)) (or (forall ((v_ArrVal_774 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_221)) v_ArrVal_774) (+ c_main_~a~0.offset 8)) (+ c_~N~0 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_221)))) (= c_main_~a~0.offset 0) (<= c_~N~0 3) (exists ((|main_~#sum~0.offset| Int) (main_~b~0.offset Int) (main_~b~0.base Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (not (= c_main_~a~0.base main_~b~0.base)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (- 3)) (select (select |c_#memory_int| main_~b~0.base) (+ main_~b~0.offset 4))) (not (= main_~b~0.base |main_~#sum~0.base|))))) is different from false [2022-01-31 11:58:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:58:02,632 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-01-31 11:58:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 11:58:02,633 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 88 states have (on average 1.5113636363636365) internal successors, (133), 89 states have internal predecessors, (133), 6 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 58 [2022-01-31 11:58:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:58:02,633 INFO L225 Difference]: With dead ends: 114 [2022-01-31 11:58:02,633 INFO L226 Difference]: Without dead ends: 112 [2022-01-31 11:58:02,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 2963 ImplicationChecksByTransitivity, 92.1s TimeCoverageRelationStatistics Valid=836, Invalid=9888, Unknown=80, NotChecked=5198, Total=16002 [2022-01-31 11:58:02,636 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1558 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 11:58:02,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 683 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1131 Invalid, 0 Unknown, 1558 Unchecked, 0.7s Time] [2022-01-31 11:58:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-01-31 11:58:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2022-01-31 11:58:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 11:58:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2022-01-31 11:58:02,639 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 58 [2022-01-31 11:58:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:58:02,639 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2022-01-31 11:58:02,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 88 states have (on average 1.5113636363636365) internal successors, (133), 89 states have internal predecessors, (133), 6 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:58:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-01-31 11:58:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 11:58:02,640 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:58:02,640 INFO L514 BasicCegarLoop]: trace histogram [4, 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, 1, 1] [2022-01-31 11:58:02,658 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:58:02,851 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:58:02,851 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:58:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:58:02,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1609961604, now seen corresponding path program 10 times [2022-01-31 11:58:02,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:58:02,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748986885] [2022-01-31 11:58:02,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:58:02,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:58:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:05,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:58:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:05,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:58:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:58:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:58:05,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:58:05,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748986885] [2022-01-31 11:58:05,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748986885] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:58:05,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592822162] [2022-01-31 11:58:05,174 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:58:05,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:58:05,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:58:05,175 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:58:05,175 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:58:05,266 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:58:05,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:58:05,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 101 conjunts are in the unsatisfiable core [2022-01-31 11:58:05,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:58:05,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-01-31 11:58:05,314 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:58:05,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,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, 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:58:05,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:58:05,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 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:58:05,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:05,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 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:58:06,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 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:58:06,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2022-01-31 11:58:06,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2022-01-31 11:58:06,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2022-01-31 11:58:06,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:06,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:06,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2022-01-31 11:58:07,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:07,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 85 [2022-01-31 11:58:07,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:07,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 79 [2022-01-31 11:58:07,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,646 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 0 case distinctions, treesize of input 98 treesize of output 79 [2022-01-31 11:58:07,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:07,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:07,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:07,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 85 [2022-01-31 11:58:08,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,248 INFO L353 Elim1Store]: treesize reduction 80, result has 36.5 percent of original size [2022-01-31 11:58:08,248 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 70 treesize of output 98 [2022-01-31 11:58:08,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:08,614 INFO L353 Elim1Store]: treesize reduction 142, result has 27.6 percent of original size [2022-01-31 11:58:08,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 97 treesize of output 111 [2022-01-31 11:58:09,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:09,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:09,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:09,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:09,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:09,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:09,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:09,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:09,054 INFO L353 Elim1Store]: treesize reduction 148, result has 24.5 percent of original size [2022-01-31 11:58:09,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 97 [2022-01-31 11:58:09,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:09,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:58:09,339 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-31 11:58:09,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-01-31 11:58:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:58:09,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:58:11,728 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_251 Int)) (or (forall ((v_ArrVal_895 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_895) c_main_~a~0.offset) (+ c_~N~0 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_251)))) is different from false [2022-01-31 11:58:42,599 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_252 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_252)) (forall ((v_ArrVal_895 Int) (v_ArrVal_894 Int) (v_main_~i~0_251 Int)) (or (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_252)) v_ArrVal_894) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_895) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= (+ v_main_~i~0_252 1) v_main_~i~0_251)))))) is different from false [2022-01-31 12:00:50,267 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_253 Int)) (or (forall ((v_ArrVal_895 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_main_~i~0_252 Int) (v_main_~i~0_251 Int)) (or (not (<= (+ v_main_~i~0_252 1) v_main_~i~0_251)) (not (<= (+ v_main_~i~0_253 1) v_main_~i~0_252)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_253) c_main_~a~0.offset) v_ArrVal_892) (+ c_main_~a~0.offset (* 8 v_main_~i~0_252)) v_ArrVal_894) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_895) c_main_~a~0.offset) (+ c_~N~0 1)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_253)))) is different from false [2022-01-31 12:00:52,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_main_~i~0_252 Int) (v_main_~i~0_253 Int) (v_main_~i~0_251 Int)) (or (not (<= (+ v_main_~i~0_252 1) v_main_~i~0_251)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset)))) (+ (* 8 v_main_~i~0_253) c_main_~a~0.offset) v_ArrVal_892) (+ c_main_~a~0.offset (* 8 v_main_~i~0_252)) v_ArrVal_894) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_895) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_253)) (not (<= (+ v_main_~i~0_253 1) v_main_~i~0_252)))) is different from false [2022-01-31 12:01:49,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_261 Int)) (or (forall ((v_ArrVal_895 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_main_~i~0_252 Int) (v_ArrVal_880 Int) (v_main_~i~0_253 Int) (v_main_~i~0_251 Int)) (or (not (<= (+ v_main_~i~0_252 1) v_main_~i~0_251)) (= (select (store (store (store (let ((.cse6 (store |c_#memory_int| c_main_~b~0.base (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 4 v_main_~i~0_261) c_main_~b~0.offset) v_ArrVal_880)))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse7 |c_main_~#sum~0.offset|)) (.cse5 (select (select .cse6 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse3 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 24)))) (let ((.cse0 (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse1 .cse2 .cse3 .cse4 .cse5))))))))) (+ (* 8 v_main_~i~0_253) c_main_~a~0.offset) v_ArrVal_892) (+ c_main_~a~0.offset (* 8 v_main_~i~0_252)) v_ArrVal_894) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_895) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= (+ v_main_~i~0_253 1) v_main_~i~0_252)) (not (<= 1 v_main_~i~0_253)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_261)))) is different from false [2022-01-31 12:01:51,687 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_main_~i~0_252 Int) (v_ArrVal_880 Int) (v_main_~i~0_253 Int) (v_main_~i~0_261 Int) (v_main_~i~0_251 Int) (v_ArrVal_877 Int)) (or (= (select (store (store (store (let ((.cse6 (store |c_#memory_int| c_main_~b~0.base (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset) v_ArrVal_877) (+ (* 4 v_main_~i~0_261) c_main_~b~0.offset) v_ArrVal_880)))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse7 |c_main_~#sum~0.offset|)) (.cse4 (select (select .cse6 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 24)))) (let ((.cse0 (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse1 .cse2 .cse3 .cse4 .cse5))))))))) (+ (* 8 v_main_~i~0_253) c_main_~a~0.offset) v_ArrVal_892) (+ c_main_~a~0.offset (* 8 v_main_~i~0_252)) v_ArrVal_894) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_895) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= (+ v_main_~i~0_252 1) v_main_~i~0_251)) (not (<= (+ v_main_~i~0_253 1) v_main_~i~0_252)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_261)) (not (<= 1 v_main_~i~0_253)))) is different from false [2022-01-31 12:01:54,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_262 Int)) (or (forall ((v_ArrVal_895 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_main_~i~0_252 Int) (v_ArrVal_880 Int) (v_main_~i~0_253 Int) (v_main_~i~0_261 Int) (v_main_~i~0_251 Int) (v_ArrVal_877 Int)) (or (= (select (store (store (store (let ((.cse6 (store |c_#memory_int| c_main_~b~0.base (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 4 v_main_~i~0_262) c_main_~b~0.offset) v_ArrVal_877) (+ (* 4 v_main_~i~0_261) c_main_~b~0.offset) v_ArrVal_880)))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|)) (.cse5 (select (select .cse6 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 24)))) (let ((.cse0 (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse1 .cse2 .cse3 .cse4 .cse5))))))))) (+ (* 8 v_main_~i~0_253) c_main_~a~0.offset) v_ArrVal_892) (+ c_main_~a~0.offset (* 8 v_main_~i~0_252)) v_ArrVal_894) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_895) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= (+ v_main_~i~0_252 1) v_main_~i~0_251)) (not (<= (+ v_main_~i~0_262 1) v_main_~i~0_261)) (not (<= (+ v_main_~i~0_253 1) v_main_~i~0_252)) (not (<= 1 v_main_~i~0_253)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_262)))) is different from false [2022-01-31 12:01:56,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_main_~i~0_252 Int) (v_ArrVal_880 Int) (v_main_~i~0_253 Int) (v_main_~i~0_261 Int) (v_main_~i~0_262 Int) (v_main_~i~0_251 Int) (v_ArrVal_877 Int) (v_ArrVal_875 Int)) (or (= (select (store (store (store (let ((.cse6 (store |c_#memory_int| c_main_~b~0.base (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset) v_ArrVal_875) (+ (* 4 v_main_~i~0_262) c_main_~b~0.offset) v_ArrVal_877) (+ (* 4 v_main_~i~0_261) c_main_~b~0.offset) v_ArrVal_880)))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse7 |c_main_~#sum~0.offset|)) (.cse4 (select (select .cse6 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 24)))) (let ((.cse0 (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse1 .cse2 .cse3 .cse4 .cse5))))))))) (+ (* 8 v_main_~i~0_253) c_main_~a~0.offset) v_ArrVal_892) (+ c_main_~a~0.offset (* 8 v_main_~i~0_252)) v_ArrVal_894) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_895) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= (+ v_main_~i~0_252 1) v_main_~i~0_251)) (not (<= (+ v_main_~i~0_262 1) v_main_~i~0_261)) (not (<= (+ v_main_~i~0_253 1) v_main_~i~0_252)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_262)) (not (<= 1 v_main_~i~0_253)))) is different from false [2022-01-31 12:01:59,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_263 Int)) (or (forall ((v_ArrVal_895 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_main_~i~0_252 Int) (v_ArrVal_880 Int) (v_main_~i~0_253 Int) (v_main_~i~0_261 Int) (v_main_~i~0_262 Int) (v_main_~i~0_251 Int) (v_ArrVal_877 Int) (v_ArrVal_875 Int)) (or (not (<= (+ v_main_~i~0_263 1) v_main_~i~0_262)) (not (<= (+ v_main_~i~0_252 1) v_main_~i~0_251)) (= (select (store (store (store (let ((.cse6 (store |c_#memory_int| c_main_~b~0.base (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* 4 v_main_~i~0_263) c_main_~b~0.offset) v_ArrVal_875) (+ (* 4 v_main_~i~0_262) c_main_~b~0.offset) v_ArrVal_877) (+ (* 4 v_main_~i~0_261) c_main_~b~0.offset) v_ArrVal_880)))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select (select .cse6 c_main_~a~0.base) c_main_~a~0.offset)) (.cse3 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 24)))) (let ((.cse0 (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ .cse1 .cse2 (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse3 .cse4 .cse5))))))))) (+ (* 8 v_main_~i~0_253) c_main_~a~0.offset) v_ArrVal_892) (+ c_main_~a~0.offset (* 8 v_main_~i~0_252)) v_ArrVal_894) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_895) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= (+ v_main_~i~0_262 1) v_main_~i~0_261)) (not (<= (+ v_main_~i~0_253 1) v_main_~i~0_252)) (not (<= 1 v_main_~i~0_253)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_263)))) is different from false [2022-01-31 12:02:02,152 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_263 Int) (v_main_~i~0_252 Int) (v_main_~i~0_253 Int) (v_main_~i~0_261 Int) (v_main_~i~0_262 Int) (v_main_~i~0_251 Int) (v_ArrVal_877 Int) (v_ArrVal_875 Int) (v_ArrVal_895 Int) (v_ArrVal_894 Int) (v_ArrVal_892 Int) (v_ArrVal_880 Int)) (or (not (<= (+ v_main_~i~0_263 1) v_main_~i~0_262)) (not (<= (+ v_main_~i~0_252 1) v_main_~i~0_251)) (not (<= (+ v_main_~i~0_262 1) v_main_~i~0_261)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_263)) (= (select (store (store (store (let ((.cse6 (store |c_#memory_int| c_main_~b~0.base (store (store (store (store (select |c_#memory_int| c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset) 1) (+ (* 4 v_main_~i~0_263) c_main_~b~0.offset) v_ArrVal_875) (+ (* 4 v_main_~i~0_262) c_main_~b~0.offset) v_ArrVal_877) (+ (* 4 v_main_~i~0_261) c_main_~b~0.offset) v_ArrVal_880)))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse7 |c_main_~#sum~0.offset|)) (.cse3 (select (select .cse6 c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 24)))) (let ((.cse0 (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5))))) (store (select .cse0 c_main_~a~0.base) c_main_~a~0.offset (+ (select (select .cse0 c_main_~b~0.base) c_main_~b~0.offset) .cse1 .cse2 .cse3 .cse4 .cse5))))))))) (+ (* 8 v_main_~i~0_253) c_main_~a~0.offset) v_ArrVal_892) (+ c_main_~a~0.offset (* 8 v_main_~i~0_252)) v_ArrVal_894) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_895) c_main_~a~0.offset) (+ c_~N~0 1)) (not (<= (+ v_main_~i~0_253 1) v_main_~i~0_252)) (not (<= 1 v_main_~i~0_253)))) is different from false