/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_symmetr2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 10:37:29,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 10:37:29,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 10:37:29,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 10:37:29,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 10:37:29,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 10:37:29,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 10:37:29,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 10:37:29,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 10:37:29,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 10:37:29,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 10:37:29,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 10:37:29,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 10:37:29,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 10:37:29,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 10:37:29,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 10:37:29,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 10:37:29,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 10:37:29,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 10:37:29,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 10:37:29,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 10:37:29,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 10:37:29,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 10:37:29,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 10:37:29,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 10:37:29,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 10:37:29,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 10:37:29,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 10:37:29,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 10:37:29,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 10:37:29,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 10:37:29,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 10:37:29,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 10:37:29,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 10:37:29,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 10:37:29,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 10:37:29,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 10:37:29,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 10:37:29,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 10:37:29,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 10:37:29,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 10:37:29,624 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 10:37:29,631 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 10:37:29,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 10:37:29,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 10:37:29,632 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 10:37:29,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 10:37:29,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 10:37:29,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 10:37:29,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 10:37:29,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 10:37:29,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 10:37:29,633 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 10:37:29,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 10:37:29,633 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 10:37:29,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 10:37:29,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 10:37:29,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 10:37:29,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 10:37:29,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 10:37:29,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 10:37:29,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 10:37:29,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 10:37:29,634 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 10:37:29,634 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:37:29,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 10:37:29,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 10:37:29,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 10:37:29,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 10:37:29,836 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 10:37:29,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-cav19/array_init_pair_symmetr2.c [2022-01-31 10:37:29,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94d785b9/5af755adae4441a78d9d3d7aeefb6a32/FLAG3d0c3d5d9 [2022-01-31 10:37:30,246 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 10:37:30,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_pair_symmetr2.c [2022-01-31 10:37:30,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94d785b9/5af755adae4441a78d9d3d7aeefb6a32/FLAG3d0c3d5d9 [2022-01-31 10:37:30,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94d785b9/5af755adae4441a78d9d3d7aeefb6a32 [2022-01-31 10:37:30,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 10:37:30,279 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 10:37:30,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 10:37:30,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 10:37:30,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 10:37:30,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:37:30" (1/1) ... [2022-01-31 10:37:30,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23008486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:37:30, skipping insertion in model container [2022-01-31 10:37:30,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:37:30" (1/1) ... [2022-01-31 10:37:30,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 10:37:30,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 10:37:30,430 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_symmetr2.c[415,428] [2022-01-31 10:37:30,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 10:37:30,447 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 10:37:30,459 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_symmetr2.c[415,428] [2022-01-31 10:37:30,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 10:37:30,487 INFO L208 MainTranslator]: Completed translation [2022-01-31 10:37:30,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:37:30 WrapperNode [2022-01-31 10:37:30,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 10:37:30,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 10:37:30,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 10:37:30,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 10:37:30,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:37:30" (1/1) ... [2022-01-31 10:37:30,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:37:30" (1/1) ... [2022-01-31 10:37:30,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:37:30" (1/1) ... [2022-01-31 10:37:30,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:37:30" (1/1) ... [2022-01-31 10:37:30,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:37:30" (1/1) ... [2022-01-31 10:37:30,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:37:30" (1/1) ... [2022-01-31 10:37:30,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:37:30" (1/1) ... [2022-01-31 10:37:30,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 10:37:30,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 10:37:30,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 10:37:30,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 10:37:30,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:37:30" (1/1) ... [2022-01-31 10:37:30,527 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 10:37:30,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:37:30,546 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:37:30,547 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:37:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 10:37:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 10:37:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 10:37:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 10:37:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 10:37:30,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 10:37:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 10:37:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 10:37:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 10:37:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 10:37:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 10:37:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 10:37:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 10:37:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 10:37:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 10:37:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 10:37:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 10:37:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 10:37:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 10:37:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 10:37:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 10:37:30,639 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 10:37:30,641 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 10:37:30,805 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 10:37:30,809 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 10:37:30,809 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 10:37:30,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:37:30 BoogieIcfgContainer [2022-01-31 10:37:30,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 10:37:30,811 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 10:37:30,811 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 10:37:30,821 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 10:37:30,824 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:37:30" (1/1) ... [2022-01-31 10:37:30,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 10:37:30 BasicIcfg [2022-01-31 10:37:30,852 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 10:37:30,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 10:37:30,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 10:37:30,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 10:37:30,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 10:37:30" (1/4) ... [2022-01-31 10:37:30,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d97368f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:37:30, skipping insertion in model container [2022-01-31 10:37:30,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:37:30" (2/4) ... [2022-01-31 10:37:30,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d97368f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:37:30, skipping insertion in model container [2022-01-31 10:37:30,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:37:30" (3/4) ... [2022-01-31 10:37:30,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d97368f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 10:37:30, skipping insertion in model container [2022-01-31 10:37:30,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 10:37:30" (4/4) ... [2022-01-31 10:37:30,857 INFO L111 eAbstractionObserver]: Analyzing ICFG array_init_pair_symmetr2.cJordan [2022-01-31 10:37:30,861 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 10:37:30,861 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 10:37:30,920 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 10:37:30,940 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:37:30,940 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 10:37:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 10:37:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 10:37:30,957 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:37:30,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:37:30,957 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:37:30,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:37:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash 606914310, now seen corresponding path program 1 times [2022-01-31 10:37:30,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:37:30,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618184957] [2022-01-31 10:37:30,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:37:30,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:37:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:31,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:37:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:31,166 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:37:31,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:37:31,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618184957] [2022-01-31 10:37:31,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618184957] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 10:37:31,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 10:37:31,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 10:37:31,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710120131] [2022-01-31 10:37:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 10:37:31,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 10:37:31,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:37:31,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 10:37:31,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 10:37:31,197 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:37:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:37:31,260 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-01-31 10:37:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 10:37:31,262 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:37:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:37:31,270 INFO L225 Difference]: With dead ends: 35 [2022-01-31 10:37:31,270 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 10:37:31,271 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:37:31,276 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 10:37:31,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 10:37:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 10:37:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-31 10:37:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 10:37:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-31 10:37:31,314 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2022-01-31 10:37:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:37:31,315 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-31 10:37:31,315 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:37:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-31 10:37:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 10:37:31,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:37:31,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:37:31,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 10:37:31,317 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:37:31,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:37:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash -313036472, now seen corresponding path program 1 times [2022-01-31 10:37:31,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:37:31,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078291023] [2022-01-31 10:37:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:37:31,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:37:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:31,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:37:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:31,405 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:37:31,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:37:31,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078291023] [2022-01-31 10:37:31,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078291023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 10:37:31,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 10:37:31,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 10:37:31,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632337973] [2022-01-31 10:37:31,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 10:37:31,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 10:37:31,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:37:31,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 10:37:31,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 10:37:31,410 INFO L87 Difference]: Start difference. First operand 30 states and 34 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:37:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:37:31,537 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-01-31 10:37:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 10:37:31,538 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:37:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:37:31,539 INFO L225 Difference]: With dead ends: 38 [2022-01-31 10:37:31,539 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 10:37:31,543 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:37:31,545 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:37:31,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 25 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:37:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 10:37:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-01-31 10:37:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 10:37:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-31 10:37:31,558 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 15 [2022-01-31 10:37:31,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:37:31,559 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-31 10:37:31,559 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:37:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-31 10:37:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 10:37:31,564 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:37:31,566 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:37:31,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 10:37:31,567 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:37:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:37:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 614279942, now seen corresponding path program 1 times [2022-01-31 10:37:31,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:37:31,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370084954] [2022-01-31 10:37:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:37:31,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:37:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:31,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:37:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:31,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 10:37:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:31,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:37:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:31,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 10:37:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 10:37:31,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:37:31,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370084954] [2022-01-31 10:37:31,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370084954] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:37:31,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702324858] [2022-01-31 10:37:31,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:37:31,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:37:31,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:37:31,718 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:37:31,719 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:37:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:31,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-31 10:37:31,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:37:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 10:37:31,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:37:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 10:37:31,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702324858] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:37:31,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:37:31,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-01-31 10:37:31,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526940267] [2022-01-31 10:37:31,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:37:31,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 10:37:31,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:37:31,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 10:37:31,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-31 10:37:31,976 INFO L87 Difference]: Start difference. First operand 32 states and 36 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, (14), 5 states have call predecessors, (14), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-01-31 10:37:32,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:37:32,170 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-01-31 10:37:32,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 10:37:32,170 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, (14), 5 states have call predecessors, (14), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 35 [2022-01-31 10:37:32,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:37:32,171 INFO L225 Difference]: With dead ends: 65 [2022-01-31 10:37:32,171 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 10:37:32,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 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:37:32,172 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 128 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:37:32,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 26 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:37:32,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 10:37:32,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2022-01-31 10:37:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 10:37:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-01-31 10:37:32,179 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 35 [2022-01-31 10:37:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:37:32,179 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-01-31 10:37:32,179 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, (14), 5 states have call predecessors, (14), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-01-31 10:37:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-01-31 10:37:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-01-31 10:37:32,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:37:32,181 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 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:37:32,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 10:37:32,398 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:37:32,399 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:37:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:37:32,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1189358912, now seen corresponding path program 2 times [2022-01-31 10:37:32,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:37:32,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112800768] [2022-01-31 10:37:32,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:37:32,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:37:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:37:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 10:37:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:37:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 10:37:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 10:37:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 10:37:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:37:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:37:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 10:37:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 10:37:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 10:37:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-31 10:37:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 10:37:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-01-31 10:37:32,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:37:32,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112800768] [2022-01-31 10:37:32,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112800768] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:37:32,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279114153] [2022-01-31 10:37:32,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:37:32,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:37:32,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:37:32,629 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:37:32,630 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:37:32,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:37:32,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:37:32,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 10:37:32,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:37:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-01-31 10:37:32,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:37:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-01-31 10:37:33,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279114153] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:37:33,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:37:33,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-01-31 10:37:33,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978725993] [2022-01-31 10:37:33,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:37:33,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 10:37:33,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:37:33,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 10:37:33,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-01-31 10:37:33,203 INFO L87 Difference]: Start difference. First operand 56 states and 69 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, (41), 5 states have call predecessors, (41), 3 states have return successors, (38), 14 states have call predecessors, (38), 13 states have call successors, (38) [2022-01-31 10:37:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:37:33,679 INFO L93 Difference]: Finished difference Result 137 states and 176 transitions. [2022-01-31 10:37:33,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 10:37:33,679 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, (41), 5 states have call predecessors, (41), 3 states have return successors, (38), 14 states have call predecessors, (38), 13 states have call successors, (38) Word has length 95 [2022-01-31 10:37:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:37:33,684 INFO L225 Difference]: With dead ends: 137 [2022-01-31 10:37:33,685 INFO L226 Difference]: Without dead ends: 137 [2022-01-31 10:37:33,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 205 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:37:33,687 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 284 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:37:33,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 28 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 10:37:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-01-31 10:37:33,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2022-01-31 10:37:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 33 states have call successors, (33), 4 states have call predecessors, (33), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-01-31 10:37:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2022-01-31 10:37:33,710 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 95 [2022-01-31 10:37:33,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:37:33,710 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2022-01-31 10:37:33,711 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, (41), 5 states have call predecessors, (41), 3 states have return successors, (38), 14 states have call predecessors, (38), 13 states have call successors, (38) [2022-01-31 10:37:33,711 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2022-01-31 10:37:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-01-31 10:37:33,712 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:37:33,712 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 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:37:33,735 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:37:33,929 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:37:33,929 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:37:33,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:37:33,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2044899380, now seen corresponding path program 3 times [2022-01-31 10:37:33,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:37:33,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061316908] [2022-01-31 10:37:33,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:37:33,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:37:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:37:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 10:37:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:37:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 10:37:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 10:37:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 10:37:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:37:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:37:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 10:37:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 10:37:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 10:37:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-31 10:37:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 10:37:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 10:37:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-31 10:37:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-01-31 10:37:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-31 10:37:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-31 10:37:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:37:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:37:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-31 10:37:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:37:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:37:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-01-31 10:37:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-01-31 10:37:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-01-31 10:37:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-31 10:37:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-01-31 10:37:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-01-31 10:37:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-01-31 10:37:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-01-31 10:37:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 1840 trivial. 0 not checked. [2022-01-31 10:37:34,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:37:34,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061316908] [2022-01-31 10:37:34,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061316908] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:37:34,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146199584] [2022-01-31 10:37:34,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:37:34,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:37:34,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:37:34,205 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:37:34,206 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:37:34,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-01-31 10:37:34,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:37:34,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 10:37:34,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:37:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2022-01-31 10:37:35,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:37:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2022-01-31 10:37:35,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146199584] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:37:35,887 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:37:35,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 38 [2022-01-31 10:37:35,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995087077] [2022-01-31 10:37:35,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:37:35,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 10:37:35,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:37:35,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 10:37:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=825, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 10:37:35,890 INFO L87 Difference]: Start difference. First operand 104 states and 135 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, (41), 5 states have call predecessors, (41), 3 states have return successors, (38), 12 states have call predecessors, (38), 13 states have call successors, (38) [2022-01-31 10:37:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:37:37,039 INFO L93 Difference]: Finished difference Result 281 states and 368 transitions. [2022-01-31 10:37:37,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 10:37:37,039 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, (41), 5 states have call predecessors, (41), 3 states have return successors, (38), 12 states have call predecessors, (38), 13 states have call successors, (38) Word has length 215 [2022-01-31 10:37:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:37:37,041 INFO L225 Difference]: With dead ends: 281 [2022-01-31 10:37:37,041 INFO L226 Difference]: Without dead ends: 281 [2022-01-31 10:37:37,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1268, Invalid=2392, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 10:37:37,047 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 530 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 855 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 855 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 10:37:37,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [530 Valid, 33 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [855 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 10:37:37,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-01-31 10:37:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 200. [2022-01-31 10:37:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 127 states have (on average 1.0236220472440944) internal successors, (130), 127 states have internal predecessors, (130), 69 states have call successors, (69), 4 states have call predecessors, (69), 3 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-01-31 10:37:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 267 transitions. [2022-01-31 10:37:37,073 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 267 transitions. Word has length 215 [2022-01-31 10:37:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:37:37,074 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 267 transitions. [2022-01-31 10:37:37,074 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, (41), 5 states have call predecessors, (41), 3 states have return successors, (38), 12 states have call predecessors, (38), 13 states have call successors, (38) [2022-01-31 10:37:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 267 transitions. [2022-01-31 10:37:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2022-01-31 10:37:37,079 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:37:37,079 INFO L514 BasicCegarLoop]: trace histogram [66, 66, 66, 22, 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:37:37,099 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:37:37,288 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:37:37,288 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:37:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:37:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash -304730084, now seen corresponding path program 4 times [2022-01-31 10:37:37,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:37:37,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160598770] [2022-01-31 10:37:37,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:37:37,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:37:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:37:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 10:37:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:37:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 10:37:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 10:37:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 10:37:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:37:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:37:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 10:37:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 10:37:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 10:37:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-31 10:37:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 10:37:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 10:37:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-31 10:37:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-01-31 10:37:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-31 10:37:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-31 10:37:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:37:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:37:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-31 10:37:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:37:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:37:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-01-31 10:37:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-01-31 10:37:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-01-31 10:37:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-31 10:37:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-01-31 10:37:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-01-31 10:37:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-01-31 10:37:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-01-31 10:37:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-01-31 10:37:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-01-31 10:37:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:37:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:37:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-01-31 10:37:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-01-31 10:37:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-01-31 10:37:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-01-31 10:37:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-01-31 10:37:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-01-31 10:37:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-01-31 10:37:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-01-31 10:37:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-01-31 10:37:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-01-31 10:37:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:37:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:37:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-01-31 10:37:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-01-31 10:37:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-01-31 10:37:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-01-31 10:37:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-01-31 10:37:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2022-01-31 10:37:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-01-31 10:37:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-01-31 10:37:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-01-31 10:37:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2022-01-31 10:37:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-01-31 10:37:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-01-31 10:37:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2022-01-31 10:37:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-01-31 10:37:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2022-01-31 10:37:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2022-01-31 10:37:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-01-31 10:37:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2022-01-31 10:37:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-01-31 10:37:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2022-01-31 10:37:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10472 backedges. 0 proven. 1408 refuted. 0 times theorem prover too weak. 9064 trivial. 0 not checked. [2022-01-31 10:37:37,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:37:37,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160598770] [2022-01-31 10:37:37,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160598770] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:37:37,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109943004] [2022-01-31 10:37:37,877 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:37:37,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:37:37,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:37:37,880 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:37:37,881 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:37:38,160 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:37:38,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:37:38,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 280 conjunts are in the unsatisfiable core [2022-01-31 10:37:38,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:37:38,219 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 10:37:38,219 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:37:38,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:37:38,444 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 27 treesize of output 31 [2022-01-31 10:37:38,453 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:37:38,457 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 27 treesize of output 26 [2022-01-31 10:37:38,881 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:38,882 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 55 treesize of output 44 [2022-01-31 10:37:39,268 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:39,269 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 55 treesize of output 44 [2022-01-31 10:37:39,632 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:39,634 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 55 treesize of output 44 [2022-01-31 10:37:40,000 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:40,000 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 55 treesize of output 44 [2022-01-31 10:37:40,382 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:40,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 55 treesize of output 44 [2022-01-31 10:37:40,722 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:40,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 2 case distinctions, treesize of input 55 treesize of output 44 [2022-01-31 10:37:41,075 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:41,076 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 55 treesize of output 44 [2022-01-31 10:37:41,449 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:41,450 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 55 treesize of output 44 [2022-01-31 10:37:41,817 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:41,817 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 55 treesize of output 44 [2022-01-31 10:37:42,189 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:42,189 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 55 treesize of output 44 [2022-01-31 10:37:42,565 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:42,565 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 55 treesize of output 44 [2022-01-31 10:37:42,940 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:42,940 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 55 treesize of output 44 [2022-01-31 10:37:43,332 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:43,333 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 55 treesize of output 44 [2022-01-31 10:37:43,716 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:43,717 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 55 treesize of output 44 [2022-01-31 10:37:44,090 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:44,091 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 55 treesize of output 44 [2022-01-31 10:37:44,499 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:44,499 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 55 treesize of output 44 [2022-01-31 10:37:44,889 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:44,889 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 55 treesize of output 44 [2022-01-31 10:37:45,285 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:45,285 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 55 treesize of output 44 [2022-01-31 10:37:45,688 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:45,689 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 55 treesize of output 44 [2022-01-31 10:37:46,065 INFO L353 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-01-31 10:37:46,066 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 55 treesize of output 44 [2022-01-31 10:37:46,157 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 22 treesize of output 27 [2022-01-31 10:37:46,197 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 56 treesize of output 42 [2022-01-31 10:37:46,377 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:46,378 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 54 treesize of output 47 [2022-01-31 10:37:46,513 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:46,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-01-31 10:37:46,652 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:46,653 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 54 treesize of output 47 [2022-01-31 10:37:46,778 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:46,779 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 54 treesize of output 47 [2022-01-31 10:37:46,923 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:46,923 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 54 treesize of output 47 [2022-01-31 10:37:47,072 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:47,072 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 54 treesize of output 47 [2022-01-31 10:37:47,223 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:47,223 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 54 treesize of output 47 [2022-01-31 10:37:47,376 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:47,376 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 54 treesize of output 47 [2022-01-31 10:37:47,535 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:47,535 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 54 treesize of output 47 [2022-01-31 10:37:47,672 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:47,673 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 54 treesize of output 47 [2022-01-31 10:37:47,810 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:47,811 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 54 treesize of output 47 [2022-01-31 10:37:47,970 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:47,971 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 54 treesize of output 47 [2022-01-31 10:37:48,118 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:48,118 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 54 treesize of output 47 [2022-01-31 10:37:48,254 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:48,255 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 54 treesize of output 47 [2022-01-31 10:37:48,401 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:48,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-01-31 10:37:48,556 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:48,557 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 54 treesize of output 47 [2022-01-31 10:37:48,738 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:48,739 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 54 treesize of output 47 [2022-01-31 10:37:48,887 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:48,888 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 54 treesize of output 47 [2022-01-31 10:37:49,022 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:49,022 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 54 treesize of output 47 [2022-01-31 10:37:49,162 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:49,162 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 54 treesize of output 47 [2022-01-31 10:37:49,382 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 48 treesize of output 12 [2022-01-31 10:37:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10472 backedges. 2757 proven. 590 refuted. 0 times theorem prover too weak. 7125 trivial. 0 not checked. [2022-01-31 10:37:49,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:37:51,675 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)) (< 0 (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)))))) is different from false [2022-01-31 10:38:01,818 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)) (< 0 (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))))))) is different from false [2022-01-31 10:38:37,573 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 (< 0 (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))) (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:39:22,920 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 (< 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))) (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:40:15,612 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 (< 0 (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))) (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:41:23,442 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_122 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_122)) (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)) (< 0 (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))) (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:46:39,552 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)) (< 0 (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))))))) is different from false [2022-01-31 10:48:06,168 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)) (< 0 (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))) (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:49:34,711 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 (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)) (< 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_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:51:06,783 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 (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)) (< 0 (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))) (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