/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-cav19/array_init_pair_symmetr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 10:36:40,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 10:36:40,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 10:36:40,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 10:36:40,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 10:36:40,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 10:36:40,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 10:36:40,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 10:36:40,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 10:36:40,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 10:36:40,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 10:36:40,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 10:36:40,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 10:36:40,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 10:36:40,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 10:36:40,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 10:36:40,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 10:36:40,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 10:36:40,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 10:36:40,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 10:36:40,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 10:36:40,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 10:36:40,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 10:36:40,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 10:36:40,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 10:36:40,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 10:36:40,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 10:36:40,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 10:36:40,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 10:36:40,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 10:36:40,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 10:36:40,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 10:36:40,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 10:36:40,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 10:36:40,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 10:36:40,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 10:36:40,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 10:36:40,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 10:36:40,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 10:36:40,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 10:36:40,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 10:36:40,382 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 10:36:40,391 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 10:36:40,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 10:36:40,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 10:36:40,392 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 10:36:40,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 10:36:40,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 10:36:40,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 10:36:40,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 10:36:40,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 10:36:40,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 10:36:40,393 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 10:36:40,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 10:36:40,394 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 10:36:40,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 10:36:40,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 10:36:40,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 10:36:40,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 10:36:40,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 10:36:40,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 10:36:40,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 10:36:40,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 10:36:40,395 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 10:36:40,395 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 10:36:40,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 10:36:40,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 10:36:40,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 10:36:40,595 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 10:36:40,596 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 10:36:40,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-cav19/array_init_pair_symmetr.c [2022-01-31 10:36:40,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40387ae4f/5ef336ea657940f3825babbfe2e5e3a7/FLAG5147445cc [2022-01-31 10:36:40,924 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 10:36:40,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_pair_symmetr.c [2022-01-31 10:36:40,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40387ae4f/5ef336ea657940f3825babbfe2e5e3a7/FLAG5147445cc [2022-01-31 10:36:41,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40387ae4f/5ef336ea657940f3825babbfe2e5e3a7 [2022-01-31 10:36:41,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 10:36:41,378 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 10:36:41,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 10:36:41,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 10:36:41,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 10:36:41,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:36:41" (1/1) ... [2022-01-31 10:36:41,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dd14e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:36:41, skipping insertion in model container [2022-01-31 10:36:41,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:36:41" (1/1) ... [2022-01-31 10:36:41,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 10:36:41,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 10:36:41,549 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-cav19/array_init_pair_symmetr.c[414,427] [2022-01-31 10:36:41,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 10:36:41,568 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 10:36:41,576 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-cav19/array_init_pair_symmetr.c[414,427] [2022-01-31 10:36:41,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 10:36:41,588 INFO L208 MainTranslator]: Completed translation [2022-01-31 10:36:41,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:36:41 WrapperNode [2022-01-31 10:36:41,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 10:36:41,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 10:36:41,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 10:36:41,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 10:36:41,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:36:41" (1/1) ... [2022-01-31 10:36:41,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:36:41" (1/1) ... [2022-01-31 10:36:41,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:36:41" (1/1) ... [2022-01-31 10:36:41,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:36:41" (1/1) ... [2022-01-31 10:36:41,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:36:41" (1/1) ... [2022-01-31 10:36:41,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:36:41" (1/1) ... [2022-01-31 10:36:41,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:36:41" (1/1) ... [2022-01-31 10:36:41,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 10:36:41,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 10:36:41,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 10:36:41,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 10:36:41,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:36:41" (1/1) ... [2022-01-31 10:36:41,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 10:36:41,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:36:41,644 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 10:36:41,667 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 10:36:41,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 10:36:41,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 10:36:41,681 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 10:36:41,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 10:36:41,681 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 10:36:41,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 10:36:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 10:36:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 10:36:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 10:36:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 10:36:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 10:36:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 10:36:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 10:36:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 10:36:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 10:36:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 10:36:41,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 10:36:41,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 10:36:41,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 10:36:41,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 10:36:41,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 10:36:41,743 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 10:36:41,749 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 10:36:41,877 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 10:36:41,881 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 10:36:41,881 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 10:36:41,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:36:41 BoogieIcfgContainer [2022-01-31 10:36:41,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 10:36:41,883 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 10:36:41,883 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 10:36:41,884 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 10:36:41,886 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:36:41" (1/1) ... [2022-01-31 10:36:41,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 10:36:41 BasicIcfg [2022-01-31 10:36:41,897 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 10:36:41,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 10:36:41,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 10:36:41,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 10:36:41,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 10:36:41" (1/4) ... [2022-01-31 10:36:41,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0053c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:36:41, skipping insertion in model container [2022-01-31 10:36:41,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:36:41" (2/4) ... [2022-01-31 10:36:41,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0053c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:36:41, skipping insertion in model container [2022-01-31 10:36:41,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:36:41" (3/4) ... [2022-01-31 10:36:41,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0053c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 10:36:41, skipping insertion in model container [2022-01-31 10:36:41,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 10:36:41" (4/4) ... [2022-01-31 10:36:41,903 INFO L111 eAbstractionObserver]: Analyzing ICFG array_init_pair_symmetr.cJordan [2022-01-31 10:36:41,906 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 10:36:41,906 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 10:36:41,937 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 10:36:41,943 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 10:36:41,943 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 10:36:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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 10:36:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 10:36:41,962 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:36:41,963 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:36:41,973 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:36:41,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:36:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2126156447, now seen corresponding path program 1 times [2022-01-31 10:36:41,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:36:41,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361093375] [2022-01-31 10:36:41,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:36:41,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:36:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:42,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:36:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:42,208 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 10:36:42,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:36:42,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361093375] [2022-01-31 10:36:42,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361093375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 10:36:42,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 10:36:42,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 10:36:42,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078064073] [2022-01-31 10:36:42,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 10:36:42,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 10:36:42,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:36:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 10:36:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 10:36:42,240 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 10:36:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:36:42,272 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-01-31 10:36:42,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 10:36:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 10:36:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:36:42,291 INFO L225 Difference]: With dead ends: 33 [2022-01-31 10:36:42,291 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 10:36:42,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 10:36:42,302 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 10:36:42,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 10:36:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 10:36:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-31 10:36:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 10:36:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-01-31 10:36:42,325 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 15 [2022-01-31 10:36:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:36:42,325 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-01-31 10:36:42,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 10:36:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-01-31 10:36:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 10:36:42,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:36:42,326 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:36:42,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 10:36:42,327 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:36:42,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:36:42,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1248860067, now seen corresponding path program 1 times [2022-01-31 10:36:42,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:36:42,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196503611] [2022-01-31 10:36:42,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:36:42,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:36:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:42,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:36:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:42,427 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 10:36:42,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:36:42,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196503611] [2022-01-31 10:36:42,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196503611] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 10:36:42,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 10:36:42,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 10:36:42,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068756815] [2022-01-31 10:36:42,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 10:36:42,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 10:36:42,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:36:42,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 10:36:42,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 10:36:42,430 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 10:36:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:36:42,519 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-01-31 10:36:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 10:36:42,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 10:36:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:36:42,522 INFO L225 Difference]: With dead ends: 34 [2022-01-31 10:36:42,522 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 10:36:42,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 10:36:42,523 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:36:42,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 22 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:36:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 10:36:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-01-31 10:36:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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 10:36:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-01-31 10:36:42,530 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 15 [2022-01-31 10:36:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:36:42,530 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-01-31 10:36:42,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 10:36:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-01-31 10:36:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 10:36:42,531 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:36:42,531 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] [2022-01-31 10:36:42,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 10:36:42,531 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:36:42,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:36:42,532 INFO L85 PathProgramCache]: Analyzing trace with hash 359169415, now seen corresponding path program 1 times [2022-01-31 10:36:42,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:36:42,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053535583] [2022-01-31 10:36:42,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:36:42,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:36:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:42,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:36:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:42,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 10:36:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 10:36:42,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:36:42,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053535583] [2022-01-31 10:36:42,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053535583] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:36:42,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672553026] [2022-01-31 10:36:42,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:36:42,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:36:42,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:36:42,723 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 10:36:42,727 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 10:36:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:42,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-31 10:36:42,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:36:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 10:36:42,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:36:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 10:36:42,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672553026] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:36:42,965 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:36:42,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-01-31 10:36:42,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474917574] [2022-01-31 10:36:42,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:36:42,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 10:36:42,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:36:42,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 10:36:42,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-31 10:36:42,967 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 7 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 10:36:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:36:43,163 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-01-31 10:36:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 10:36:43,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 7 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 25 [2022-01-31 10:36:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:36:43,164 INFO L225 Difference]: With dead ends: 57 [2022-01-31 10:36:43,164 INFO L226 Difference]: Without dead ends: 57 [2022-01-31 10:36:43,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-01-31 10:36:43,166 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 99 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:36:43,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 24 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:36:43,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-01-31 10:36:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2022-01-31 10:36:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 10:36:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-01-31 10:36:43,170 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 25 [2022-01-31 10:36:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:36:43,171 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-01-31 10:36:43,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 7 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 10:36:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-01-31 10:36:43,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 10:36:43,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:36:43,172 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:36:43,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 10:36:43,388 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 10:36:43,392 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:36:43,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:36:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1902312755, now seen corresponding path program 2 times [2022-01-31 10:36:43,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:36:43,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776095961] [2022-01-31 10:36:43,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:36:43,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:36:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:43,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:36:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 10:36:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:43,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 10:36:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:43,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 10:36:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:43,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 10:36:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-31 10:36:43,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:36:43,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776095961] [2022-01-31 10:36:43,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776095961] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:36:43,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770374581] [2022-01-31 10:36:43,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:36:43,532 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:36:43,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:36:43,534 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 10:36:43,535 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 10:36:43,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:36:43,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:36:43,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 10:36:43,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:36:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-31 10:36:43,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:36:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-31 10:36:43,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770374581] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:36:43,954 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:36:43,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-01-31 10:36:43,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42344990] [2022-01-31 10:36:43,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:36:43,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 10:36:43,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:36:43,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 10:36:43,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-01-31 10:36:43,956 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 19 states have internal predecessors, (62), 16 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-01-31 10:36:44,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:36:44,327 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2022-01-31 10:36:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 10:36:44,328 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 19 states have internal predecessors, (62), 16 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Word has length 55 [2022-01-31 10:36:44,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:36:44,329 INFO L225 Difference]: With dead ends: 117 [2022-01-31 10:36:44,329 INFO L226 Difference]: Without dead ends: 117 [2022-01-31 10:36:44,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2022-01-31 10:36:44,330 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 243 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 10:36:44,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 26 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 10:36:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-01-31 10:36:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 84. [2022-01-31 10:36:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-31 10:36:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2022-01-31 10:36:44,337 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 55 [2022-01-31 10:36:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:36:44,338 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2022-01-31 10:36:44,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 19 states have internal predecessors, (62), 16 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-01-31 10:36:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2022-01-31 10:36:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-31 10:36:44,340 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:36:44,340 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:36:44,359 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 10:36:44,559 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 10:36:44,559 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:36:44,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:36:44,560 INFO L85 PathProgramCache]: Analyzing trace with hash 193354635, now seen corresponding path program 3 times [2022-01-31 10:36:44,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:36:44,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471625014] [2022-01-31 10:36:44,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:36:44,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:36:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:36:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:44,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 10:36:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:44,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 10:36:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:44,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 10:36:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:44,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 10:36:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:44,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 10:36:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 10:36:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 10:36:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 10:36:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:44,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 10:36:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:44,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 10:36:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-01-31 10:36:44,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:36:44,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471625014] [2022-01-31 10:36:44,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471625014] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:36:44,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342485109] [2022-01-31 10:36:44,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:36:44,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:36:44,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:36:44,879 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 10:36:44,880 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 10:36:48,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-01-31 10:36:48,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:36:48,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 10:36:48,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:36:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-01-31 10:36:48,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:36:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-01-31 10:36:48,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342485109] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:36:48,927 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:36:48,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 38 [2022-01-31 10:36:48,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937214354] [2022-01-31 10:36:48,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:36:48,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 10:36:48,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:36:48,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 10:36:48,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=825, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 10:36:48,929 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 37 states have internal predecessors, (106), 14 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-01-31 10:36:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:36:49,502 INFO L93 Difference]: Finished difference Result 237 states and 280 transitions. [2022-01-31 10:36:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 10:36:49,502 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 37 states have internal predecessors, (106), 14 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-01-31 10:36:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:36:49,503 INFO L225 Difference]: With dead ends: 237 [2022-01-31 10:36:49,504 INFO L226 Difference]: Without dead ends: 237 [2022-01-31 10:36:49,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1268, Invalid=2392, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 10:36:49,505 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 550 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:36:49,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [550 Valid, 26 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 10:36:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-01-31 10:36:49,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 156. [2022-01-31 10:36:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 127 states have (on average 1.0236220472440944) internal successors, (130), 127 states have internal predecessors, (130), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-01-31 10:36:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2022-01-31 10:36:49,523 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 115 [2022-01-31 10:36:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:36:49,523 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2022-01-31 10:36:49,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 37 states have internal predecessors, (106), 14 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-01-31 10:36:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2022-01-31 10:36:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-01-31 10:36:49,525 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:36:49,525 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:36:49,553 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 10:36:49,725 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 10:36:49,726 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:36:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:36:49,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1778936773, now seen corresponding path program 4 times [2022-01-31 10:36:49,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:36:49,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352742894] [2022-01-31 10:36:49,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:36:49,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:36:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:36:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 10:36:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 10:36:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 10:36:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 10:36:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 10:36:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 10:36:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 10:36:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 10:36:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 10:36:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 10:36:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-31 10:36:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 10:36:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 10:36:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-31 10:36:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-31 10:36:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-31 10:36:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-01-31 10:36:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-01-31 10:36:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-01-31 10:36:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-01-31 10:36:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-01-31 10:36:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-01-31 10:36:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 1408 trivial. 0 not checked. [2022-01-31 10:36:50,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:36:50,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352742894] [2022-01-31 10:36:50,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352742894] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:36:50,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820807185] [2022-01-31 10:36:50,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:36:50,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:36:50,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:36:50,231 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 10:36:50,259 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 10:36:50,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:36:50,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:36:50,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 278 conjunts are in the unsatisfiable core [2022-01-31 10:36:50,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:36:50,598 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 10:36:50,599 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 10:36:50,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:36:50,698 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-01-31 10:36:50,701 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-31 10:36:50,704 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 24 treesize of output 24 [2022-01-31 10:36:50,909 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:50,909 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:51,079 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:51,079 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:51,256 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:51,257 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:51,443 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:51,443 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:51,664 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:51,665 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:51,834 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:51,834 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:51,998 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:51,999 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:52,190 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:52,190 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:52,382 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:52,382 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:52,551 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:52,551 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:52,733 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:52,734 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:52,912 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:52,912 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:53,098 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:53,098 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:53,275 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:53,275 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:53,452 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:53,453 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:53,609 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:53,609 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:53,778 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:53,779 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:54,177 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:54,178 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:54,383 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:54,384 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:54,601 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:36:54,601 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 10:36:54,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2022-01-31 10:36:54,722 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 55 treesize of output 41 [2022-01-31 10:36:54,866 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:54,866 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 42 treesize of output 47 [2022-01-31 10:36:55,013 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:55,014 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 42 treesize of output 47 [2022-01-31 10:36:55,121 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:55,122 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 42 treesize of output 47 [2022-01-31 10:36:55,233 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:55,233 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 42 treesize of output 47 [2022-01-31 10:36:55,344 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:55,345 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 42 treesize of output 47 [2022-01-31 10:36:55,491 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:55,491 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 42 treesize of output 47 [2022-01-31 10:36:55,624 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:55,624 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 42 treesize of output 47 [2022-01-31 10:36:55,774 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:55,775 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 42 treesize of output 47 [2022-01-31 10:36:55,934 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:55,934 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 42 treesize of output 47 [2022-01-31 10:36:56,044 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:56,045 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 42 treesize of output 47 [2022-01-31 10:36:56,161 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:56,161 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 42 treesize of output 47 [2022-01-31 10:36:56,275 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:56,275 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 42 treesize of output 47 [2022-01-31 10:36:56,389 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:56,389 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 42 treesize of output 47 [2022-01-31 10:36:56,553 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:56,553 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 42 treesize of output 47 [2022-01-31 10:36:56,669 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:56,669 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 42 treesize of output 47 [2022-01-31 10:36:56,842 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:56,842 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 42 treesize of output 47 [2022-01-31 10:36:57,026 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:57,027 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 42 treesize of output 47 [2022-01-31 10:36:57,133 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:57,133 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 42 treesize of output 47 [2022-01-31 10:36:57,235 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:57,236 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 42 treesize of output 47 [2022-01-31 10:36:57,333 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:36:57,334 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 42 treesize of output 47 [2022-01-31 10:36:57,481 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 36 treesize of output 12 [2022-01-31 10:36:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 1262 proven. 328 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-01-31 10:36:57,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:37:05,638 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_117 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_117)) (forall ((v_ArrVal_853 Int)) (= (select (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0)))) is different from false [2022-01-31 10:37:23,589 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_118 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_118)) (forall ((v_ArrVal_852 Int) (v_main_~i~0_117 Int) (v_ArrVal_853 Int)) (or (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (= (select (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0))))) is different from false [2022-01-31 10:37:25,627 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_ArrVal_853 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_118)) (= (select (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)))) is different from false [2022-01-31 10:37:27,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_119 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_119)) (forall ((v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_ArrVal_853 Int)) (or (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (= (select (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0))))) is different from false [2022-01-31 10:37:29,754 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_ArrVal_847 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_ArrVal_853 Int)) (or (= 0 (select (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)))) is different from false [2022-01-31 10:37:31,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_120 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_120)) (forall ((v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_ArrVal_847 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_ArrVal_853 Int)) (or (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (= 0 (select (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4))))))) is different from false [2022-01-31 10:37:33,970 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_120 Int) (v_ArrVal_847 Int) (v_main_~i~0_119 Int) (v_ArrVal_845 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_ArrVal_853 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_120)) (= (select (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)))) is different from false [2022-01-31 10:37:36,098 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_121 Int)) (or (forall ((v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_120 Int) (v_ArrVal_847 Int) (v_main_~i~0_119 Int) (v_ArrVal_845 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_ArrVal_853 Int)) (or (= (select (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:37:38,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_847 Int) (v_main_~i~0_119 Int) (v_ArrVal_845 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_ArrVal_843 Int) (v_ArrVal_853 Int)) (or (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_121)) (= (select (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)))) is different from false [2022-01-31 10:37:40,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_122 Int)) (or (forall ((v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_847 Int) (v_main_~i~0_119 Int) (v_ArrVal_845 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_ArrVal_843 Int) (v_ArrVal_853 Int)) (or (= (select (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_122)))) is different from false [2022-01-31 10:37:42,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_122 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_853 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_122)) (= (select (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:37:44,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_123 Int)) (or (forall ((v_main_~i~0_122 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_853 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int)) (or (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)) (= (select (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_123)))) is different from false [2022-01-31 10:37:46,818 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_853 Int) (v_ArrVal_852 Int) (v_ArrVal_840 Int) (v_ArrVal_850 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int)) (or (= (select (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:37:49,165 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_124 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_124)) (forall ((v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_853 Int) (v_ArrVal_852 Int) (v_ArrVal_840 Int) (v_ArrVal_850 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int)) (or (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)) (= (select (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0))))) is different from false [2022-01-31 10:37:51,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_124 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_837 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_853 Int) (v_ArrVal_852 Int) (v_ArrVal_840 Int) (v_ArrVal_850 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (= (select (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:37:53,639 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_125 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_125)) (forall ((v_main_~i~0_124 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_837 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_853 Int) (v_ArrVal_852 Int) (v_ArrVal_840 Int) (v_ArrVal_850 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int)) (or (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (= (select (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))))) is different from false [2022-01-31 10:37:55,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_837 Int) (v_ArrVal_847 Int) (v_ArrVal_835 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_853 Int) (v_ArrVal_852 Int) (v_ArrVal_840 Int) (v_ArrVal_850 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_125)) (= (select (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:37:58,218 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_126 Int)) (or (forall ((v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_837 Int) (v_ArrVal_847 Int) (v_ArrVal_835 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_853 Int) (v_ArrVal_852 Int) (v_ArrVal_840 Int) (v_ArrVal_850 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int)) (or (= 0 (select (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4))) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_126)))) is different from false [2022-01-31 10:38:00,444 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_837 Int) (v_ArrVal_847 Int) (v_ArrVal_835 Int) (v_ArrVal_845 Int) (v_ArrVal_833 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_853 Int) (v_ArrVal_852 Int) (v_ArrVal_840 Int) (v_ArrVal_850 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_126 Int)) (or (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (= (select (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:38:02,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_127 Int)) (or (forall ((v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_837 Int) (v_ArrVal_847 Int) (v_ArrVal_835 Int) (v_ArrVal_845 Int) (v_ArrVal_833 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_853 Int) (v_ArrVal_852 Int) (v_ArrVal_840 Int) (v_ArrVal_850 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_126 Int)) (or (= (select (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_127)))) is different from false [2022-01-31 10:38:05,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_837 Int) (v_ArrVal_847 Int) (v_ArrVal_835 Int) (v_ArrVal_845 Int) (v_ArrVal_833 Int) (v_ArrVal_843 Int) (v_ArrVal_831 Int) (v_ArrVal_842 Int) (v_ArrVal_853 Int) (v_ArrVal_852 Int) (v_ArrVal_840 Int) (v_ArrVal_850 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (= (select (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:38:07,617 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_128 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_128)) (forall ((v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_837 Int) (v_ArrVal_847 Int) (v_ArrVal_835 Int) (v_ArrVal_845 Int) (v_ArrVal_833 Int) (v_ArrVal_843 Int) (v_ArrVal_831 Int) (v_ArrVal_842 Int) (v_ArrVal_853 Int) (v_ArrVal_852 Int) (v_ArrVal_840 Int) (v_ArrVal_850 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))))) is different from false [2022-01-31 10:38:09,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_128)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:38:12,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_129 Int)) (or (forall ((v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_129)))) is different from false [2022-01-31 10:38:14,738 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:38:17,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_130 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_130)) (forall ((v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0))))) is different from false [2022-01-31 10:38:19,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_130 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_825) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:38:22,421 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_131 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_131)) (forall ((v_main_~i~0_130 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))))) is different from false [2022-01-31 10:38:24,832 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_131 Int) (v_main_~i~0_130 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_823) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_131)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:38:27,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_132 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_132)) (forall ((v_main_~i~0_131 Int) (v_main_~i~0_130 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* 4 v_main_~i~0_132) |c_main_~#c~0.offset|) v_ArrVal_823) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))))) is different from false [2022-01-31 10:38:29,962 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_main_~i~0_130 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_821 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_821) (+ (* 4 v_main_~i~0_132) |c_main_~#c~0.offset|) v_ArrVal_823) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_132)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:38:32,714 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_133 Int)) (or (forall ((v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_main_~i~0_130 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_821 Int) (v_ArrVal_843 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_133)) v_ArrVal_821) (+ (* 4 v_main_~i~0_132) |c_main_~#c~0.offset|) v_ArrVal_823) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_133 1) v_main_~i~0_132)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_133)))) is different from false [2022-01-31 10:38:35,199 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_133 Int) (v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_main_~i~0_130 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_821 Int) (v_ArrVal_843 Int) (v_ArrVal_820 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_820) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_133)) v_ArrVal_821) (+ (* 4 v_main_~i~0_132) |c_main_~#c~0.offset|) v_ArrVal_823) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_133 1) v_main_~i~0_132)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_133)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:38:38,173 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_134 Int)) (or (forall ((v_main_~i~0_133 Int) (v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_main_~i~0_130 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_821 Int) (v_ArrVal_843 Int) (v_ArrVal_820 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_134 1) v_main_~i~0_133)) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_133 1) v_main_~i~0_132)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_134)) v_ArrVal_820) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_133)) v_ArrVal_821) (+ (* 4 v_main_~i~0_132) |c_main_~#c~0.offset|) v_ArrVal_823) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_134)))) is different from false [2022-01-31 10:38:40,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_133 Int) (v_main_~i~0_134 Int) (v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_ArrVal_818 Int) (v_main_~i~0_130 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_821 Int) (v_ArrVal_843 Int) (v_ArrVal_820 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_134 1) v_main_~i~0_133)) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_818) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_134)) v_ArrVal_820) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_133)) v_ArrVal_821) (+ (* 4 v_main_~i~0_132) |c_main_~#c~0.offset|) v_ArrVal_823) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_134)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_133 1) v_main_~i~0_132)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:38:43,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int)) (or (forall ((v_main_~i~0_133 Int) (v_main_~i~0_134 Int) (v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_ArrVal_818 Int) (v_main_~i~0_130 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_821 Int) (v_ArrVal_843 Int) (v_ArrVal_820 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_134 1) v_main_~i~0_133)) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_135)) v_ArrVal_818) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_134)) v_ArrVal_820) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_133)) v_ArrVal_821) (+ (* 4 v_main_~i~0_132) |c_main_~#c~0.offset|) v_ArrVal_823) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_133 1) v_main_~i~0_132)) (not (<= (+ v_main_~i~0_135 1) v_main_~i~0_134)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_135)))) is different from false [2022-01-31 10:38:46,330 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_main_~i~0_133 Int) (v_main_~i~0_134 Int) (v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_ArrVal_818 Int) (v_main_~i~0_130 Int) (v_ArrVal_815 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_821 Int) (v_ArrVal_843 Int) (v_ArrVal_820 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_134 1) v_main_~i~0_133)) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ (* c_main_~i~0 4) |c_main_~#c~0.offset|) v_ArrVal_815) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_135)) v_ArrVal_818) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_134)) v_ArrVal_820) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_133)) v_ArrVal_821) (+ (* 4 v_main_~i~0_132) |c_main_~#c~0.offset|) v_ArrVal_823) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_135)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_133 1) v_main_~i~0_132)) (not (<= (+ v_main_~i~0_135 1) v_main_~i~0_134)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:38:49,559 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_136 Int)) (or (forall ((v_main_~i~0_135 Int) (v_main_~i~0_133 Int) (v_main_~i~0_134 Int) (v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_ArrVal_818 Int) (v_main_~i~0_130 Int) (v_ArrVal_815 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_821 Int) (v_ArrVal_843 Int) (v_ArrVal_820 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_134 1) v_main_~i~0_133)) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_136 1) v_main_~i~0_135)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_136)) v_ArrVal_815) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_135)) v_ArrVal_818) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_134)) v_ArrVal_820) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_133)) v_ArrVal_821) (+ (* 4 v_main_~i~0_132) |c_main_~#c~0.offset|) v_ArrVal_823) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |c_main_~#c~0.offset|) v_ArrVal_852) (+ |c_main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |c_main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_133 1) v_main_~i~0_132)) (not (<= (+ v_main_~i~0_135 1) v_main_~i~0_134)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_136)))) is different from false [2022-01-31 10:38:52,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_main_~i~0_136 Int) (v_main_~i~0_133 Int) (v_main_~i~0_134 Int) (v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_ArrVal_818 Int) (v_main_~i~0_130 Int) (v_ArrVal_815 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (|main_~#c~0.offset| Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_821 Int) (v_ArrVal_843 Int) (v_ArrVal_820 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_134 1) v_main_~i~0_133)) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_136 1) v_main_~i~0_135)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_133 1) v_main_~i~0_132)) (not (<= (+ v_main_~i~0_135 1) v_main_~i~0_134)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_136)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse0 (* c_main_~i~0 4))) (store (select |c_#memory_int| |c_main_~#c~0.base|) (+ .cse0 |main_~#c~0.offset|) (+ (select (select |c_#memory_int| |c_main_~#a~0.base|) (+ .cse0 |c_main_~#a~0.offset|)) (select (select |c_#memory_int| |c_main_~#b~0.base|) (+ .cse0 |c_main_~#b~0.offset|))))) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_136)) v_ArrVal_815) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_135)) v_ArrVal_818) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_134)) v_ArrVal_820) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_133)) v_ArrVal_821) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_132)) v_ArrVal_823) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |main_~#c~0.offset|) v_ArrVal_852) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:40:10,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_main_~i~0_136 Int) (v_main_~i~0_133 Int) (v_main_~i~0_134 Int) (v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_ArrVal_818 Int) (v_main_~i~0_130 Int) (v_ArrVal_815 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (|main_~#c~0.offset| Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_821 Int) (v_ArrVal_843 Int) (v_ArrVal_820 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_134 1) v_main_~i~0_133)) (not (<= (+ c_main_~i~0 2) v_main_~i~0_136)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse0 (* c_main_~i~0 4))) (store v_ArrVal_812 (+ .cse0 |main_~#c~0.offset| 4) (let ((.cse1 (store |c_#memory_int| |c_main_~#c~0.base| v_ArrVal_812))) (+ (select (select .cse1 |c_main_~#b~0.base|) (+ .cse0 |c_main_~#b~0.offset| 4)) (select (select .cse1 |c_main_~#a~0.base|) (+ .cse0 4 |c_main_~#a~0.offset|)))))) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_136)) v_ArrVal_815) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_135)) v_ArrVal_818) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_134)) v_ArrVal_820) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_133)) v_ArrVal_821) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_132)) v_ArrVal_823) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |main_~#c~0.offset|) v_ArrVal_852) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) (+ |main_~#c~0.offset| 4)) 0) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_136 1) v_main_~i~0_135)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_133 1) v_main_~i~0_132)) (not (<= (+ v_main_~i~0_135 1) v_main_~i~0_134)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)))) is different from false [2022-01-31 10:40:10,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_main_~i~0_136 Int) (v_main_~i~0_133 Int) (v_main_~i~0_134 Int) (v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_ArrVal_818 Int) (v_main_~i~0_130 Int) (v_ArrVal_815 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (|main_~#c~0.offset| Int) (v_main_~i~0_123 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_821 Int) (v_ArrVal_843 Int) (v_ArrVal_820 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_134 1) v_main_~i~0_133)) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_136 1) v_main_~i~0_135)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (= 0 (let ((.cse0 (+ |main_~#c~0.offset| 4))) (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store v_ArrVal_812 .cse0 (let ((.cse1 (store |c_#memory_int| |c_main_~#c~0.base| v_ArrVal_812))) (+ (select (select .cse1 |c_main_~#b~0.base|) (+ |c_main_~#b~0.offset| 4)) (select (select .cse1 |c_main_~#a~0.base|) (+ 4 |c_main_~#a~0.offset|))))) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_136)) v_ArrVal_815) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_135)) v_ArrVal_818) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_134)) v_ArrVal_820) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_133)) v_ArrVal_821) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_132)) v_ArrVal_823) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |main_~#c~0.offset|) v_ArrVal_852) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) .cse0))) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_133 1) v_main_~i~0_132)) (not (<= (+ v_main_~i~0_135 1) v_main_~i~0_134)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)) (not (<= 2 v_main_~i~0_136)))) is different from false [2022-01-31 10:40:13,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_main_~i~0_136 Int) (v_main_~i~0_133 Int) (v_main_~i~0_134 Int) (v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_ArrVal_818 Int) (v_main_~i~0_130 Int) (v_ArrVal_815 Int) (v_ArrVal_837 Int) (v_ArrVal_835 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int) (v_ArrVal_853 Int) (v_ArrVal_840 Int) (v_main_~i~0_119 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_124 Int) (v_main_~i~0_125 Int) (v_main_~i~0_122 Int) (|main_~#c~0.offset| Int) (v_main_~i~0_123 Int) (v_ArrVal_809 Int) (v_main_~i~0_120 Int) (v_main_~i~0_121 Int) (v_ArrVal_828 Int) (v_ArrVal_825 Int) (v_ArrVal_847 Int) (v_ArrVal_823 Int) (v_ArrVal_845 Int) (v_ArrVal_821 Int) (v_ArrVal_843 Int) (v_ArrVal_820 Int) (v_ArrVal_842 Int) (v_ArrVal_830 Int) (v_ArrVal_852 Int) (main_~x~0 Int) (v_ArrVal_812 (Array Int Int)) (v_ArrVal_850 Int) (v_main_~i~0_128 Int) (v_main_~i~0_129 Int) (v_main_~i~0_126 Int) (v_main_~i~0_127 Int)) (or (not (<= (+ v_main_~i~0_134 1) v_main_~i~0_133)) (not (<= (+ v_main_~i~0_127 1) v_main_~i~0_126)) (not (<= (+ v_main_~i~0_136 1) v_main_~i~0_135)) (not (<= (+ v_main_~i~0_129 1) v_main_~i~0_128)) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ v_main_~i~0_130 1) v_main_~i~0_129)) (not (<= (+ v_main_~i~0_131 1) v_main_~i~0_130)) (not (<= (+ v_main_~i~0_124 1) v_main_~i~0_123)) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= (+ v_main_~i~0_133 1) v_main_~i~0_132)) (= (let ((.cse0 (+ |main_~#c~0.offset| 4))) (select (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store v_ArrVal_812 .cse0 (let ((.cse1 (store (let ((.cse3 (* c_main_~i~0 4))) (let ((.cse2 (store |c_#memory_int| |c_main_~#a~0.base| (store (select |c_#memory_int| |c_main_~#a~0.base|) (+ .cse3 |c_main_~#a~0.offset|) main_~x~0)))) (store .cse2 |c_main_~#b~0.base| (store (select .cse2 |c_main_~#b~0.base|) (+ .cse3 |c_main_~#b~0.offset|) v_ArrVal_809)))) |c_main_~#c~0.base| v_ArrVal_812))) (+ (select (select .cse1 |c_main_~#b~0.base|) (+ |c_main_~#b~0.offset| 4)) (select (select .cse1 |c_main_~#a~0.base|) (+ 4 |c_main_~#a~0.offset|))))) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_136)) v_ArrVal_815) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_135)) v_ArrVal_818) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_134)) v_ArrVal_820) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_133)) v_ArrVal_821) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_132)) v_ArrVal_823) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_131)) v_ArrVal_825) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_130)) v_ArrVal_828) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_129)) v_ArrVal_830) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_128)) v_ArrVal_831) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_127)) v_ArrVal_833) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_126)) v_ArrVal_835) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_125)) v_ArrVal_837) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_124)) v_ArrVal_840) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_123)) v_ArrVal_842) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_122)) v_ArrVal_843) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_121)) v_ArrVal_845) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_120)) v_ArrVal_847) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_119)) v_ArrVal_850) (+ (* 4 v_main_~i~0_118) |main_~#c~0.offset|) v_ArrVal_852) (+ |main_~#c~0.offset| (* 4 v_main_~i~0_117)) v_ArrVal_853) .cse0)) 0) (not (<= (+ v_main_~i~0_135 1) v_main_~i~0_134)) (not (<= (+ v_main_~i~0_119 1) v_main_~i~0_118)) (not (<= (+ v_main_~i~0_126 1) v_main_~i~0_125)) (not (<= (+ v_main_~i~0_123 1) v_main_~i~0_122)) (not (<= (+ v_main_~i~0_128 1) v_main_~i~0_127)) (not (<= (+ v_main_~i~0_121 1) v_main_~i~0_120)) (not (<= (+ v_main_~i~0_120 1) v_main_~i~0_119)) (not (<= (+ v_main_~i~0_125 1) v_main_~i~0_124)) (not (<= (+ v_main_~i~0_122 1) v_main_~i~0_121)) (not (<= 2 v_main_~i~0_136)))) is different from false [2022-01-31 10:40:13,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820807185] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:40:13,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:40:13,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 53] total 78 [2022-01-31 10:40:13,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174338901] [2022-01-31 10:40:13,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:40:13,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-01-31 10:40:13,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:40:13,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-01-31 10:40:13,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=5828, Unknown=108, NotChecked=8526, Total=15500 [2022-01-31 10:40:13,789 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand has 78 states, 77 states have (on average 2.6623376623376624) internal successors, (205), 76 states have internal predecessors, (205), 48 states have call successors, (50), 6 states have call predecessors, (50), 3 states have return successors, (46), 46 states have call predecessors, (46), 45 states have call successors, (46) [2022-01-31 10:40:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:40:39,091 INFO L93 Difference]: Finished difference Result 253 states and 295 transitions. [2022-01-31 10:40:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-01-31 10:40:39,092 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 2.6623376623376624) internal successors, (205), 76 states have internal predecessors, (205), 48 states have call successors, (50), 6 states have call predecessors, (50), 3 states have return successors, (46), 46 states have call predecessors, (46), 45 states have call successors, (46) Word has length 235 [2022-01-31 10:40:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:40:39,094 INFO L225 Difference]: With dead ends: 253 [2022-01-31 10:40:39,094 INFO L226 Difference]: Without dead ends: 253 [2022-01-31 10:40:39,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 228 SyntacticMatches, 56 SemanticMatches, 218 ConstructedPredicates, 42 IntricatePredicates, 0 DeprecatedPredicates, 11602 ImplicationChecksByTransitivity, 204.4s TimeCoverageRelationStatistics Valid=4243, Invalid=27314, Unknown=117, NotChecked=16506, Total=48180 [2022-01-31 10:40:39,108 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 188 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 3034 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 4104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 3034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 732 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 10:40:39,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 139 Invalid, 4104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 3034 Invalid, 0 Unknown, 732 Unchecked, 1.5s Time] [2022-01-31 10:40:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-01-31 10:40:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 175. [2022-01-31 10:40:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 140 states have (on average 1.0214285714285714) internal successors, (143), 142 states have internal predecessors, (143), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2022-01-31 10:40:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2022-01-31 10:40:39,127 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 235 [2022-01-31 10:40:39,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:40:39,127 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2022-01-31 10:40:39,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 2.6623376623376624) internal successors, (205), 76 states have internal predecessors, (205), 48 states have call successors, (50), 6 states have call predecessors, (50), 3 states have return successors, (46), 46 states have call predecessors, (46), 45 states have call successors, (46) [2022-01-31 10:40:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2022-01-31 10:40:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-01-31 10:40:39,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:40:39,130 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:40:39,157 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 10:40:39,358 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 10:40:39,358 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:40:39,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:40:39,359 INFO L85 PathProgramCache]: Analyzing trace with hash 89419415, now seen corresponding path program 1 times [2022-01-31 10:40:39,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:40:39,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173878007] [2022-01-31 10:40:39,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:40:39,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:40:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:40:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 10:40:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 10:40:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 10:40:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 10:40:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 10:40:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 10:40:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 10:40:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 10:40:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 10:40:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 10:40:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-31 10:40:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 10:40:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 10:40:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-31 10:40:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-31 10:40:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-31 10:40:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-01-31 10:40:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-01-31 10:40:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-01-31 10:40:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-01-31 10:40:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-01-31 10:40:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-01-31 10:40:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-01-31 10:40:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-01-31 10:40:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 2 proven. 1035 refuted. 0 times theorem prover too weak. 1498 trivial. 0 not checked. [2022-01-31 10:40:39,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:40:39,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173878007] [2022-01-31 10:40:39,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173878007] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:40:39,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358674072] [2022-01-31 10:40:39,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:40:39,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:40:39,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:40:39,844 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 10:40:39,877 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 10:40:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:40,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-31 10:40:40,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:40:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2022-01-31 10:40:40,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:40:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 2 proven. 1035 refuted. 0 times theorem prover too weak. 1498 trivial. 0 not checked. [2022-01-31 10:40:41,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358674072] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:40:41,823 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:40:41,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 77 [2022-01-31 10:40:41,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268587610] [2022-01-31 10:40:41,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:40:41,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-01-31 10:40:41,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:40:41,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-01-31 10:40:41,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2505, Invalid=3347, Unknown=0, NotChecked=0, Total=5852 [2022-01-31 10:40:41,826 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand has 77 states, 77 states have (on average 3.116883116883117) internal successors, (240), 76 states have internal predecessors, (240), 73 states have call successors, (75), 5 states have call predecessors, (75), 4 states have return successors, (73), 72 states have call predecessors, (73), 71 states have call successors, (73) [2022-01-31 10:40:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:40:44,106 INFO L93 Difference]: Finished difference Result 509 states and 601 transitions. [2022-01-31 10:40:44,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-31 10:40:44,107 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 3.116883116883117) internal successors, (240), 76 states have internal predecessors, (240), 73 states have call successors, (75), 5 states have call predecessors, (75), 4 states have return successors, (73), 72 states have call predecessors, (73), 71 states have call successors, (73) Word has length 251 [2022-01-31 10:40:44,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:40:44,109 INFO L225 Difference]: With dead ends: 509 [2022-01-31 10:40:44,109 INFO L226 Difference]: Without dead ends: 509 [2022-01-31 10:40:44,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4699 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5402, Invalid=10348, Unknown=0, NotChecked=0, Total=15750 [2022-01-31 10:40:44,111 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 1092 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 1266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1266 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:40:44,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1092 Valid, 27 Invalid, 2319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1266 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 10:40:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-01-31 10:40:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 326. [2022-01-31 10:40:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 267 states have (on average 1.0112359550561798) internal successors, (270), 268 states have internal predecessors, (270), 52 states have call successors, (52), 7 states have call predecessors, (52), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-01-31 10:40:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 373 transitions. [2022-01-31 10:40:44,126 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 373 transitions. Word has length 251 [2022-01-31 10:40:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:40:44,127 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 373 transitions. [2022-01-31 10:40:44,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 3.116883116883117) internal successors, (240), 76 states have internal predecessors, (240), 73 states have call successors, (75), 5 states have call predecessors, (75), 4 states have return successors, (73), 72 states have call predecessors, (73), 71 states have call successors, (73) [2022-01-31 10:40:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 373 transitions. [2022-01-31 10:40:44,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2022-01-31 10:40:44,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:40:44,135 INFO L514 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:40:44,158 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 10:40:44,335 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 10:40:44,336 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:40:44,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:40:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash -635137481, now seen corresponding path program 2 times [2022-01-31 10:40:44,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:40:44,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951948376] [2022-01-31 10:40:44,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:40:44,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:40:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:40:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 10:40:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 10:40:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 10:40:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 10:40:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 10:40:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 10:40:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 10:40:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 10:40:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 10:40:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 10:40:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-31 10:40:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 10:40:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 10:40:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-31 10:40:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-31 10:40:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-31 10:40:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-01-31 10:40:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-01-31 10:40:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-01-31 10:40:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-01-31 10:40:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-01-31 10:40:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-01-31 10:40:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-01-31 10:40:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-01-31 10:40:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-01-31 10:40:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-01-31 10:40:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-01-31 10:40:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-01-31 10:40:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-01-31 10:40:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-01-31 10:40:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-01-31 10:40:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-01-31 10:40:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-01-31 10:40:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-01-31 10:40:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-01-31 10:40:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-01-31 10:40:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-01-31 10:40:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-01-31 10:40:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-01-31 10:40:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-01-31 10:40:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-01-31 10:40:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-01-31 10:40:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-01-31 10:40:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-01-31 10:40:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-01-31 10:40:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2022-01-31 10:40:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2022-01-31 10:40:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2022-01-31 10:40:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-01-31 10:40:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11380 backedges. 2 proven. 4560 refuted. 0 times theorem prover too weak. 6818 trivial. 0 not checked. [2022-01-31 10:40:45,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:40:45,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951948376] [2022-01-31 10:40:45,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951948376] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:40:45,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489679389] [2022-01-31 10:40:45,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:40:45,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:40:45,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:40:45,525 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 10:40:45,545 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 10:40:45,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:40:45,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:40:45,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 1706 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-31 10:40:45,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:40:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11380 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 6820 trivial. 0 not checked. [2022-01-31 10:40:48,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:40:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11380 backedges. 2 proven. 4560 refuted. 0 times theorem prover too weak. 6818 trivial. 0 not checked. [2022-01-31 10:40:50,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489679389] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:40:50,812 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:40:50,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 152 [2022-01-31 10:40:50,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027540453] [2022-01-31 10:40:50,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:40:50,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 152 states [2022-01-31 10:40:50,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:40:50,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2022-01-31 10:40:50,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10005, Invalid=12947, Unknown=0, NotChecked=0, Total=22952 [2022-01-31 10:40:50,831 INFO L87 Difference]: Start difference. First operand 326 states and 373 transitions. Second operand has 152 states, 152 states have (on average 3.0592105263157894) internal successors, (465), 151 states have internal predecessors, (465), 148 states have call successors, (150), 5 states have call predecessors, (150), 4 states have return successors, (148), 147 states have call predecessors, (148), 146 states have call successors, (148) [2022-01-31 10:40:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:40:57,955 INFO L93 Difference]: Finished difference Result 1009 states and 1201 transitions. [2022-01-31 10:40:57,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-01-31 10:40:57,955 INFO L78 Accepts]: Start accepts. Automaton has has 152 states, 152 states have (on average 3.0592105263157894) internal successors, (465), 151 states have internal predecessors, (465), 148 states have call successors, (150), 5 states have call predecessors, (150), 4 states have return successors, (148), 147 states have call predecessors, (148), 146 states have call successors, (148) Word has length 503 [2022-01-31 10:40:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:40:57,969 INFO L225 Difference]: With dead ends: 1009 [2022-01-31 10:40:57,969 INFO L226 Difference]: Without dead ends: 1009 [2022-01-31 10:40:57,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1256 GetRequests, 1007 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19399 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=21427, Invalid=41323, Unknown=0, NotChecked=0, Total=62750 [2022-01-31 10:40:57,972 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 2957 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 3421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2957 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3421 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:40:57,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2957 Valid, 28 Invalid, 5589 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3421 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 10:40:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2022-01-31 10:40:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 626. [2022-01-31 10:40:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 517 states have (on average 1.0058027079303675) internal successors, (520), 518 states have internal predecessors, (520), 102 states have call successors, (102), 7 states have call predecessors, (102), 6 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2022-01-31 10:40:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 723 transitions. [2022-01-31 10:40:57,992 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 723 transitions. Word has length 503 [2022-01-31 10:40:57,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:40:57,992 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 723 transitions. [2022-01-31 10:40:57,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 152 states, 152 states have (on average 3.0592105263157894) internal successors, (465), 151 states have internal predecessors, (465), 148 states have call successors, (150), 5 states have call predecessors, (150), 4 states have return successors, (148), 147 states have call predecessors, (148), 146 states have call successors, (148) [2022-01-31 10:40:57,993 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 723 transitions. [2022-01-31 10:40:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1004 [2022-01-31 10:40:58,012 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:40:58,012 INFO L514 BasicCegarLoop]: trace histogram [98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:40:58,031 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 10:40:58,231 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 10:40:58,232 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:40:58,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:40:58,232 INFO L85 PathProgramCache]: Analyzing trace with hash 63342015, now seen corresponding path program 3 times [2022-01-31 10:40:58,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:40:58,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652415977] [2022-01-31 10:40:58,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:40:58,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:40:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:02,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:41:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:02,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 10:41:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 10:41:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:02,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 10:41:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:02,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 10:41:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 10:41:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:02,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 10:41:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:02,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 10:41:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:02,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 10:41:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 10:41:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 10:41:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-31 10:41:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 10:41:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 10:41:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-31 10:41:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-31 10:41:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-31 10:41:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-01-31 10:41:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-01-31 10:41:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-01-31 10:41:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-01-31 10:41:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-01-31 10:41:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-01-31 10:41:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-01-31 10:41:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-01-31 10:41:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-01-31 10:41:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-01-31 10:41:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-01-31 10:41:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-01-31 10:41:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-01-31 10:41:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-01-31 10:41:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-01-31 10:41:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-01-31 10:41:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-01-31 10:41:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-01-31 10:41:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-01-31 10:41:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-01-31 10:41:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-01-31 10:41:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-01-31 10:41:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-01-31 10:41:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-01-31 10:41:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-01-31 10:41:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-01-31 10:41:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-01-31 10:41:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-01-31 10:41:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-01-31 10:41:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2022-01-31 10:41:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2022-01-31 10:41:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2022-01-31 10:41:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-01-31 10:41:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2022-01-31 10:41:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-01-31 10:41:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 415 [2022-01-31 10:41:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 423 [2022-01-31 10:41:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2022-01-31 10:41:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2022-01-31 10:41:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2022-01-31 10:41:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-01-31 10:41:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 463 [2022-01-31 10:41:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2022-01-31 10:41:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2022-01-31 10:41:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2022-01-31 10:41:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 495 [2022-01-31 10:41:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-01-31 10:41:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2022-01-31 10:41:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 519 [2022-01-31 10:41:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 527 [2022-01-31 10:41:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2022-01-31 10:41:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 543 [2022-01-31 10:41:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 551 [2022-01-31 10:41:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 559 [2022-01-31 10:41:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 567 [2022-01-31 10:41:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2022-01-31 10:41:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 583 [2022-01-31 10:41:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 591 [2022-01-31 10:41:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 599 [2022-01-31 10:41:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 607 [2022-01-31 10:41:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 615 [2022-01-31 10:41:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2022-01-31 10:41:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 631 [2022-01-31 10:41:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 639 [2022-01-31 10:41:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2022-01-31 10:41:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 655 [2022-01-31 10:41:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 663 [2022-01-31 10:41:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 671 [2022-01-31 10:41:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 679 [2022-01-31 10:41:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 687 [2022-01-31 10:41:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 695 [2022-01-31 10:41:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 703 [2022-01-31 10:41:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 711 [2022-01-31 10:41:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 719 [2022-01-31 10:41:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 727 [2022-01-31 10:41:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 735 [2022-01-31 10:41:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 743 [2022-01-31 10:41:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 751 [2022-01-31 10:41:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 759 [2022-01-31 10:41:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 767 [2022-01-31 10:41:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 775 [2022-01-31 10:41:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 783 [2022-01-31 10:41:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 991 [2022-01-31 10:41:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:41:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 47730 backedges. 2 proven. 19110 refuted. 0 times theorem prover too weak. 28618 trivial. 0 not checked. [2022-01-31 10:41:03,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:41:03,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652415977] [2022-01-31 10:41:03,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652415977] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:41:03,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278455210] [2022-01-31 10:41:03,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:41:03,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:41:03,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:41:03,310 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 10:41:03,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process