/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-a47f07a [2021-04-16 06:44:49,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-16 06:44:49,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-16 06:44:49,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-16 06:44:49,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-16 06:44:49,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-16 06:44:49,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-16 06:44:49,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-16 06:44:49,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-16 06:44:49,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-16 06:44:49,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-16 06:44:49,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-16 06:44:49,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-16 06:44:49,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-16 06:44:49,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-16 06:44:49,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-16 06:44:49,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-16 06:44:49,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-16 06:44:49,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-16 06:44:49,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-16 06:44:49,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-16 06:44:49,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-16 06:44:49,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-16 06:44:49,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-16 06:44:49,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-16 06:44:49,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-16 06:44:49,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-16 06:44:49,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-16 06:44:49,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-16 06:44:49,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-16 06:44:49,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-16 06:44:49,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-16 06:44:49,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-16 06:44:49,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-16 06:44:49,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-16 06:44:49,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-16 06:44:49,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-16 06:44:49,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-16 06:44:49,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-16 06:44:49,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-16 06:44:49,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-16 06:44:49,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-04-16 06:44:49,508 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-16 06:44:49,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-16 06:44:49,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-16 06:44:49,509 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-16 06:44:49,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-16 06:44:49,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-16 06:44:49,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-16 06:44:49,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-16 06:44:49,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-16 06:44:49,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-16 06:44:49,510 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-16 06:44:49,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-16 06:44:49,510 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-16 06:44:49,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-16 06:44:49,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-16 06:44:49,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-16 06:44:49,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-16 06:44:49,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-16 06:44:49,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-16 06:44:49,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-16 06:44:49,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-04-16 06:44:49,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-16 06:44:49,511 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-04-16 06:44:49,511 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 [2021-04-16 06:44:49,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-16 06:44:49,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-16 06:44:49,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-16 06:44:49,735 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-16 06:44:49,735 INFO L275 PluginConnector]: CDTParser initialized [2021-04-16 06:44:49,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2021-04-16 06:44:49,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a0acfb4/aebf94da8180439fb34dbf179509c0bd/FLAG7e05de6eb [2021-04-16 06:44:50,114 INFO L306 CDTParser]: Found 1 translation units. [2021-04-16 06:44:50,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2021-04-16 06:44:50,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a0acfb4/aebf94da8180439fb34dbf179509c0bd/FLAG7e05de6eb [2021-04-16 06:44:50,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a0acfb4/aebf94da8180439fb34dbf179509c0bd [2021-04-16 06:44:50,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-16 06:44:50,134 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-04-16 06:44:50,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-16 06:44:50,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-16 06:44:50,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-16 06:44:50,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.04 06:44:50" (1/1) ... [2021-04-16 06:44:50,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c65e29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 06:44:50, skipping insertion in model container [2021-04-16 06:44:50,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.04 06:44:50" (1/1) ... [2021-04-16 06:44:50,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-16 06:44:50,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-16 06:44:50,262 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2021-04-16 06:44:50,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-16 06:44:50,281 INFO L203 MainTranslator]: Completed pre-run [2021-04-16 06:44:50,296 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2021-04-16 06:44:50,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-16 06:44:50,322 INFO L208 MainTranslator]: Completed translation [2021-04-16 06:44:50,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 06:44:50 WrapperNode [2021-04-16 06:44:50,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-16 06:44:50,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-16 06:44:50,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-16 06:44:50,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-16 06:44:50,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 06:44:50" (1/1) ... [2021-04-16 06:44:50,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 06:44:50" (1/1) ... [2021-04-16 06:44:50,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 06:44:50" (1/1) ... [2021-04-16 06:44:50,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 06:44:50" (1/1) ... [2021-04-16 06:44:50,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 06:44:50" (1/1) ... [2021-04-16 06:44:50,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 06:44:50" (1/1) ... [2021-04-16 06:44:50,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 06:44:50" (1/1) ... [2021-04-16 06:44:50,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-16 06:44:50,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-16 06:44:50,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-16 06:44:50,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-16 06:44:50,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 06:44:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-16 06:44:50,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-04-16 06:44:50,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-16 06:44:50,451 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-04-16 06:44:50,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-04-16 06:44:50,451 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-04-16 06:44:50,451 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-04-16 06:44:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-04-16 06:44:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-04-16 06:44:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-16 06:44:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-04-16 06:44:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-04-16 06:44:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-04-16 06:44:50,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-16 06:44:50,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-04-16 06:44:50,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-16 06:44:50,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-04-16 06:44:50,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-16 06:44:50,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-16 06:44:50,698 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-16 06:44:50,698 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-04-16 06:44:50,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.04 06:44:50 BoogieIcfgContainer [2021-04-16 06:44:50,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-16 06:44:50,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-16 06:44:50,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-16 06:44:50,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-16 06:44:50,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.04 06:44:50" (1/3) ... [2021-04-16 06:44:50,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656ba8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.04 06:44:50, skipping insertion in model container [2021-04-16 06:44:50,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 06:44:50" (2/3) ... [2021-04-16 06:44:50,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656ba8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.04 06:44:50, skipping insertion in model container [2021-04-16 06:44:50,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.04 06:44:50" (3/3) ... [2021-04-16 06:44:50,704 INFO L111 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2021-04-16 06:44:50,707 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-04-16 06:44:50,722 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-04-16 06:44:50,746 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-04-16 06:44:50,761 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-16 06:44:50,761 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-16 06:44:50,761 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-04-16 06:44:50,761 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-16 06:44:50,761 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-16 06:44:50,761 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-16 06:44:50,761 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-16 06:44:50,762 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-16 06:44:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-04-16 06:44:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-04-16 06:44:50,780 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:50,780 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:50,781 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1728321422, now seen corresponding path program 1 times [2021-04-16 06:44:50,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:50,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1443984827] [2021-04-16 06:44:50,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:50,840 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:50,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:50,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:50,990 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-04-16 06:44:50,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-16 06:44:51,017 INFO L142 QuantifierPusher]: treesize reduction 25, result has 10.7 percent of original size [2021-04-16 06:44:51,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 06:44:51,023 INFO L142 QuantifierPusher]: treesize reduction 23, result has 4.2 percent of original size [2021-04-16 06:44:51,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:51,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:51,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1443984827] [2021-04-16 06:44:51,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:51,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-16 06:44:51,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86827278] [2021-04-16 06:44:51,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-16 06:44:51,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:51,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-16 06:44:51,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-16 06:44:51,083 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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) [2021-04-16 06:44:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:44:51,196 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2021-04-16 06:44:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-16 06:44:51,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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 [2021-04-16 06:44:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:44:51,201 INFO L225 Difference]: With dead ends: 47 [2021-04-16 06:44:51,201 INFO L226 Difference]: Without dead ends: 23 [2021-04-16 06:44:51,204 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-16 06:44:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-04-16 06:44:51,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-04-16 06:44:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:44:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2021-04-16 06:44:51,240 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2021-04-16 06:44:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:44:51,241 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2021-04-16 06:44:51,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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) [2021-04-16 06:44:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2021-04-16 06:44:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-04-16 06:44:51,242 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:51,242 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:51,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-16 06:44:51,242 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:51,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:51,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1238871028, now seen corresponding path program 1 times [2021-04-16 06:44:51,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:51,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [580426071] [2021-04-16 06:44:51,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:51,262 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:44:51,266 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:51,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,332 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-04-16 06:44:51,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-04-16 06:44:51,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-04-16 06:44:51,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:51,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:51,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [580426071] [2021-04-16 06:44:51,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:51,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-16 06:44:51,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240074623] [2021-04-16 06:44:51,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-16 06:44:51,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:51,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-16 06:44:51,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-16 06:44:51,388 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2021-04-16 06:44:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:44:51,443 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-04-16 06:44:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-16 06:44:51,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 17 [2021-04-16 06:44:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:44:51,445 INFO L225 Difference]: With dead ends: 40 [2021-04-16 06:44:51,445 INFO L226 Difference]: Without dead ends: 25 [2021-04-16 06:44:51,446 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-16 06:44:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-04-16 06:44:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-04-16 06:44:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:44:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2021-04-16 06:44:51,457 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2021-04-16 06:44:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:44:51,459 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-04-16 06:44:51,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2021-04-16 06:44:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2021-04-16 06:44:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-04-16 06:44:51,464 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:51,465 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:51,465 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-16 06:44:51,465 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:51,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1304082102, now seen corresponding path program 1 times [2021-04-16 06:44:51,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:51,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1281686198] [2021-04-16 06:44:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:51,471 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:44:51,472 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:51,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-16 06:44:51,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-04-16 06:44:51,535 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.9 percent of original size [2021-04-16 06:44:51,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-04-16 06:44:51,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:51,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:51,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1281686198] [2021-04-16 06:44:51,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:51,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-16 06:44:51,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129151771] [2021-04-16 06:44:51,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-16 06:44:51,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-16 06:44:51,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-16 06:44:51,595 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-04-16 06:44:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:44:51,685 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2021-04-16 06:44:51,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-16 06:44:51,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2021-04-16 06:44:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:44:51,687 INFO L225 Difference]: With dead ends: 42 [2021-04-16 06:44:51,687 INFO L226 Difference]: Without dead ends: 27 [2021-04-16 06:44:51,688 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 47.4ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-16 06:44:51,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-04-16 06:44:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-04-16 06:44:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:44:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-04-16 06:44:51,697 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2021-04-16 06:44:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:44:51,697 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-04-16 06:44:51,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-04-16 06:44:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2021-04-16 06:44:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-04-16 06:44:51,698 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:51,698 INFO L519 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:51,698 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-16 06:44:51,698 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:51,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:51,699 INFO L82 PathProgramCache]: Analyzing trace with hash 452585224, now seen corresponding path program 2 times [2021-04-16 06:44:51,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:51,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [60156638] [2021-04-16 06:44:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:51,707 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:44:51,709 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:51,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-16 06:44:51,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-04-16 06:44:51,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-16 06:44:51,814 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.9 percent of original size [2021-04-16 06:44:51,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-04-16 06:44:51,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:51,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:51,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [60156638] [2021-04-16 06:44:51,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:51,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-16 06:44:51,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290932737] [2021-04-16 06:44:51,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-16 06:44:51,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:51,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-16 06:44:51,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-04-16 06:44:51,858 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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) [2021-04-16 06:44:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:44:51,930 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-04-16 06:44:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-16 06:44:51,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 21 [2021-04-16 06:44:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:44:51,932 INFO L225 Difference]: With dead ends: 44 [2021-04-16 06:44:51,932 INFO L226 Difference]: Without dead ends: 29 [2021-04-16 06:44:51,933 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 47.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-04-16 06:44:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-04-16 06:44:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-04-16 06:44:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:44:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2021-04-16 06:44:51,947 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2021-04-16 06:44:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:44:51,948 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2021-04-16 06:44:51,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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) [2021-04-16 06:44:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2021-04-16 06:44:51,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-04-16 06:44:51,949 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:51,949 INFO L519 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:51,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-16 06:44:51,949 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:51,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:51,949 INFO L82 PathProgramCache]: Analyzing trace with hash 687738182, now seen corresponding path program 3 times [2021-04-16 06:44:51,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:51,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [300034374] [2021-04-16 06:44:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:51,954 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:44:51,956 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:51,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:51,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-16 06:44:51,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-04-16 06:44:51,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-16 06:44:51,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:51,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-16 06:44:52,008 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.9 percent of original size [2021-04-16 06:44:52,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-04-16 06:44:52,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:52,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:52,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [300034374] [2021-04-16 06:44:52,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:52,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-16 06:44:52,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818154395] [2021-04-16 06:44:52,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-16 06:44:52,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:52,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-16 06:44:52,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-04-16 06:44:52,052 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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) [2021-04-16 06:44:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:44:52,114 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-04-16 06:44:52,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-16 06:44:52,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 23 [2021-04-16 06:44:52,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:44:52,116 INFO L225 Difference]: With dead ends: 46 [2021-04-16 06:44:52,116 INFO L226 Difference]: Without dead ends: 31 [2021-04-16 06:44:52,117 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 53.8ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-04-16 06:44:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-04-16 06:44:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-04-16 06:44:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:44:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-04-16 06:44:52,126 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2021-04-16 06:44:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:44:52,127 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-04-16 06:44:52,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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) [2021-04-16 06:44:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-04-16 06:44:52,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-04-16 06:44:52,128 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:52,129 INFO L519 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:52,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-16 06:44:52,129 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:52,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:52,129 INFO L82 PathProgramCache]: Analyzing trace with hash -963535868, now seen corresponding path program 4 times [2021-04-16 06:44:52,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:52,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2047588383] [2021-04-16 06:44:52,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:52,135 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:44:52,137 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:52,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-16 06:44:52,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-04-16 06:44:52,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-16 06:44:52,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-16 06:44:52,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-16 06:44:52,240 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.7 percent of original size [2021-04-16 06:44:52,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-04-16 06:44:52,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:52,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:52,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2047588383] [2021-04-16 06:44:52,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:52,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-16 06:44:52,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107809260] [2021-04-16 06:44:52,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-16 06:44:52,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-16 06:44:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-04-16 06:44:52,302 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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) [2021-04-16 06:44:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:44:52,472 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2021-04-16 06:44:52,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-04-16 06:44:52,472 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 25 [2021-04-16 06:44:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:44:52,473 INFO L225 Difference]: With dead ends: 48 [2021-04-16 06:44:52,473 INFO L226 Difference]: Without dead ends: 33 [2021-04-16 06:44:52,474 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 137.7ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-04-16 06:44:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-04-16 06:44:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-04-16 06:44:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:44:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-04-16 06:44:52,479 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2021-04-16 06:44:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:44:52,479 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-04-16 06:44:52,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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) [2021-04-16 06:44:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-04-16 06:44:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-04-16 06:44:52,480 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:52,480 INFO L519 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:52,480 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-16 06:44:52,480 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:52,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1300001602, now seen corresponding path program 5 times [2021-04-16 06:44:52,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:52,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [764010626] [2021-04-16 06:44:52,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:52,485 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:44:52,486 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:52,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,520 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.7 percent of original size [2021-04-16 06:44:52,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-04-16 06:44:52,536 INFO L142 QuantifierPusher]: treesize reduction 34, result has 35.8 percent of original size [2021-04-16 06:44:52,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 06:44:52,544 INFO L142 QuantifierPusher]: treesize reduction 34, result has 35.8 percent of original size [2021-04-16 06:44:52,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 06:44:52,558 INFO L142 QuantifierPusher]: treesize reduction 48, result has 2.0 percent of original size [2021-04-16 06:44:52,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:52,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:52,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [764010626] [2021-04-16 06:44:52,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:52,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-16 06:44:52,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028799515] [2021-04-16 06:44:52,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-16 06:44:52,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:52,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-16 06:44:52,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-04-16 06:44:52,581 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-04-16 06:44:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:44:52,669 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2021-04-16 06:44:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-16 06:44:52,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 27 [2021-04-16 06:44:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:44:52,670 INFO L225 Difference]: With dead ends: 46 [2021-04-16 06:44:52,670 INFO L226 Difference]: Without dead ends: 35 [2021-04-16 06:44:52,670 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 75.1ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-04-16 06:44:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-04-16 06:44:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-04-16 06:44:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:44:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2021-04-16 06:44:52,674 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2021-04-16 06:44:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:44:52,675 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2021-04-16 06:44:52,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-04-16 06:44:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2021-04-16 06:44:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-04-16 06:44:52,675 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:52,675 INFO L519 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:52,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-16 06:44:52,675 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:52,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:52,676 INFO L82 PathProgramCache]: Analyzing trace with hash -537357632, now seen corresponding path program 6 times [2021-04-16 06:44:52,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:52,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [719434932] [2021-04-16 06:44:52,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:52,679 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:44:52,680 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:52,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,704 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-04-16 06:44:52,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-16 06:44:52,715 INFO L142 QuantifierPusher]: treesize reduction 9, result has 73.5 percent of original size [2021-04-16 06:44:52,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-16 06:44:52,728 INFO L142 QuantifierPusher]: treesize reduction 9, result has 73.5 percent of original size [2021-04-16 06:44:52,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-16 06:44:52,737 INFO L142 QuantifierPusher]: treesize reduction 9, result has 67.9 percent of original size [2021-04-16 06:44:52,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 06:44:52,745 INFO L142 QuantifierPusher]: treesize reduction 9, result has 67.9 percent of original size [2021-04-16 06:44:52,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 06:44:52,754 INFO L142 QuantifierPusher]: treesize reduction 23, result has 4.2 percent of original size [2021-04-16 06:44:52,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:52,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:52,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [719434932] [2021-04-16 06:44:52,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:52,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-16 06:44:52,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085968414] [2021-04-16 06:44:52,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-16 06:44:52,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:52,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-16 06:44:52,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-04-16 06:44:52,784 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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) [2021-04-16 06:44:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:44:52,909 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2021-04-16 06:44:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-04-16 06:44:52,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 29 [2021-04-16 06:44:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:44:52,911 INFO L225 Difference]: With dead ends: 48 [2021-04-16 06:44:52,911 INFO L226 Difference]: Without dead ends: 37 [2021-04-16 06:44:52,911 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 113.4ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-04-16 06:44:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-04-16 06:44:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2021-04-16 06:44:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:44:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2021-04-16 06:44:52,937 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2021-04-16 06:44:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:44:52,937 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-04-16 06:44:52,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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) [2021-04-16 06:44:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2021-04-16 06:44:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-04-16 06:44:52,937 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:52,938 INFO L519 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:52,938 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-16 06:44:52,938 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1008022850, now seen corresponding path program 7 times [2021-04-16 06:44:52,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:52,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1459014633] [2021-04-16 06:44:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:52,943 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:44:52,945 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:52,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:52,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:52,998 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-04-16 06:44:52,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-16 06:44:53,038 INFO L142 QuantifierPusher]: treesize reduction 9, result has 73.5 percent of original size [2021-04-16 06:44:53,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-16 06:44:53,052 INFO L142 QuantifierPusher]: treesize reduction 9, result has 73.5 percent of original size [2021-04-16 06:44:53,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-16 06:44:53,062 INFO L142 QuantifierPusher]: treesize reduction 9, result has 73.5 percent of original size [2021-04-16 06:44:53,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-16 06:44:53,078 INFO L142 QuantifierPusher]: treesize reduction 9, result has 67.9 percent of original size [2021-04-16 06:44:53,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 06:44:53,089 INFO L142 QuantifierPusher]: treesize reduction 9, result has 67.9 percent of original size [2021-04-16 06:44:53,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 06:44:53,100 INFO L142 QuantifierPusher]: treesize reduction 23, result has 4.2 percent of original size [2021-04-16 06:44:53,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:53,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:53,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:53,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:53,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:53,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:53,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1459014633] [2021-04-16 06:44:53,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:53,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-16 06:44:53,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685395197] [2021-04-16 06:44:53,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-16 06:44:53,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:53,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-16 06:44:53,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-04-16 06:44:53,138 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2021-04-16 06:44:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:44:53,304 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2021-04-16 06:44:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-16 06:44:53,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 31 [2021-04-16 06:44:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:44:53,306 INFO L225 Difference]: With dead ends: 50 [2021-04-16 06:44:53,306 INFO L226 Difference]: Without dead ends: 39 [2021-04-16 06:44:53,306 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 175.1ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-04-16 06:44:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-04-16 06:44:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-04-16 06:44:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:44:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2021-04-16 06:44:53,324 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2021-04-16 06:44:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:44:53,325 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2021-04-16 06:44:53,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2021-04-16 06:44:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2021-04-16 06:44:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-04-16 06:44:53,325 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:53,325 INFO L519 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:53,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-16 06:44:53,325 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1949236028, now seen corresponding path program 8 times [2021-04-16 06:44:53,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:53,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1190481056] [2021-04-16 06:44:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:53,331 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:44:53,332 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:53,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:53,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:53,380 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-04-16 06:44:53,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-16 06:44:53,392 INFO L142 QuantifierPusher]: treesize reduction 9, result has 73.5 percent of original size [2021-04-16 06:44:53,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-16 06:44:53,404 INFO L142 QuantifierPusher]: treesize reduction 9, result has 73.5 percent of original size [2021-04-16 06:44:53,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-16 06:44:53,414 INFO L142 QuantifierPusher]: treesize reduction 9, result has 73.5 percent of original size [2021-04-16 06:44:53,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-16 06:44:53,425 INFO L142 QuantifierPusher]: treesize reduction 9, result has 73.5 percent of original size [2021-04-16 06:44:53,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-16 06:44:53,438 INFO L142 QuantifierPusher]: treesize reduction 9, result has 67.9 percent of original size [2021-04-16 06:44:53,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 06:44:53,450 INFO L142 QuantifierPusher]: treesize reduction 9, result has 67.9 percent of original size [2021-04-16 06:44:53,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 06:44:53,462 INFO L142 QuantifierPusher]: treesize reduction 23, result has 4.2 percent of original size [2021-04-16 06:44:53,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:53,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:53,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:53,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:53,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:53,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:53,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1190481056] [2021-04-16 06:44:53,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:53,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-16 06:44:53,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5553567] [2021-04-16 06:44:53,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-16 06:44:53,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:53,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-16 06:44:53,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-04-16 06:44:53,490 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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) [2021-04-16 06:44:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:44:53,792 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2021-04-16 06:44:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-16 06:44:53,792 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 33 [2021-04-16 06:44:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:44:53,794 INFO L225 Difference]: With dead ends: 67 [2021-04-16 06:44:53,794 INFO L226 Difference]: Without dead ends: 56 [2021-04-16 06:44:53,794 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 186.6ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-04-16 06:44:53,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-04-16 06:44:53,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2021-04-16 06:44:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:44:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2021-04-16 06:44:53,802 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2021-04-16 06:44:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:44:53,803 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2021-04-16 06:44:53,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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) [2021-04-16 06:44:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2021-04-16 06:44:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-04-16 06:44:53,807 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:53,807 INFO L519 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:53,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-16 06:44:53,807 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash 606667834, now seen corresponding path program 9 times [2021-04-16 06:44:53,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:53,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [609933415] [2021-04-16 06:44:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:53,813 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:44:53,814 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:53,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:53,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:53,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:53,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-16 06:44:53,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:53,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-16 06:44:53,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:53,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-16 06:44:53,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:53,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-16 06:44:53,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:53,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-16 06:44:53,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:53,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-16 06:44:53,956 INFO L142 QuantifierPusher]: treesize reduction 12, result has 84.2 percent of original size [2021-04-16 06:44:53,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-04-16 06:44:53,981 INFO L142 QuantifierPusher]: treesize reduction 13, result has 82.7 percent of original size [2021-04-16 06:44:53,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-04-16 06:44:54,010 INFO L142 QuantifierPusher]: treesize reduction 12, result has 84.0 percent of original size [2021-04-16 06:44:54,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-04-16 06:44:54,035 INFO L142 QuantifierPusher]: treesize reduction 13, result has 82.7 percent of original size [2021-04-16 06:44:54,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-04-16 06:44:54,038 INFO L142 QuantifierPusher]: treesize reduction 12, result has 84.0 percent of original size [2021-04-16 06:44:54,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-04-16 06:44:54,041 INFO L142 QuantifierPusher]: treesize reduction 13, result has 82.7 percent of original size [2021-04-16 06:44:54,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-04-16 06:44:54,042 INFO L142 QuantifierPusher]: treesize reduction 11, result has 85.1 percent of original size [2021-04-16 06:44:54,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-04-16 06:44:54,045 INFO L142 QuantifierPusher]: treesize reduction 5, result has 93.9 percent of original size [2021-04-16 06:44:54,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-04-16 06:44:54,059 INFO L142 QuantifierPusher]: treesize reduction 5, result has 94.4 percent of original size [2021-04-16 06:44:54,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 84 [2021-04-16 06:44:54,114 INFO L142 QuantifierPusher]: treesize reduction 27, result has 79.4 percent of original size [2021-04-16 06:44:54,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2021-04-16 06:44:54,168 INFO L142 QuantifierPusher]: treesize reduction 6, result has 94.5 percent of original size [2021-04-16 06:44:54,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-04-16 06:44:54,223 INFO L142 QuantifierPusher]: treesize reduction 9, result has 90.7 percent of original size [2021-04-16 06:44:54,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2021-04-16 06:44:54,268 INFO L142 QuantifierPusher]: treesize reduction 26, result has 63.9 percent of original size [2021-04-16 06:44:54,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-04-16 06:44:54,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:54,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 06:44:54,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:54,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 06:44:54,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:54,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 06:44:54,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:54,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:54,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:54,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:54,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:54,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [609933415] [2021-04-16 06:44:54,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:54,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-04-16 06:44:54,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440233532] [2021-04-16 06:44:54,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-04-16 06:44:54,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:54,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-04-16 06:44:54,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-04-16 06:44:54,381 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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) [2021-04-16 06:44:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:44:55,587 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2021-04-16 06:44:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-04-16 06:44:55,588 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 35 [2021-04-16 06:44:55,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:44:55,588 INFO L225 Difference]: With dead ends: 70 [2021-04-16 06:44:55,588 INFO L226 Difference]: Without dead ends: 68 [2021-04-16 06:44:55,589 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1147.8ms TimeCoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2021-04-16 06:44:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-04-16 06:44:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2021-04-16 06:44:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-04-16 06:44:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2021-04-16 06:44:55,597 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 35 [2021-04-16 06:44:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:44:55,597 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2021-04-16 06:44:55,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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) [2021-04-16 06:44:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2021-04-16 06:44:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-04-16 06:44:55,598 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:55,598 INFO L519 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:55,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-16 06:44:55,598 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash 758259348, now seen corresponding path program 1 times [2021-04-16 06:44:55,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:55,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1703106323] [2021-04-16 06:44:55,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:55,612 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:44:55,614 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:55,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:55,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:55,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:55,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-16 06:44:55,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:55,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-16 06:44:55,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:55,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-16 06:44:55,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:55,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-16 06:44:55,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:55,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-16 06:44:55,748 INFO L142 QuantifierPusher]: treesize reduction 12, result has 84.2 percent of original size [2021-04-16 06:44:55,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-04-16 06:44:55,770 INFO L142 QuantifierPusher]: treesize reduction 13, result has 82.7 percent of original size [2021-04-16 06:44:55,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-04-16 06:44:55,795 INFO L142 QuantifierPusher]: treesize reduction 12, result has 84.0 percent of original size [2021-04-16 06:44:55,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-04-16 06:44:55,826 INFO L142 QuantifierPusher]: treesize reduction 13, result has 82.7 percent of original size [2021-04-16 06:44:55,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-04-16 06:44:55,829 INFO L142 QuantifierPusher]: treesize reduction 11, result has 85.1 percent of original size [2021-04-16 06:44:55,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-04-16 06:44:55,832 INFO L142 QuantifierPusher]: treesize reduction 5, result has 93.9 percent of original size [2021-04-16 06:44:55,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-04-16 06:44:55,847 INFO L142 QuantifierPusher]: treesize reduction 18, result has 81.3 percent of original size [2021-04-16 06:44:55,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-04-16 06:44:55,864 INFO L142 QuantifierPusher]: treesize reduction 19, result has 89.6 percent of original size [2021-04-16 06:44:55,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 164 [2021-04-16 06:44:55,939 INFO L142 QuantifierPusher]: treesize reduction 1, result has 99.2 percent of original size [2021-04-16 06:44:55,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 127 [2021-04-16 06:44:56,008 INFO L142 QuantifierPusher]: treesize reduction 6, result has 94.3 percent of original size [2021-04-16 06:44:56,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 99 [2021-04-16 06:44:56,069 INFO L142 QuantifierPusher]: treesize reduction 6, result has 94.5 percent of original size [2021-04-16 06:44:56,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-04-16 06:44:56,129 INFO L142 QuantifierPusher]: treesize reduction 9, result has 90.7 percent of original size [2021-04-16 06:44:56,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2021-04-16 06:44:56,175 INFO L142 QuantifierPusher]: treesize reduction 8, result has 83.3 percent of original size [2021-04-16 06:44:56,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-04-16 06:44:56,206 INFO L142 QuantifierPusher]: treesize reduction 8, result has 83.0 percent of original size [2021-04-16 06:44:56,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-04-16 06:44:56,249 INFO L142 QuantifierPusher]: treesize reduction 22, result has 76.1 percent of original size [2021-04-16 06:44:56,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-04-16 06:44:56,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:56,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 06:44:56,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:56,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 06:44:56,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:56,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 06:44:56,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:56,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:56,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:56,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:56,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:56,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-04-16 06:44:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:56,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:56,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:56,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1703106323] [2021-04-16 06:44:56,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:56,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-04-16 06:44:56,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720816392] [2021-04-16 06:44:56,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-04-16 06:44:56,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:56,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-04-16 06:44:56,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-04-16 06:44:56,389 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:44:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:44:57,807 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-04-16 06:44:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-04-16 06:44:57,812 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-04-16 06:44:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:44:57,813 INFO L225 Difference]: With dead ends: 66 [2021-04-16 06:44:57,813 INFO L226 Difference]: Without dead ends: 64 [2021-04-16 06:44:57,813 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1526.1ms TimeCoverageRelationStatistics Valid=240, Invalid=1320, Unknown=0, NotChecked=0, Total=1560 [2021-04-16 06:44:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-04-16 06:44:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2021-04-16 06:44:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 45 states have internal predecessors, (47), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-04-16 06:44:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-04-16 06:44:57,824 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 43 [2021-04-16 06:44:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:44:57,825 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-04-16 06:44:57,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:44:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2021-04-16 06:44:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-04-16 06:44:57,828 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:44:57,828 INFO L519 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:44:57,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-16 06:44:57,829 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:44:57,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:44:57,830 INFO L82 PathProgramCache]: Analyzing trace with hash 814759662, now seen corresponding path program 2 times [2021-04-16 06:44:57,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:44:57,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1285823018] [2021-04-16 06:44:57,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:44:57,839 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:44:57,840 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:44:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:57,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:57,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:57,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:57,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-16 06:44:57,933 INFO L142 QuantifierPusher]: treesize reduction 2, result has 98.3 percent of original size [2021-04-16 06:44:57,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2021-04-16 06:44:57,974 INFO L142 QuantifierPusher]: treesize reduction 2, result has 98.3 percent of original size [2021-04-16 06:44:57,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 117 [2021-04-16 06:44:58,027 INFO L142 QuantifierPusher]: treesize reduction 2, result has 98.3 percent of original size [2021-04-16 06:44:58,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 117 [2021-04-16 06:44:58,090 INFO L142 QuantifierPusher]: treesize reduction 15, result has 90.6 percent of original size [2021-04-16 06:44:58,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 144 [2021-04-16 06:44:58,157 INFO L142 QuantifierPusher]: treesize reduction 28, result has 83.7 percent of original size [2021-04-16 06:44:58,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 144 [2021-04-16 06:44:58,222 INFO L142 QuantifierPusher]: treesize reduction 31, result has 81.4 percent of original size [2021-04-16 06:44:58,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 136 [2021-04-16 06:44:58,292 INFO L142 QuantifierPusher]: treesize reduction 12, result has 92.5 percent of original size [2021-04-16 06:44:58,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 149 [2021-04-16 06:44:58,362 INFO L142 QuantifierPusher]: treesize reduction 12, result has 92.1 percent of original size [2021-04-16 06:44:58,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2021-04-16 06:44:58,445 INFO L142 QuantifierPusher]: treesize reduction 12, result has 92.4 percent of original size [2021-04-16 06:44:58,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 145 [2021-04-16 06:44:58,529 INFO L142 QuantifierPusher]: treesize reduction 29, result has 79.6 percent of original size [2021-04-16 06:44:58,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-04-16 06:44:58,583 INFO L142 QuantifierPusher]: treesize reduction 29, result has 79.6 percent of original size [2021-04-16 06:44:58,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-04-16 06:44:58,655 INFO L142 QuantifierPusher]: treesize reduction 45, result has 67.2 percent of original size [2021-04-16 06:44:58,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 92 [2021-04-16 06:44:58,702 INFO L142 QuantifierPusher]: treesize reduction 19, result has 62.0 percent of original size [2021-04-16 06:44:58,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-04-16 06:44:58,729 INFO L142 QuantifierPusher]: treesize reduction 19, result has 62.0 percent of original size [2021-04-16 06:44:58,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-04-16 06:44:58,757 INFO L142 QuantifierPusher]: treesize reduction 19, result has 64.2 percent of original size [2021-04-16 06:44:58,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-04-16 06:44:58,788 INFO L142 QuantifierPusher]: treesize reduction 30, result has 65.1 percent of original size [2021-04-16 06:44:58,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-04-16 06:44:58,830 INFO L142 QuantifierPusher]: treesize reduction 43, result has 65.9 percent of original size [2021-04-16 06:44:58,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 83 [2021-04-16 06:44:58,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:58,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 06:44:58,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:58,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 06:44:58,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:58,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 06:44:58,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:58,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:58,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:44:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:58,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:58,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:58,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-04-16 06:44:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:58,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:58,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:58,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-04-16 06:44:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:44:58,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:44:58,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:44:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:44:58,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1285823018] [2021-04-16 06:44:58,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:44:58,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-04-16 06:44:58,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49629987] [2021-04-16 06:44:58,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-04-16 06:44:58,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:44:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-04-16 06:44:58,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2021-04-16 06:44:58,968 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-04-16 06:45:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:45:00,420 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2021-04-16 06:45:00,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-04-16 06:45:00,421 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2021-04-16 06:45:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:45:00,422 INFO L225 Difference]: With dead ends: 79 [2021-04-16 06:45:00,422 INFO L226 Difference]: Without dead ends: 77 [2021-04-16 06:45:00,423 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1909.2ms TimeCoverageRelationStatistics Valid=203, Invalid=1603, Unknown=0, NotChecked=0, Total=1806 [2021-04-16 06:45:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-04-16 06:45:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2021-04-16 06:45:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 59 states have internal predecessors, (61), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2021-04-16 06:45:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2021-04-16 06:45:00,436 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 51 [2021-04-16 06:45:00,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:45:00,436 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2021-04-16 06:45:00,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-04-16 06:45:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2021-04-16 06:45:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-04-16 06:45:00,437 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:45:00,437 INFO L519 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:45:00,437 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-16 06:45:00,437 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:45:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:45:00,437 INFO L82 PathProgramCache]: Analyzing trace with hash -131775380, now seen corresponding path program 3 times [2021-04-16 06:45:00,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:45:00,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1456253233] [2021-04-16 06:45:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:45:00,443 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:45:00,444 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:45:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:00,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:00,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:00,465 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-04-16 06:45:00,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-16 06:45:00,475 INFO L142 QuantifierPusher]: treesize reduction 17, result has 52.8 percent of original size [2021-04-16 06:45:00,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 06:45:00,481 INFO L142 QuantifierPusher]: treesize reduction 17, result has 52.8 percent of original size [2021-04-16 06:45:00,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 06:45:00,489 INFO L142 QuantifierPusher]: treesize reduction 17, result has 52.8 percent of original size [2021-04-16 06:45:00,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 06:45:00,497 INFO L142 QuantifierPusher]: treesize reduction 17, result has 52.8 percent of original size [2021-04-16 06:45:00,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-16 06:45:00,505 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.0 percent of original size [2021-04-16 06:45:00,506 INFO L147 QuantifierPusher]: treesize reduction 8, result has 70.4 percent of original size 19 [2021-04-16 06:45:00,519 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.0 percent of original size [2021-04-16 06:45:00,520 INFO L147 QuantifierPusher]: treesize reduction 8, result has 70.4 percent of original size 19 [2021-04-16 06:45:00,534 INFO L142 QuantifierPusher]: treesize reduction 23, result has 4.2 percent of original size [2021-04-16 06:45:00,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:00,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:00,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:00,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:45:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:00,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:00,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:00,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-04-16 06:45:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:00,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:00,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:00,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-04-16 06:45:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:00,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:00,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:45:00,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1456253233] [2021-04-16 06:45:00,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:45:00,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-16 06:45:00,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111960044] [2021-04-16 06:45:00,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-16 06:45:00,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:45:00,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-16 06:45:00,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-04-16 06:45:00,580 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:45:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:45:00,771 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2021-04-16 06:45:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-16 06:45:00,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2021-04-16 06:45:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:45:00,772 INFO L225 Difference]: With dead ends: 100 [2021-04-16 06:45:00,772 INFO L226 Difference]: Without dead ends: 73 [2021-04-16 06:45:00,772 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 124.7ms TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2021-04-16 06:45:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-04-16 06:45:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2021-04-16 06:45:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-04-16 06:45:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2021-04-16 06:45:00,783 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 53 [2021-04-16 06:45:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:45:00,783 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2021-04-16 06:45:00,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-04-16 06:45:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2021-04-16 06:45:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-04-16 06:45:00,784 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:45:00,784 INFO L519 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:45:00,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-16 06:45:00,784 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:45:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:45:00,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1545771704, now seen corresponding path program 4 times [2021-04-16 06:45:00,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:45:00,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [384084596] [2021-04-16 06:45:00,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:45:00,788 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:45:00,789 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:45:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:00,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:00,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:00,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:00,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-16 06:45:00,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:00,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-16 06:45:00,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:00,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-16 06:45:00,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:00,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-16 06:45:00,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:00,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-04-16 06:45:00,896 INFO L142 QuantifierPusher]: treesize reduction 2, result has 98.2 percent of original size [2021-04-16 06:45:00,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-04-16 06:45:00,944 INFO L142 QuantifierPusher]: treesize reduction 16, result has 90.2 percent of original size [2021-04-16 06:45:00,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 147 [2021-04-16 06:45:01,013 INFO L142 QuantifierPusher]: treesize reduction 20, result has 88.7 percent of original size [2021-04-16 06:45:01,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 157 [2021-04-16 06:45:01,089 INFO L142 QuantifierPusher]: treesize reduction 41, result has 80.1 percent of original size [2021-04-16 06:45:01,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2021-04-16 06:45:01,169 INFO L142 QuantifierPusher]: treesize reduction 31, result has 84.7 percent of original size [2021-04-16 06:45:01,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 172 [2021-04-16 06:45:01,273 INFO L142 QuantifierPusher]: treesize reduction 28, result has 82.6 percent of original size [2021-04-16 06:45:01,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-04-16 06:45:01,342 INFO L142 QuantifierPusher]: treesize reduction 22, result has 86.7 percent of original size [2021-04-16 06:45:01,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 144 [2021-04-16 06:45:01,425 INFO L142 QuantifierPusher]: treesize reduction 22, result has 85.9 percent of original size [2021-04-16 06:45:01,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 134 [2021-04-16 06:45:01,502 INFO L142 QuantifierPusher]: treesize reduction 22, result has 86.5 percent of original size [2021-04-16 06:45:01,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 141 [2021-04-16 06:45:01,582 INFO L142 QuantifierPusher]: treesize reduction 34, result has 76.4 percent of original size [2021-04-16 06:45:01,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 110 [2021-04-16 06:45:01,642 INFO L142 QuantifierPusher]: treesize reduction 34, result has 76.4 percent of original size [2021-04-16 06:45:01,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 110 [2021-04-16 06:45:01,702 INFO L142 QuantifierPusher]: treesize reduction 46, result has 66.4 percent of original size [2021-04-16 06:45:01,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 91 [2021-04-16 06:45:01,753 INFO L142 QuantifierPusher]: treesize reduction 20, result has 60.0 percent of original size [2021-04-16 06:45:01,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-04-16 06:45:01,785 INFO L142 QuantifierPusher]: treesize reduction 20, result has 60.0 percent of original size [2021-04-16 06:45:01,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-04-16 06:45:01,834 INFO L142 QuantifierPusher]: treesize reduction 20, result has 58.3 percent of original size [2021-04-16 06:45:01,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-04-16 06:45:01,865 INFO L142 QuantifierPusher]: treesize reduction 20, result has 58.3 percent of original size [2021-04-16 06:45:01,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-04-16 06:45:01,899 INFO L142 QuantifierPusher]: treesize reduction 20, result has 58.3 percent of original size [2021-04-16 06:45:01,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-04-16 06:45:01,937 INFO L142 QuantifierPusher]: treesize reduction 32, result has 61.0 percent of original size [2021-04-16 06:45:01,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-04-16 06:45:01,990 INFO L142 QuantifierPusher]: treesize reduction 32, result has 60.5 percent of original size [2021-04-16 06:45:01,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-04-16 06:45:02,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:02,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 06:45:02,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:02,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 06:45:02,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:02,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 06:45:02,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:02,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:02,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:45:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:02,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:02,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:02,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-04-16 06:45:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:02,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:02,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:02,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-04-16 06:45:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:02,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:02,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:02,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-04-16 06:45:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:02,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:02,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:45:02,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [384084596] [2021-04-16 06:45:02,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:45:02,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-04-16 06:45:02,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743941625] [2021-04-16 06:45:02,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-04-16 06:45:02,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:45:02,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-04-16 06:45:02,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-04-16 06:45:02,142 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 30 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 28 states have internal predecessors, (43), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-04-16 06:45:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:45:04,235 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2021-04-16 06:45:04,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-04-16 06:45:04,235 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 28 states have internal predecessors, (43), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2021-04-16 06:45:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:45:04,236 INFO L225 Difference]: With dead ends: 74 [2021-04-16 06:45:04,236 INFO L226 Difference]: Without dead ends: 72 [2021-04-16 06:45:04,237 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 2611.7ms TimeCoverageRelationStatistics Valid=295, Invalid=2785, Unknown=0, NotChecked=0, Total=3080 [2021-04-16 06:45:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-04-16 06:45:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-04-16 06:45:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-04-16 06:45:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2021-04-16 06:45:04,248 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 59 [2021-04-16 06:45:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:45:04,248 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2021-04-16 06:45:04,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 28 states have internal predecessors, (43), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-04-16 06:45:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2021-04-16 06:45:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-04-16 06:45:04,249 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:45:04,249 INFO L519 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:45:04,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-16 06:45:04,249 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:45:04,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:45:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1028419166, now seen corresponding path program 5 times [2021-04-16 06:45:04,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:45:04,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1813237201] [2021-04-16 06:45:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:45:04,253 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:45:04,254 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:45:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:04,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:04,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:04,335 INFO L142 QuantifierPusher]: treesize reduction 10, result has 68.8 percent of original size [2021-04-16 06:45:04,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-16 06:45:04,353 INFO L142 QuantifierPusher]: treesize reduction 32, result has 61.0 percent of original size [2021-04-16 06:45:04,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-04-16 06:45:04,384 INFO L142 QuantifierPusher]: treesize reduction 61, result has 26.5 percent of original size [2021-04-16 06:45:04,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-16 06:45:04,402 INFO L142 QuantifierPusher]: treesize reduction 16, result has 57.9 percent of original size [2021-04-16 06:45:04,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-16 06:45:04,421 INFO L142 QuantifierPusher]: treesize reduction 16, result has 59.0 percent of original size [2021-04-16 06:45:04,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-16 06:45:04,440 INFO L142 QuantifierPusher]: treesize reduction 22, result has 33.3 percent of original size [2021-04-16 06:45:04,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-16 06:45:04,451 INFO L142 QuantifierPusher]: treesize reduction 37, result has 82.3 percent of original size [2021-04-16 06:45:04,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 172 [2021-04-16 06:45:04,532 INFO L142 QuantifierPusher]: treesize reduction 47, result has 80.0 percent of original size [2021-04-16 06:45:04,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 188 [2021-04-16 06:45:04,624 INFO L142 QuantifierPusher]: treesize reduction 43, result has 81.5 percent of original size [2021-04-16 06:45:04,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 189 [2021-04-16 06:45:04,728 INFO L142 QuantifierPusher]: treesize reduction 42, result has 80.9 percent of original size [2021-04-16 06:45:04,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 178 [2021-04-16 06:45:04,818 INFO L142 QuantifierPusher]: treesize reduction 42, result has 81.3 percent of original size [2021-04-16 06:45:04,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 183 [2021-04-16 06:45:04,909 INFO L142 QuantifierPusher]: treesize reduction 28, result has 84.8 percent of original size [2021-04-16 06:45:04,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2021-04-16 06:45:05,017 INFO L142 QuantifierPusher]: treesize reduction 28, result has 85.2 percent of original size [2021-04-16 06:45:05,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 161 [2021-04-16 06:45:05,106 INFO L142 QuantifierPusher]: treesize reduction 28, result has 84.2 percent of original size [2021-04-16 06:45:05,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 149 [2021-04-16 06:45:05,197 INFO L142 QuantifierPusher]: treesize reduction 28, result has 84.8 percent of original size [2021-04-16 06:45:05,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2021-04-16 06:45:05,298 INFO L142 QuantifierPusher]: treesize reduction 40, result has 75.8 percent of original size [2021-04-16 06:45:05,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-04-16 06:45:05,373 INFO L142 QuantifierPusher]: treesize reduction 40, result has 75.8 percent of original size [2021-04-16 06:45:05,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-04-16 06:45:05,449 INFO L142 QuantifierPusher]: treesize reduction 52, result has 67.1 percent of original size [2021-04-16 06:45:05,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 106 [2021-04-16 06:45:05,511 INFO L142 QuantifierPusher]: treesize reduction 36, result has 55.6 percent of original size [2021-04-16 06:45:05,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-04-16 06:45:05,559 INFO L142 QuantifierPusher]: treesize reduction 36, result has 55.6 percent of original size [2021-04-16 06:45:05,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-04-16 06:45:05,609 INFO L142 QuantifierPusher]: treesize reduction 26, result has 62.3 percent of original size [2021-04-16 06:45:05,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-04-16 06:45:05,657 INFO L142 QuantifierPusher]: treesize reduction 26, result has 62.3 percent of original size [2021-04-16 06:45:05,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-04-16 06:45:05,705 INFO L142 QuantifierPusher]: treesize reduction 26, result has 62.3 percent of original size [2021-04-16 06:45:05,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-04-16 06:45:05,763 INFO L142 QuantifierPusher]: treesize reduction 26, result has 62.3 percent of original size [2021-04-16 06:45:05,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-04-16 06:45:05,812 INFO L142 QuantifierPusher]: treesize reduction 26, result has 62.3 percent of original size [2021-04-16 06:45:05,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-04-16 06:45:05,861 INFO L142 QuantifierPusher]: treesize reduction 33, result has 66.0 percent of original size [2021-04-16 06:45:05,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-04-16 06:45:05,916 INFO L142 QuantifierPusher]: treesize reduction 33, result has 65.6 percent of original size [2021-04-16 06:45:05,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-04-16 06:45:05,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:05,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-16 06:45:05,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:05,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 06:45:06,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:06,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-16 06:45:06,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:06,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:06,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:45:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:06,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:06,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:06,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-04-16 06:45:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:06,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:06,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:06,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-04-16 06:45:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:06,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:06,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:06,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-04-16 06:45:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:06,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:06,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:06,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-04-16 06:45:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:06,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:06,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:45:06,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1813237201] [2021-04-16 06:45:06,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:45:06,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-04-16 06:45:06,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681896090] [2021-04-16 06:45:06,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-04-16 06:45:06,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:45:06,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-04-16 06:45:06,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-04-16 06:45:06,085 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-04-16 06:45:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:45:09,015 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2021-04-16 06:45:09,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-04-16 06:45:09,016 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 67 [2021-04-16 06:45:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:45:09,017 INFO L225 Difference]: With dead ends: 83 [2021-04-16 06:45:09,017 INFO L226 Difference]: Without dead ends: 81 [2021-04-16 06:45:09,018 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 3671.5ms TimeCoverageRelationStatistics Valid=357, Invalid=3549, Unknown=0, NotChecked=0, Total=3906 [2021-04-16 06:45:09,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-04-16 06:45:09,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2021-04-16 06:45:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.032258064516129) internal successors, (64), 63 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-04-16 06:45:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2021-04-16 06:45:09,036 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 67 [2021-04-16 06:45:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:45:09,036 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2021-04-16 06:45:09,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-04-16 06:45:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2021-04-16 06:45:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-04-16 06:45:09,037 INFO L511 BasicCegarLoop]: Found error trace [2021-04-16 06:45:09,037 INFO L519 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-16 06:45:09,037 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-16 06:45:09,037 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-16 06:45:09,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-16 06:45:09,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1901280260, now seen corresponding path program 6 times [2021-04-16 06:45:09,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-04-16 06:45:09,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1658634216] [2021-04-16 06:45:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-16 06:45:09,042 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-04-16 06:45:09,043 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-04-16 06:45:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:09,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:09,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:09,089 INFO L142 QuantifierPusher]: treesize reduction 7, result has 73.1 percent of original size [2021-04-16 06:45:09,089 INFO L147 QuantifierPusher]: treesize reduction 8, result has 57.9 percent of original size 11 [2021-04-16 06:45:09,098 INFO L142 QuantifierPusher]: treesize reduction 7, result has 75.9 percent of original size [2021-04-16 06:45:09,099 INFO L147 QuantifierPusher]: treesize reduction 8, result has 63.6 percent of original size 14 [2021-04-16 06:45:09,111 INFO L142 QuantifierPusher]: treesize reduction 7, result has 77.4 percent of original size [2021-04-16 06:45:09,112 INFO L147 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size 16 [2021-04-16 06:45:09,124 INFO L142 QuantifierPusher]: treesize reduction 7, result has 77.4 percent of original size [2021-04-16 06:45:09,125 INFO L147 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size 16 [2021-04-16 06:45:09,137 INFO L142 QuantifierPusher]: treesize reduction 7, result has 77.4 percent of original size [2021-04-16 06:45:09,138 INFO L147 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size 16 [2021-04-16 06:45:09,152 INFO L142 QuantifierPusher]: treesize reduction 7, result has 77.4 percent of original size [2021-04-16 06:45:09,152 INFO L147 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size 16 [2021-04-16 06:45:09,166 INFO L142 QuantifierPusher]: treesize reduction 8, result has 81.4 percent of original size [2021-04-16 06:45:09,167 INFO L147 QuantifierPusher]: treesize reduction 8, result has 77.1 percent of original size 27 [2021-04-16 06:45:09,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:09,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:09,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-04-16 06:45:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:09,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:09,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:09,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-04-16 06:45:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:09,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:09,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:09,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-04-16 06:45:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:09,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:09,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:09,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-04-16 06:45:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:09,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:09,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:09,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-04-16 06:45:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:09,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:09,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:09,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-04-16 06:45:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-16 06:45:09,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-16 06:45:09,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-16 06:45:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-16 06:45:09,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1658634216] [2021-04-16 06:45:09,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-16 06:45:09,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-16 06:45:09,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320727566] [2021-04-16 06:45:09,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-16 06:45:09,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-04-16 06:45:09,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-16 06:45:09,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-04-16 06:45:09,230 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-04-16 06:45:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-16 06:45:09,454 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2021-04-16 06:45:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-16 06:45:09,455 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2021-04-16 06:45:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-16 06:45:09,456 INFO L225 Difference]: With dead ends: 134 [2021-04-16 06:45:09,456 INFO L226 Difference]: Without dead ends: 0 [2021-04-16 06:45:09,459 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 117.7ms TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-04-16 06:45:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-04-16 06:45:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-04-16 06:45:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-16 06:45:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-04-16 06:45:09,460 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2021-04-16 06:45:09,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-16 06:45:09,460 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-04-16 06:45:09,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-04-16 06:45:09,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-04-16 06:45:09,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-04-16 06:45:09,460 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-04-16 06:45:09,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-04-16 06:45:10,274 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 42 [2021-04-16 06:45:10,596 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 47 [2021-04-16 06:45:11,580 WARN L205 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 104 [2021-04-16 06:45:12,588 WARN L205 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 135 [2021-04-16 06:45:13,470 WARN L205 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 110 [2021-04-16 06:45:14,067 WARN L205 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 96 [2021-04-16 06:45:15,456 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 213 DAG size of output: 160 [2021-04-16 06:45:16,067 WARN L205 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 98 [2021-04-16 06:45:16,069 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-04-16 06:45:16,070 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-04-16 06:45:16,070 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-04-16 06:45:16,070 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-04-16 06:45:16,070 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-04-16 06:45:16,070 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-04-16 06:45:16,070 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-04-16 06:45:16,070 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-04-16 06:45:16,070 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-04-16 06:45:16,070 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-04-16 06:45:16,071 INFO L194 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: (let ((.cse23 (+ main_~max~0 4294967295))) (let ((.cse29 (div .cse23 4294967296)) (.cse24 (select |#memory_int| |main_~#str1~0.base|)) (.cse28 (+ |main_~#str1~0.offset| main_~i~0))) (let ((.cse20 (select |#memory_int| |main_~#str2~0.base|)) (.cse14 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse32 (select .cse24 .cse28)) (.cse35 (+ main_~max~0 2147483648)) (.cse34 (* 4294967296 .cse29))) (let ((.cse1 (select .cse24 (+ |main_~#str1~0.offset| 3))) (.cse18 (+ main_~i~0 .cse34)) (.cse22 (* .cse29 4294967296)) (.cse21 (select .cse24 1)) (.cse27 (<= .cse35 .cse34)) (.cse26 (< .cse34 .cse35)) (.cse30 (* .cse29 (- 4294967296))) (.cse2 (store .cse20 .cse14 .cse32)) (.cse25 (select .cse20 0)) (.cse33 (select .cse24 (+ |main_~#str1~0.offset| 4)))) (let ((.cse7 (= .cse25 .cse33)) (.cse17 (= (select .cse24 2) (select .cse2 2))) (.cse19 (= (select .cse2 0) .cse33)) (.cse9 (= (select .cse20 .cse14) .cse32)) (.cse0 (let ((.cse31 (select .cse24 0))) (or (and (= .cse31 (select .cse20 (+ |main_~#str1~0.offset| main_~max~0 .cse30 4294967295))) .cse27) (and .cse26 (= (select .cse20 (+ |main_~#str1~0.offset| main_~max~0 .cse30 (- 1))) .cse31))))) (.cse3 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse4 (or (and .cse26 (= (select .cse20 (+ |main_~#str1~0.offset| main_~max~0 .cse30 (- 2))) .cse21)) (and .cse27 (= (select .cse20 (+ |main_~#str1~0.offset| main_~max~0 .cse30 4294967294)) .cse21)))) (.cse5 (<= .cse29 1)) (.cse15 (<= main_~max~0 5)) (.cse6 (or (and .cse26 (= (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse22 1) (+ |main_~#str1~0.offset| main_~max~0))) (and .cse27 (= (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse22) (+ |main_~#str1~0.offset| main_~max~0 4294967295))) (not (= .cse28 0)))) (.cse8 (<= 5 main_~max~0)) (.cse10 (= |main_#t~mem14| |main_#t~mem13|)) (.cse11 (<= 4294967296 .cse18)) (.cse12 (= |main_~#str2~0.offset| 0)) (.cse13 (= |main_~#str1~0.offset| 0)) (.cse16 (= .cse1 (select .cse20 1)))) (or (and .cse0 (= .cse1 (select .cse2 1)) .cse3 .cse4 .cse5 (<= main_~max~0 (+ main_~i~0 3)) .cse6 (<= main_~j~0 2) .cse7 .cse8 (<= main_~i~0 2) .cse9 .cse10 .cse11 .cse12 .cse13 (< 1 .cse14)) (and .cse0 .cse3 .cse4 .cse5 .cse15 .cse6 (<= main_~i~0 4) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= main_~max~0 (+ main_~i~0 1)) .cse16) (and .cse17 .cse0 .cse3 (<= main_~j~0 3) .cse5 (<= .cse18 4294967297) .cse6 .cse8 (<= 3 .cse14) .cse19 .cse9 .cse10 .cse12 .cse11 .cse13 .cse16 (<= (+ main_~max~0 4294967292) .cse18)) (and .cse17 .cse3 .cse5 (= (select .cse20 (+ |main_~#str1~0.offset| main_~j~0 (- 1))) .cse21) (= main_~i~0 0) (= (+ main_~i~0 main_~j~0 .cse22) .cse23) .cse8 (<= main_~j~0 4) .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16) (and .cse0 (<= main_~j~0 1) .cse3 .cse4 .cse5 .cse15 .cse6 (<= 1 main_~j~0) .cse8 (<= .cse18 (+ main_~max~0 4294967294)) (= (select .cse24 (+ |main_~#str1~0.offset| main_~i~0 1)) .cse25) .cse10 .cse11 .cse12 (<= 3 main_~i~0) .cse13 .cse16))))))) [2021-04-16 06:45:16,071 INFO L194 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse23 (+ main_~max~0 4294967295))) (let ((.cse20 (select |#memory_int| |main_~#str2~0.base|)) (.cse15 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse19 (+ |main_~#str1~0.offset| main_~i~0)) (.cse26 (div .cse23 4294967296)) (.cse6 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse17 (select .cse6 (+ |main_~#str1~0.offset| 3))) (.cse14 (+ main_~i~0 (* 4294967296 .cse26))) (.cse22 (* .cse26 4294967296)) (.cse18 (store .cse20 .cse15 (select .cse6 .cse19))) (.cse25 (* .cse26 (- 4294967296))) (.cse21 (select .cse6 1)) (.cse7 (select .cse20 0)) (.cse24 (select .cse6 (+ |main_~#str1~0.offset| 4)))) (let ((.cse12 (= .cse7 .cse24)) (.cse4 (= (select .cse20 (+ |main_~#str1~0.offset| main_~max~0 .cse25 4294967294)) .cse21)) (.cse9 (= |main_~#str2~0.offset| 0)) (.cse0 (= (select .cse6 0) (select .cse20 (+ |main_~#str1~0.offset| main_~max~0 .cse25 4294967295)))) (.cse13 (= (select .cse6 2) (select .cse18 2))) (.cse1 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse2 (<= main_~max~0 5)) (.cse3 (or (not (= .cse19 0)) (= (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse22) (+ |main_~#str1~0.offset| main_~max~0 4294967295)))) (.cse5 (<= 5 main_~max~0)) (.cse16 (= (select .cse18 0) .cse24)) (.cse8 (<= 4294967296 .cse14)) (.cse11 (= |main_~#str1~0.offset| 0)) (.cse10 (= .cse17 (select .cse20 1)))) (or (and .cse0 (<= main_~j~0 1) .cse1 .cse2 (<= main_~i~0 3) .cse3 (<= 1 main_~j~0) .cse4 .cse5 (= (select .cse6 (+ |main_~#str1~0.offset| main_~i~0 1)) .cse7) .cse8 .cse9 (<= 3 main_~i~0) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (<= main_~i~0 4) .cse12 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 (<= main_~max~0 (+ main_~i~0 1))) (and .cse0 .cse13 .cse1 (<= main_~j~0 3) .cse2 (<= .cse14 4294967297) .cse3 .cse4 .cse5 (<= 3 .cse15) .cse16 .cse8 .cse9 .cse11 .cse10) (and .cse0 .cse1 (= .cse17 (select .cse18 1)) .cse2 .cse3 (<= main_~j~0 2) .cse12 .cse4 .cse5 (<= 2 .cse19) .cse8 .cse9 .cse11 (<= .cse14 (+ main_~max~0 4294967293)) (< 1 .cse15)) (and .cse0 .cse13 .cse1 .cse2 (= (select .cse20 (+ |main_~#str1~0.offset| main_~j~0 (- 1))) .cse21) .cse3 (= (+ main_~i~0 main_~j~0 .cse22) .cse23) (<= 4 main_~j~0) .cse5 .cse16 .cse8 .cse11 .cse10)))))) [2021-04-16 06:45:16,071 INFO L194 CegarLoopUtils]: At program point mainEXIT(lines 13 36) the Hoare annotation is: (and (<= 0 main_~i~0) (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5)) [2021-04-16 06:45:16,071 INFO L194 CegarLoopUtils]: At program point mainFINAL(lines 13 36) the Hoare annotation is: (and (<= 0 main_~i~0) (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5)) [2021-04-16 06:45:16,072 INFO L194 CegarLoopUtils]: At program point L32-2(lines 32 35) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |main_~#str1~0.base|)) (.cse11 (+ |main_~#str1~0.offset| main_~i~0))) (let ((.cse25 (div (+ main_~max~0 4294967295) 4294967296)) (.cse16 (select |#memory_int| |main_~#str2~0.base|)) (.cse26 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse23 (select .cse15 .cse11))) (let ((.cse12 (store .cse16 .cse26 .cse23)) (.cse13 (= main_~i~0 0)) (.cse10 (+ main_~i~0 (* 4294967296 .cse25))) (.cse9 (select .cse16 .cse26)) (.cse24 (* .cse25 (- 4294967296))) (.cse14 (select .cse15 1)) (.cse17 (select .cse15 (+ |main_~#str1~0.offset| 4)))) (let ((.cse1 (= (select .cse16 0) .cse17)) (.cse2 (= (select .cse16 (+ |main_~#str1~0.offset| main_~max~0 .cse24 4294967294)) .cse14)) (.cse6 (= (select .cse15 (+ |main_~#str1~0.offset| main_~i~0 1)) .cse9)) (.cse8 (select .cse15 2)) (.cse0 (let ((.cse19 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse18 (select .cse16 (+ |main_~#str1~0.offset| main_~max~0 .cse24 4294967295))) (.cse20 (<= 5 main_~max~0)) (.cse21 (<= main_~max~0 5)) (.cse22 (<= 4294967296 .cse10))) (or (and (= (select .cse15 0) .cse18) .cse19 .cse20 .cse21 .cse22) (and .cse19 (= .cse18 .cse23) .cse13 .cse20 .cse21 .cse22)))) (.cse7 (= (select .cse12 0) .cse17)) (.cse3 (= |main_~#str2~0.offset| 0)) (.cse5 (= |main_~#str1~0.offset| 0)) (.cse4 (= (select .cse15 (+ |main_~#str1~0.offset| 3)) (select .cse16 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 3 main_~i~0) .cse4 .cse5 (<= main_~i~0 3) .cse6) (and (<= main_~j~0 2) .cse0 .cse2 .cse7 (= .cse8 .cse9) (<= 2 main_~j~0) .cse3 .cse5 .cse4 (<= .cse10 4294967297) (<= (+ main_~max~0 4294967292) .cse10)) (and (<= main_~i~0 4) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= main_~max~0 (+ main_~i~0 1))) (and (<= 1 main_~j~0) .cse0 (<= main_~j~0 1) .cse1 .cse2 (<= 2 .cse11) .cse3 .cse5 (<= .cse10 (+ main_~max~0 4294967293)) .cse6) (and (= .cse8 (select .cse12 2)) (<= 3 main_~j~0) .cse0 .cse13 .cse7 (<= main_~j~0 3) .cse3 .cse5 .cse4 (= .cse14 .cse9))))))) [2021-04-16 06:45:16,072 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 13 36) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-04-16 06:45:16,072 INFO L194 CegarLoopUtils]: At program point L32-3(lines 32 35) the Hoare annotation is: (let ((.cse21 (+ main_~max~0 4294967295))) (let ((.cse39 (div .cse21 4294967296))) (let ((.cse40 (* 4294967296 .cse39))) (let ((.cse41 (+ main_~max~0 2147483648)) (.cse1 (+ main_~i~0 .cse40)) (.cse2 (select |#memory_int| |main_~#str1~0.base|)) (.cse34 (+ |main_~#str1~0.offset| main_~i~0))) (let ((.cse13 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse27 (select .cse2 .cse34)) (.cse6 (<= 3 main_~i~0)) (.cse29 (<= main_~i~0 3)) (.cse9 (<= main_~i~0 4)) (.cse20 (* .cse39 4294967296)) (.cse30 (<= 2 main_~i~0)) (.cse16 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse22 (<= 5 main_~max~0)) (.cse26 (<= main_~i~0 2)) (.cse17 (<= .cse39 1)) (.cse23 (<= 4294967296 .cse1)) (.cse35 (<= .cse41 .cse40)) (.cse31 (< .cse40 .cse41)) (.cse18 (select |#memory_int| |main_~#str2~0.base|)) (.cse33 (* .cse39 (- 4294967296)))) (let ((.cse15 (let ((.cse37 (let ((.cse38 (select .cse2 0))) (or (and (= .cse38 (select .cse18 (+ |main_~#str1~0.offset| main_~max~0 .cse33 4294967295))) .cse35) (and .cse31 (= (select .cse18 (+ |main_~#str1~0.offset| main_~max~0 .cse33 (- 1))) .cse38)))))) (or (and .cse37 .cse16 .cse22 .cse17 .cse23 .cse6 .cse29) (and .cse9 .cse37 .cse16 .cse22 (<= 4 main_~i~0) .cse17 .cse23) (and .cse37 .cse16 (<= 1 main_~i~0) .cse22 .cse17 .cse23 (<= main_~i~0 1)) (and (or (and .cse31 (= (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse20 1) (+ |main_~#str1~0.offset| main_~max~0))) (and .cse35 (= (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse20) (+ |main_~#str1~0.offset| main_~max~0 4294967295))) (not (= .cse34 0))) .cse37 .cse16 .cse22 .cse17 .cse23) (and .cse30 .cse37 .cse16 .cse22 .cse26 .cse17 .cse23)))) (.cse19 (select .cse2 1)) (.cse3 (select .cse18 0)) (.cse24 (select .cse2 (+ |main_~#str1~0.offset| 3))) (.cse36 (select .cse2 (+ |main_~#str1~0.offset| 4))) (.cse25 (store .cse18 .cse13 .cse27))) (let ((.cse4 (<= main_~max~0 5)) (.cse12 (= (select .cse2 2) (select .cse25 2))) (.cse14 (= (select .cse25 0) .cse36)) (.cse8 (= .cse24 (select .cse18 1))) (.cse10 (= .cse3 .cse36)) (.cse0 (let ((.cse28 (or (and .cse31 (= (select .cse18 (+ |main_~#str1~0.offset| main_~max~0 .cse33 (- 2))) .cse19)) (and .cse35 (= (select .cse18 (+ |main_~#str1~0.offset| main_~max~0 .cse33 4294967294)) .cse19))))) (or (and .cse28 .cse15 .cse6 .cse29) (and .cse30 .cse28 .cse26 .cse15) (and .cse28 .cse15 (let ((.cse32 (* main_~i~0 (- 1)))) (or (and .cse31 (= .cse19 (select .cse25 (+ |main_~#str1~0.offset| .cse32 main_~max~0 .cse33 (- 2))))) (<= 1 .cse34) (and .cse35 (= (select .cse25 (+ |main_~#str1~0.offset| .cse32 main_~max~0 .cse33 4294967294)) .cse19)))))))) (.cse11 (= (select .cse18 .cse13) .cse27)) (.cse5 (= |main_~#str2~0.offset| 0)) (.cse7 (= |main_~#str1~0.offset| 0))) (or (and (<= 1 main_~j~0) (<= main_~j~0 1) .cse0 (<= .cse1 (+ main_~max~0 4294967294)) (= (select .cse2 (+ |main_~#str1~0.offset| main_~i~0 1)) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse5 .cse7 (<= main_~max~0 (+ main_~i~0 1)) .cse8) (and .cse12 (<= 3 .cse13) .cse14 .cse11 (<= main_~j~0 3) .cse5 .cse15 .cse7 .cse8 (<= .cse1 4294967297) (<= (+ main_~max~0 4294967292) .cse1)) (and (<= main_~max~0 main_~i~0) .cse10 .cse0 .cse4 .cse5 .cse7 .cse8 (<= (div main_~i~0 4294967296) 0)) (and .cse12 .cse16 .cse17 (= (select .cse18 (+ |main_~#str1~0.offset| main_~j~0 (- 1))) .cse19) (= main_~i~0 0) (= (+ main_~i~0 main_~j~0 .cse20) .cse21) .cse22 (<= main_~j~0 4) .cse14 .cse11 .cse23 .cse5 .cse7 .cse8) (and (<= main_~j~0 2) (= .cse24 (select .cse25 1)) .cse10 .cse0 .cse26 .cse11 (<= main_~max~0 (+ main_~i~0 3)) .cse5 .cse7 (< 1 .cse13)))))))))) [2021-04-16 06:45:16,072 INFO L194 CegarLoopUtils]: At program point L32-4(lines 32 35) the Hoare annotation is: (and (<= 0 main_~i~0) (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5)) [2021-04-16 06:45:16,073 INFO L194 CegarLoopUtils]: At program point L26-2(lines 26 29) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |main_~#str2~0.base|)) (.cse19 (div (+ main_~max~0 4294967295) 4294967296))) (let ((.cse18 (* 4294967296 .cse19)) (.cse10 (select .cse15 0)) (.cse17 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse7 (<= main_~max~0 5)) (.cse11 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse12 (select .cse17 2)) (.cse0 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse1 (= .cse10 (select .cse17 (+ |main_~#str1~0.offset| 4)))) (.cse5 (select .cse17 (+ |main_~#str1~0.offset| main_~i~0))) (.cse2 (let ((.cse20 (+ main_~max~0 2147483648)) (.cse21 (+ main_~i~0 main_~j~0 (* .cse19 4294967296)))) (or (and (< .cse18 .cse20) (= .cse21 main_~max~0)) (and (<= .cse20 .cse18) (= .cse21 (+ main_~max~0 4294967296)))))) (.cse16 (* .cse19 (- 4294967296))) (.cse3 (<= 5 main_~max~0)) (.cse8 (= |main_~#str2~0.offset| 0)) (.cse9 (= |main_~#str1~0.offset| 0)) (.cse14 (select .cse17 (+ |main_~#str1~0.offset| 3))) (.cse4 (select .cse15 1)) (.cse6 (+ main_~i~0 .cse18))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 .cse5) (<= .cse6 (+ main_~max~0 4294967294)) .cse7 .cse8 (<= main_~max~0 (+ main_~i~0 2)) .cse9) (and .cse0 (= .cse10 .cse5) .cse2 .cse7 .cse8 .cse9 (< 0 .cse11) (<= 4294967300 .cse6)) (let ((.cse13 (store .cse15 .cse11 .cse5))) (and (= .cse12 (select .cse13 2)) .cse0 .cse1 (= .cse14 (select .cse13 1)) .cse2 (= (select .cse15 (+ |main_~#str1~0.offset| (* main_~i~0 (- 1)) main_~max~0 .cse16 4294967295)) .cse5) .cse3 (<= 3 .cse11) .cse7 .cse8 .cse9 (<= (+ main_~max~0 4294967292) .cse6))) (and (<= (+ main_~max~0 4294967291) .cse6) (= .cse12 (select .cse15 2)) .cse0 .cse1 (= (select .cse15 (+ |main_~#str1~0.offset| main_~max~0 .cse16 4294967295)) .cse5) .cse2 (= (select .cse15 (+ |main_~#str1~0.offset| main_~max~0 .cse16 4294967294)) (select .cse17 1)) .cse3 .cse8 .cse9 (= .cse14 .cse4) (<= .cse6 4294967296)))))) [2021-04-16 06:45:16,073 INFO L194 CegarLoopUtils]: At program point L26-3(lines 26 29) the Hoare annotation is: (let ((.cse19 (+ main_~max~0 4294967295))) (let ((.cse16 (select |#memory_int| |main_~#str2~0.base|)) (.cse5 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse15 (select |#memory_int| |main_~#str1~0.base|)) (.cse23 (div .cse19 4294967296))) (let ((.cse20 (* 4294967296 .cse23)) (.cse24 (select .cse15 (+ |main_~#str1~0.offset| 4))) (.cse18 (select .cse15 (+ |main_~#str1~0.offset| 3))) (.cse17 (select .cse15 2)) (.cse12 (store .cse16 .cse5 (select .cse15 (+ |main_~#str1~0.offset| main_~i~0))))) (let ((.cse0 (= .cse17 (select .cse12 2))) (.cse2 (= .cse18 (select .cse12 1))) (.cse4 (= (select .cse12 0) .cse24)) (.cse6 (<= main_~max~0 5)) (.cse11 (= (select .cse16 0) .cse24)) (.cse13 (* .cse23 (- 4294967296))) (.cse14 (select .cse15 1)) (.cse3 (<= 5 main_~max~0)) (.cse8 (let ((.cse21 (+ main_~max~0 2147483648)) (.cse22 (* .cse23 4294967296))) (or (and (< .cse20 .cse21) (= (+ main_~i~0 main_~j~0 .cse22 1) main_~max~0)) (and (<= .cse21 .cse20) (= (+ main_~i~0 main_~j~0 .cse22) .cse19))))) (.cse1 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse7 (= |main_~#str2~0.offset| 0)) (.cse9 (= |main_~#str1~0.offset| 0)) (.cse10 (+ main_~i~0 .cse20))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 3 .cse5) .cse6 .cse7 .cse8 .cse9 (<= (+ main_~max~0 4294967292) .cse10)) (and .cse0 (<= .cse10 (+ main_~max~0 4294967291)) .cse1 .cse11 .cse2 (= (select .cse12 (+ |main_~#str1~0.offset| (* main_~i~0 (- 1)) main_~max~0 .cse13 4294967294)) .cse14) .cse6 .cse7 (<= 4294967296 .cse10) .cse8 .cse9) (and .cse1 .cse2 .cse11 .cse3 (<= main_~i~0 2) .cse7 (<= main_~max~0 (+ main_~i~0 3)) .cse8 .cse9) (and .cse1 .cse3 .cse4 (<= .cse10 (+ main_~max~0 4294967294)) .cse6 .cse7 (<= main_~max~0 (+ main_~i~0 2)) .cse8 .cse9) (and (= (select .cse15 0) (select .cse16 (+ |main_~#str1~0.offset| main_~max~0 .cse13 4294967295))) (= .cse17 (select .cse16 2)) .cse1 .cse11 (= (select .cse16 (+ |main_~#str1~0.offset| main_~max~0 .cse13 4294967294)) .cse14) .cse3 (<= .cse10 4294967295) (<= (+ main_~max~0 4294967290) .cse10) .cse7 (= .cse18 (select .cse16 1)) .cse8 .cse9) (and (<= .cse10 4294967300) .cse1 (= main_~j~0 0) .cse7 (<= .cse10 .cse19) .cse9 (<= main_~max~0 (+ main_~i~0 1)) (<= 4294967300 .cse10))))))) [2021-04-16 06:45:16,073 INFO L194 CegarLoopUtils]: At program point L26-4(lines 26 29) the Hoare annotation is: (let ((.cse4 (+ main_~max~0 4294967295))) (let ((.cse3 (div .cse4 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296))) (.cse5 (+ main_~i~0 (* 4294967296 .cse3))) (.cse0 (select |#memory_int| |main_~#str1~0.base|)) (.cse1 (select |#memory_int| |main_~#str2~0.base|))) (and (= (select .cse0 0) (select .cse1 (+ |main_~#str1~0.offset| main_~max~0 .cse2 4294967295))) (= (select .cse0 2) (select .cse1 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select .cse1 0) (select .cse0 (+ |main_~#str1~0.offset| 4))) (= (select .cse1 (+ |main_~#str1~0.offset| main_~max~0 .cse2 4294967294)) (select .cse0 1)) (= (+ main_~i~0 main_~j~0 (* .cse3 4294967296)) .cse4) (<= 5 main_~max~0) (<= .cse5 4294967295) (<= (+ main_~max~0 4294967290) .cse5) (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select .cse0 (+ |main_~#str1~0.offset| 3)) (select .cse1 1)))))) [2021-04-16 06:45:16,073 INFO L194 CegarLoopUtils]: At program point L18-2(lines 18 20) the Hoare annotation is: (let ((.cse8 (div (+ main_~max~0 4294967295) 4294967296))) (let ((.cse1 (* 4294967296 .cse8)) (.cse5 (<= 5 main_~max~0)) (.cse0 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse6 (<= 0 main_~i~0)) (.cse2 (< 0 .cse8)) (.cse7 (<= main_~max~0 5)) (.cse3 (= |main_~#str2~0.offset| 0)) (.cse4 (= |main_~#str1~0.offset| 0))) (or (and (<= main_~i~0 4) .cse0 (<= .cse1 (+ main_~max~0 4294967291)) .cse2 .cse3 .cse4 (<= main_~max~0 (+ main_~i~0 1))) (and .cse0 .cse5 .cse6 .cse2 .cse7 .cse3 .cse4 (<= (+ main_~i~0 .cse1) 4294967297)) (and .cse0 .cse5 (<= main_~i~0 2) (<= main_~max~0 (+ main_~i~0 3)) .cse3 .cse4) (and .cse0 .cse6 (<= (+ main_~i~0 2) main_~max~0) .cse2 .cse7 .cse3 (<= 3 main_~i~0) .cse4)))) [2021-04-16 06:45:16,073 INFO L194 CegarLoopUtils]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse0 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse1 (<= 5 main_~max~0)) (.cse2 (<= main_~max~0 5)) (.cse3 (= |main_~#str2~0.offset| 0)) (.cse4 (= |main_~#str1~0.offset| 0)) (.cse5 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 4294967300 .cse5) (<= (div main_~i~0 4294967296) 0)) (let ((.cse6 (+ main_~i~0 2))) (and .cse0 (<= .cse6 main_~max~0) (<= main_~max~0 .cse6) .cse3 (<= 3 main_~i~0) .cse4 (<= main_~i~0 3))) (and .cse0 .cse1 (<= main_~i~0 2) (<= main_~max~0 (+ main_~i~0 3)) .cse3 .cse4) (and .cse0 .cse1 (<= 0 main_~i~0) .cse2 .cse3 .cse4 (<= .cse5 4294967297)))) [2021-04-16 06:45:16,074 INFO L194 CegarLoopUtils]: At program point L18-4(lines 18 20) the Hoare annotation is: (and (<= main_~max~0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 5 main_~max~0) (<= main_~max~0 5) (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= (div main_~i~0 4294967296) 0)) [2021-04-16 06:45:16,074 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2021-04-16 06:45:16,074 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-04-16 06:45:16,074 INFO L194 CegarLoopUtils]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-04-16 06:45:16,074 INFO L194 CegarLoopUtils]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-04-16 06:45:16,074 INFO L194 CegarLoopUtils]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-04-16 06:45:16,074 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-04-16 06:45:16,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.04 06:45:16 BoogieIcfgContainer [2021-04-16 06:45:16,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-16 06:45:16,135 INFO L168 Benchmark]: Toolchain (without parser) took 26000.55 ms. Allocated memory was 188.7 MB in the beginning and 342.9 MB in the end (delta: 154.1 MB). Free memory was 155.9 MB in the beginning and 273.8 MB in the end (delta: -118.0 MB). Peak memory consumption was 191.7 MB. Max. memory is 8.0 GB. [2021-04-16 06:45:16,137 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 188.7 MB. Free memory was 172.0 MB in the beginning and 171.9 MB in the end (delta: 85.0 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-04-16 06:45:16,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.43 ms. Allocated memory is still 188.7 MB. Free memory was 155.6 MB in the beginning and 145.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-04-16 06:45:16,137 INFO L168 Benchmark]: Boogie Preprocessor took 58.40 ms. Allocated memory is still 188.7 MB. Free memory was 145.5 MB in the beginning and 172.4 MB in the end (delta: -26.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-04-16 06:45:16,137 INFO L168 Benchmark]: RCFGBuilder took 317.36 ms. Allocated memory is still 188.7 MB. Free memory was 172.4 MB in the beginning and 156.2 MB in the end (delta: 16.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-04-16 06:45:16,137 INFO L168 Benchmark]: TraceAbstraction took 25434.18 ms. Allocated memory was 188.7 MB in the beginning and 342.9 MB in the end (delta: 154.1 MB). Free memory was 155.7 MB in the beginning and 273.8 MB in the end (delta: -118.2 MB). Peak memory consumption was 191.7 MB. Max. memory is 8.0 GB. [2021-04-16 06:45:16,138 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 188.7 MB. Free memory was 172.0 MB in the beginning and 171.9 MB in the end (delta: 85.0 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 185.43 ms. Allocated memory is still 188.7 MB. Free memory was 155.6 MB in the beginning and 145.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 58.40 ms. Allocated memory is still 188.7 MB. Free memory was 145.5 MB in the beginning and 172.4 MB in the end (delta: -26.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 317.36 ms. Allocated memory is still 188.7 MB. Free memory was 172.4 MB in the beginning and 156.2 MB in the end (delta: 16.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 25434.18 ms. Allocated memory was 188.7 MB in the beginning and 342.9 MB in the end (delta: 154.1 MB). Free memory was 155.7 MB in the beginning and 273.8 MB in the end (delta: -118.2 MB). Peak memory consumption was 191.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18701.3ms, OverallIterations: 17, TraceHistogramMax: 6, EmptinessCheckTime: 27.4ms, AutomataDifference: 10830.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 6608.6ms, InitialAbstractionConstructionTime: 9.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 323 SDtfs, 491 SDslu, 759 SDs, 0 SdLazy, 5025 SolverSat, 658 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3089.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2150 ImplicationChecksByTransitivity, 12043.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=16, InterpolantAutomatonStates: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 201.0ms AutomataMinimizationTime, 17 MinimizatonAttempts, 78 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 27 LocationsWithAnnotation, 165 PreInvPairs, 225 NumberOfFragments, 13705 HoareAnnotationTreeSize, 165 FomulaSimplifications, 56980 FormulaSimplificationTreeSizeReduction, 464.8ms HoareSimplificationTime, 27 FomulaSimplificationsInter, 1075772 FormulaSimplificationTreeSizeReductionInter, 6125.7ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((((((((((((unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][2] && !(str1 == str2)) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][1]) && 5 <= max) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && 3 <= j + str2) && max <= 5) && str2 == 0) && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 == max + 4294967295))) && str1 == 0) && max + 4294967292 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) || ((((((((((unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][2] && i + 4294967296 * ((max + 4294967295) / 4294967296) <= max + 4294967291) && !(str1 == str2)) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][1]) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][str1 + i * -1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]) && max <= 5) && str2 == 0) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 == max + 4294967295))) && str1 == 0)) || ((((((((!(str1 == str2) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][1]) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && 5 <= max) && i <= 2) && str2 == 0) && max <= i + 3) && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 == max + 4294967295))) && str1 == 0)) || ((((((((!(str1 == str2) && 5 <= max) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= max + 4294967294) && max <= 5) && str2 == 0) && max <= i + 2) && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 == max + 4294967295))) && str1 == 0)) || (((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && !(str1 == str2)) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]) && 5 <= max) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= 4294967295) && max + 4294967290 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && str2 == 0) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1]) && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 == max + 4294967295))) && str1 == 0)) || (((((((i + 4294967296 * ((max + 4294967295) / 4294967296) <= 4294967300 && !(str1 == str2)) && j == 0) && str2 == 0) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= max + 4294967295) && str1 == 0) && max <= i + 1) && 4294967300 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((((((1 <= j && j <= 1) && (((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2] == unknown-#memory_int-unknown[str1][1]) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1])) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)))) && 3 <= i) && i <= 3) || (((2 <= i && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2] == unknown-#memory_int-unknown[str1][1]) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]))) && i <= 2) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))))) || ((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2] == unknown-#memory_int-unknown[str1][1]) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1])) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)))) && (((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str1][1] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][str1 + i * -1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2]) || 1 <= str1 + i) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][str1 + i * -1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]))))) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= max + 4294967294) && unknown-#memory_int-unknown[str1][str1 + i + 1] == unknown-#memory_int-unknown[str2][0]) && max <= 5) && str2 == 0) && 3 <= i) && str1 == 0) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1]) || ((((((((i <= 4 && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && (((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2] == unknown-#memory_int-unknown[str1][1]) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1])) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)))) && 3 <= i) && i <= 3) || (((2 <= i && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2] == unknown-#memory_int-unknown[str1][1]) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]))) && i <= 2) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))))) || ((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2] == unknown-#memory_int-unknown[str1][1]) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1])) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)))) && (((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str1][1] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][str1 + i * -1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2]) || 1 <= str1 + i) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][str1 + i * -1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]))))) && unknown-#memory_int-unknown[str2][j + str2] == unknown-#memory_int-unknown[str1][str1 + i]) && max <= 5) && str2 == 0) && str1 == 0) && max <= i + 1) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1])) || ((((((((((unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][2] && 3 <= j + str2) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && unknown-#memory_int-unknown[str2][j + str2] == unknown-#memory_int-unknown[str1][str1 + i]) && j <= 3) && str2 == 0) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)))) && str1 == 0) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1]) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= 4294967297) && max + 4294967292 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || (((((((max <= i && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && (((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2] == unknown-#memory_int-unknown[str1][1]) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1])) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)))) && 3 <= i) && i <= 3) || (((2 <= i && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2] == unknown-#memory_int-unknown[str1][1]) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]))) && i <= 2) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))))) || ((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2] == unknown-#memory_int-unknown[str1][1]) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1])) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)))) && (((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str1][1] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][str1 + i * -1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2]) || 1 <= str1 + i) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][str1 + i * -1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]))))) && max <= 5) && str2 == 0) && str1 == 0) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1]) && i / 4294967296 <= 0)) || (((((((((((((unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][2] && !(str1 == str2)) && (max + 4294967295) / 4294967296 <= 1) && unknown-#memory_int-unknown[str2][str1 + j + -1] == unknown-#memory_int-unknown[str1][1]) && i == 0) && i + j + (max + 4294967295) / 4294967296 * 4294967296 == max + 4294967295) && 5 <= max) && j <= 4) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && unknown-#memory_int-unknown[str2][j + str2] == unknown-#memory_int-unknown[str1][str1 + i]) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && str2 == 0) && str1 == 0) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1])) || (((((((((j <= 2 && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][1]) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && (((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2] == unknown-#memory_int-unknown[str1][1]) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1])) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)))) && 3 <= i) && i <= 3) || (((2 <= i && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2] == unknown-#memory_int-unknown[str1][1]) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]))) && i <= 2) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))))) || ((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2] == unknown-#memory_int-unknown[str1][1]) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1])) && ((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 3 <= i) && i <= 3) || ((((((i <= 4 && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && 4 <= i) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0])) && !(str1 == str2)) && 1 <= i) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((((((((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 + 1 == str1 + max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) || !(str1 + i == 0)) && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296))) || ((((((2 <= i && ((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296)) || (4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -1] == unknown-#memory_int-unknown[str1][0]))) && !(str1 == str2)) && 5 <= max) && i <= 2) && (max + 4294967295) / 4294967296 <= 1) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)))) && (((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && unknown-#memory_int-unknown[str1][1] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][str1 + i * -1 + max + (max + 4294967295) / 4294967296 * -4294967296 + -2]) || 1 <= str1 + i) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][str1 + i * -1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]))))) && i <= 2) && unknown-#memory_int-unknown[str2][j + str2] == unknown-#memory_int-unknown[str1][str1 + i]) && max <= i + 3) && str2 == 0) && str1 == 0) && 1 < j + str2) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((!(str1 == str2) && 5 <= max) && max <= 5) && str2 == 0) && str1 == 0) && 4294967300 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i / 4294967296 <= 0) || ((((((!(str1 == str2) && i + 2 <= max) && max <= i + 2) && str2 == 0) && 3 <= i) && str1 == 0) && i <= 3)) || (((((!(str1 == str2) && 5 <= max) && i <= 2) && max <= i + 3) && str2 == 0) && str1 == 0)) || ((((((!(str1 == str2) && 5 <= max) && 0 <= i) && max <= 5) && str2 == 0) && str1 == 0) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= 4294967297) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: (0 <= i && 0 < (max + 4294967295) / 4294967296) && max <= 5 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! Received shutdown request...