/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/string-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:33,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:33,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:33,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:33,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:33,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:33,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:33,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:33,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:33,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:33,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:33,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:33,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:33,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:33,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:33,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:33,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:33,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:33,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:33,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:33,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:33,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:33,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:33,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:33,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:33,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:33,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:33,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:33,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:33,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:33,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:33,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:33,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:33,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:33,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:33,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:33,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:33,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:33,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:33,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:33,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:34,000 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:27:34,021 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:34,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:34,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:34,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:34,024 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:34,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:34,024 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:34,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:34,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:34,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:34,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:34,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:34,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:34,027 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:34,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:34,027 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:34,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:34,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:34,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:34,028 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:34,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:34,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:34,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:34,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:34,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:34,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:34,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:34,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:34,030 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:34,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:34,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:34,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:34,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:34,344 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:34,344 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:34,345 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-1.i [2020-07-10 15:27:34,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a666ed53/1d5853ef87f2486b8445948bb92356db/FLAGc616589f5 [2020-07-10 15:27:34,930 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:34,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i [2020-07-10 15:27:34,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a666ed53/1d5853ef87f2486b8445948bb92356db/FLAGc616589f5 [2020-07-10 15:27:35,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a666ed53/1d5853ef87f2486b8445948bb92356db [2020-07-10 15:27:35,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:35,325 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:35,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:35,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:35,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:35,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:35" (1/1) ... [2020-07-10 15:27:35,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53cb4b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:35, skipping insertion in model container [2020-07-10 15:27:35,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:35" (1/1) ... [2020-07-10 15:27:35,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:35,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:35,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:35,550 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:35,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:35,697 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:35,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:35 WrapperNode [2020-07-10 15:27:35,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:35,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:35,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:35,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:35,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:35" (1/1) ... [2020-07-10 15:27:35,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:35" (1/1) ... [2020-07-10 15:27:35,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:35" (1/1) ... [2020-07-10 15:27:35,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:35" (1/1) ... [2020-07-10 15:27:35,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:35" (1/1) ... [2020-07-10 15:27:35,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:35" (1/1) ... [2020-07-10 15:27:35,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:35" (1/1) ... [2020-07-10 15:27:35,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:35,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:35,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:35,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:35,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:35" (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 [2020-07-10 15:27:35,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:35,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:35,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:27:35,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:35,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:35,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:35,819 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:27:35,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:27:35,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:35,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-10 15:27:35,820 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:35,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:27:35,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:27:35,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:27:35,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:27:35,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:35,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:36,282 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:36,282 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-10 15:27:36,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:36 BoogieIcfgContainer [2020-07-10 15:27:36,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:36,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:36,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:36,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:36,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:35" (1/3) ... [2020-07-10 15:27:36,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d85fe6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:36, skipping insertion in model container [2020-07-10 15:27:36,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:35" (2/3) ... [2020-07-10 15:27:36,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d85fe6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:36, skipping insertion in model container [2020-07-10 15:27:36,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:36" (3/3) ... [2020-07-10 15:27:36,296 INFO L109 eAbstractionObserver]: Analyzing ICFG string-1.i [2020-07-10 15:27:36,307 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:36,314 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:36,326 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:36,350 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:36,350 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:36,350 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:36,351 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:36,351 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:36,351 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:36,351 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:36,351 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-10 15:27:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:27:36,379 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:36,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:36,380 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:36,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:36,387 INFO L82 PathProgramCache]: Analyzing trace with hash -522531256, now seen corresponding path program 1 times [2020-07-10 15:27:36,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:36,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131261507] [2020-07-10 15:27:36,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:36,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {38#true} is VALID [2020-07-10 15:27:36,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-10 15:27:36,641 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #115#return; {38#true} is VALID [2020-07-10 15:27:36,647 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:36,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {38#true} is VALID [2020-07-10 15:27:36,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-10 15:27:36,650 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #115#return; {38#true} is VALID [2020-07-10 15:27:36,651 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret14 := main(); {38#true} is VALID [2020-07-10 15:27:36,654 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {43#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:36,655 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#(= 0 main_~i~0)} assume !(~i~0 < 5); {39#false} is VALID [2020-07-10 15:27:36,656 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {39#false} is VALID [2020-07-10 15:27:36,657 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {39#false} is VALID [2020-07-10 15:27:36,657 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#false} assume !(~i~0 < 5); {39#false} is VALID [2020-07-10 15:27:36,658 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {39#false} is VALID [2020-07-10 15:27:36,658 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {39#false} is VALID [2020-07-10 15:27:36,659 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-10 15:27:36,659 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} ~nc_B~0 := 0; {39#false} is VALID [2020-07-10 15:27:36,660 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-10 15:27:36,660 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {39#false} is VALID [2020-07-10 15:27:36,661 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-10 15:27:36,661 INFO L280 TraceCheckUtils]: 17: Hoare triple {39#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {39#false} is VALID [2020-07-10 15:27:36,662 INFO L263 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {39#false} is VALID [2020-07-10 15:27:36,663 INFO L280 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-10 15:27:36,664 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-10 15:27:36,665 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-10 15:27:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:36,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131261507] [2020-07-10 15:27:36,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:36,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:27:36,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750487522] [2020-07-10 15:27:36,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 15:27:36,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:36,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:27:36,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:36,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:27:36,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:36,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:27:36,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:36,769 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 4 states. [2020-07-10 15:27:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:37,167 INFO L93 Difference]: Finished difference Result 73 states and 109 transitions. [2020-07-10 15:27:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:27:37,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 15:27:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2020-07-10 15:27:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2020-07-10 15:27:37,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2020-07-10 15:27:37,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:37,381 INFO L225 Difference]: With dead ends: 73 [2020-07-10 15:27:37,381 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 15:27:37,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 15:27:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2020-07-10 15:27:37,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:37,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2020-07-10 15:27:37,435 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2020-07-10 15:27:37,435 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2020-07-10 15:27:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:37,441 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 15:27:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 15:27:37,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:37,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:37,442 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2020-07-10 15:27:37,442 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2020-07-10 15:27:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:37,447 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 15:27:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 15:27:37,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:37,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:37,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:37,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:27:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2020-07-10 15:27:37,453 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2020-07-10 15:27:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:37,453 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2020-07-10 15:27:37,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:27:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-10 15:27:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:37,455 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:37,455 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:37,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:37,455 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:37,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:37,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1816798436, now seen corresponding path program 1 times [2020-07-10 15:27:37,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:37,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264288096] [2020-07-10 15:27:37,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:37,563 INFO L280 TraceCheckUtils]: 0: Hoare triple {263#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {256#true} is VALID [2020-07-10 15:27:37,563 INFO L280 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2020-07-10 15:27:37,564 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #115#return; {256#true} is VALID [2020-07-10 15:27:37,565 INFO L263 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {263#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:37,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {263#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {256#true} is VALID [2020-07-10 15:27:37,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2020-07-10 15:27:37,566 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #115#return; {256#true} is VALID [2020-07-10 15:27:37,567 INFO L263 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret14 := main(); {256#true} is VALID [2020-07-10 15:27:37,568 INFO L280 TraceCheckUtils]: 5: Hoare triple {256#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {261#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:37,570 INFO L280 TraceCheckUtils]: 6: Hoare triple {261#(= 0 main_~i~0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {261#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:37,571 INFO L280 TraceCheckUtils]: 7: Hoare triple {261#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {262#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:37,572 INFO L280 TraceCheckUtils]: 8: Hoare triple {262#(<= main_~i~0 1)} assume !(~i~0 < 5); {257#false} is VALID [2020-07-10 15:27:37,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {257#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {257#false} is VALID [2020-07-10 15:27:37,573 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {257#false} is VALID [2020-07-10 15:27:37,573 INFO L280 TraceCheckUtils]: 11: Hoare triple {257#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {257#false} is VALID [2020-07-10 15:27:37,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {257#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {257#false} is VALID [2020-07-10 15:27:37,574 INFO L280 TraceCheckUtils]: 13: Hoare triple {257#false} assume !(~i~0 < 5); {257#false} is VALID [2020-07-10 15:27:37,574 INFO L280 TraceCheckUtils]: 14: Hoare triple {257#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {257#false} is VALID [2020-07-10 15:27:37,574 INFO L280 TraceCheckUtils]: 15: Hoare triple {257#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {257#false} is VALID [2020-07-10 15:27:37,575 INFO L280 TraceCheckUtils]: 16: Hoare triple {257#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {257#false} is VALID [2020-07-10 15:27:37,575 INFO L280 TraceCheckUtils]: 17: Hoare triple {257#false} assume !(0 != #t~mem6);havoc #t~mem6; {257#false} is VALID [2020-07-10 15:27:37,575 INFO L280 TraceCheckUtils]: 18: Hoare triple {257#false} ~nc_B~0 := 0; {257#false} is VALID [2020-07-10 15:27:37,576 INFO L280 TraceCheckUtils]: 19: Hoare triple {257#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {257#false} is VALID [2020-07-10 15:27:37,576 INFO L280 TraceCheckUtils]: 20: Hoare triple {257#false} assume !(0 != #t~mem8);havoc #t~mem8; {257#false} is VALID [2020-07-10 15:27:37,576 INFO L280 TraceCheckUtils]: 21: Hoare triple {257#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {257#false} is VALID [2020-07-10 15:27:37,577 INFO L280 TraceCheckUtils]: 22: Hoare triple {257#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {257#false} is VALID [2020-07-10 15:27:37,577 INFO L280 TraceCheckUtils]: 23: Hoare triple {257#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {257#false} is VALID [2020-07-10 15:27:37,577 INFO L263 TraceCheckUtils]: 24: Hoare triple {257#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {257#false} is VALID [2020-07-10 15:27:37,577 INFO L280 TraceCheckUtils]: 25: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2020-07-10 15:27:37,578 INFO L280 TraceCheckUtils]: 26: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2020-07-10 15:27:37,578 INFO L280 TraceCheckUtils]: 27: Hoare triple {257#false} assume !false; {257#false} is VALID [2020-07-10 15:27:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:27:37,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264288096] [2020-07-10 15:27:37,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472591931] [2020-07-10 15:27:37,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:37,633 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:27:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:37,654 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:37,730 INFO L263 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2020-07-10 15:27:37,730 INFO L280 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {256#true} is VALID [2020-07-10 15:27:37,731 INFO L280 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2020-07-10 15:27:37,731 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #115#return; {256#true} is VALID [2020-07-10 15:27:37,731 INFO L263 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret14 := main(); {256#true} is VALID [2020-07-10 15:27:37,733 INFO L280 TraceCheckUtils]: 5: Hoare triple {256#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {282#(<= main_~i~0 0)} is VALID [2020-07-10 15:27:37,733 INFO L280 TraceCheckUtils]: 6: Hoare triple {282#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {282#(<= main_~i~0 0)} is VALID [2020-07-10 15:27:37,734 INFO L280 TraceCheckUtils]: 7: Hoare triple {282#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {262#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:37,735 INFO L280 TraceCheckUtils]: 8: Hoare triple {262#(<= main_~i~0 1)} assume !(~i~0 < 5); {257#false} is VALID [2020-07-10 15:27:37,735 INFO L280 TraceCheckUtils]: 9: Hoare triple {257#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {257#false} is VALID [2020-07-10 15:27:37,736 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {257#false} is VALID [2020-07-10 15:27:37,736 INFO L280 TraceCheckUtils]: 11: Hoare triple {257#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {257#false} is VALID [2020-07-10 15:27:37,736 INFO L280 TraceCheckUtils]: 12: Hoare triple {257#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {257#false} is VALID [2020-07-10 15:27:37,737 INFO L280 TraceCheckUtils]: 13: Hoare triple {257#false} assume !(~i~0 < 5); {257#false} is VALID [2020-07-10 15:27:37,737 INFO L280 TraceCheckUtils]: 14: Hoare triple {257#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {257#false} is VALID [2020-07-10 15:27:37,737 INFO L280 TraceCheckUtils]: 15: Hoare triple {257#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {257#false} is VALID [2020-07-10 15:27:37,738 INFO L280 TraceCheckUtils]: 16: Hoare triple {257#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {257#false} is VALID [2020-07-10 15:27:37,738 INFO L280 TraceCheckUtils]: 17: Hoare triple {257#false} assume !(0 != #t~mem6);havoc #t~mem6; {257#false} is VALID [2020-07-10 15:27:37,738 INFO L280 TraceCheckUtils]: 18: Hoare triple {257#false} ~nc_B~0 := 0; {257#false} is VALID [2020-07-10 15:27:37,738 INFO L280 TraceCheckUtils]: 19: Hoare triple {257#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {257#false} is VALID [2020-07-10 15:27:37,739 INFO L280 TraceCheckUtils]: 20: Hoare triple {257#false} assume !(0 != #t~mem8);havoc #t~mem8; {257#false} is VALID [2020-07-10 15:27:37,739 INFO L280 TraceCheckUtils]: 21: Hoare triple {257#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {257#false} is VALID [2020-07-10 15:27:37,739 INFO L280 TraceCheckUtils]: 22: Hoare triple {257#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {257#false} is VALID [2020-07-10 15:27:37,740 INFO L280 TraceCheckUtils]: 23: Hoare triple {257#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {257#false} is VALID [2020-07-10 15:27:37,740 INFO L263 TraceCheckUtils]: 24: Hoare triple {257#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {257#false} is VALID [2020-07-10 15:27:37,740 INFO L280 TraceCheckUtils]: 25: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2020-07-10 15:27:37,740 INFO L280 TraceCheckUtils]: 26: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2020-07-10 15:27:37,741 INFO L280 TraceCheckUtils]: 27: Hoare triple {257#false} assume !false; {257#false} is VALID [2020-07-10 15:27:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:27:37,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:37,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-10 15:27:37,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775719185] [2020-07-10 15:27:37,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-10 15:27:37,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:37,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:27:37,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:37,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:27:37,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:37,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:27:37,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:27:37,788 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 6 states. [2020-07-10 15:27:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,062 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2020-07-10 15:27:38,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:27:38,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-10 15:27:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:27:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2020-07-10 15:27:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:27:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2020-07-10 15:27:38,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2020-07-10 15:27:38,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:38,188 INFO L225 Difference]: With dead ends: 65 [2020-07-10 15:27:38,189 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 15:27:38,190 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:27:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 15:27:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2020-07-10 15:27:38,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:38,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 34 states. [2020-07-10 15:27:38,207 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 34 states. [2020-07-10 15:27:38,207 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 34 states. [2020-07-10 15:27:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,211 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 15:27:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 15:27:38,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:38,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:38,212 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 44 states. [2020-07-10 15:27:38,213 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 44 states. [2020-07-10 15:27:38,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,216 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 15:27:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 15:27:38,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:38,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:38,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:38,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:27:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2020-07-10 15:27:38,220 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2020-07-10 15:27:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:38,221 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2020-07-10 15:27:38,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:27:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-10 15:27:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 15:27:38,222 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:38,222 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:38,436 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:27:38,437 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:38,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:38,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1067646812, now seen corresponding path program 2 times [2020-07-10 15:27:38,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:38,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5888440] [2020-07-10 15:27:38,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:38,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {584#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {576#true} is VALID [2020-07-10 15:27:38,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {576#true} assume true; {576#true} is VALID [2020-07-10 15:27:38,548 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {576#true} {576#true} #115#return; {576#true} is VALID [2020-07-10 15:27:38,549 INFO L263 TraceCheckUtils]: 0: Hoare triple {576#true} call ULTIMATE.init(); {584#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:38,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {576#true} is VALID [2020-07-10 15:27:38,549 INFO L280 TraceCheckUtils]: 2: Hoare triple {576#true} assume true; {576#true} is VALID [2020-07-10 15:27:38,550 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {576#true} {576#true} #115#return; {576#true} is VALID [2020-07-10 15:27:38,550 INFO L263 TraceCheckUtils]: 4: Hoare triple {576#true} call #t~ret14 := main(); {576#true} is VALID [2020-07-10 15:27:38,551 INFO L280 TraceCheckUtils]: 5: Hoare triple {576#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {581#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:38,552 INFO L280 TraceCheckUtils]: 6: Hoare triple {581#(= 0 main_~i~0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {581#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:38,553 INFO L280 TraceCheckUtils]: 7: Hoare triple {581#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {582#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:38,553 INFO L280 TraceCheckUtils]: 8: Hoare triple {582#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {582#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:38,554 INFO L280 TraceCheckUtils]: 9: Hoare triple {582#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {583#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:38,555 INFO L280 TraceCheckUtils]: 10: Hoare triple {583#(<= main_~i~0 2)} assume !(~i~0 < 5); {577#false} is VALID [2020-07-10 15:27:38,555 INFO L280 TraceCheckUtils]: 11: Hoare triple {577#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {577#false} is VALID [2020-07-10 15:27:38,556 INFO L280 TraceCheckUtils]: 12: Hoare triple {577#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {577#false} is VALID [2020-07-10 15:27:38,556 INFO L280 TraceCheckUtils]: 13: Hoare triple {577#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {577#false} is VALID [2020-07-10 15:27:38,556 INFO L280 TraceCheckUtils]: 14: Hoare triple {577#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {577#false} is VALID [2020-07-10 15:27:38,557 INFO L280 TraceCheckUtils]: 15: Hoare triple {577#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {577#false} is VALID [2020-07-10 15:27:38,557 INFO L280 TraceCheckUtils]: 16: Hoare triple {577#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {577#false} is VALID [2020-07-10 15:27:38,557 INFO L280 TraceCheckUtils]: 17: Hoare triple {577#false} assume !(~i~0 < 5); {577#false} is VALID [2020-07-10 15:27:38,558 INFO L280 TraceCheckUtils]: 18: Hoare triple {577#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {577#false} is VALID [2020-07-10 15:27:38,558 INFO L280 TraceCheckUtils]: 19: Hoare triple {577#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {577#false} is VALID [2020-07-10 15:27:38,558 INFO L280 TraceCheckUtils]: 20: Hoare triple {577#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {577#false} is VALID [2020-07-10 15:27:38,558 INFO L280 TraceCheckUtils]: 21: Hoare triple {577#false} assume !(0 != #t~mem6);havoc #t~mem6; {577#false} is VALID [2020-07-10 15:27:38,559 INFO L280 TraceCheckUtils]: 22: Hoare triple {577#false} ~nc_B~0 := 0; {577#false} is VALID [2020-07-10 15:27:38,559 INFO L280 TraceCheckUtils]: 23: Hoare triple {577#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {577#false} is VALID [2020-07-10 15:27:38,559 INFO L280 TraceCheckUtils]: 24: Hoare triple {577#false} assume !(0 != #t~mem8);havoc #t~mem8; {577#false} is VALID [2020-07-10 15:27:38,559 INFO L280 TraceCheckUtils]: 25: Hoare triple {577#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {577#false} is VALID [2020-07-10 15:27:38,560 INFO L280 TraceCheckUtils]: 26: Hoare triple {577#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {577#false} is VALID [2020-07-10 15:27:38,560 INFO L280 TraceCheckUtils]: 27: Hoare triple {577#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {577#false} is VALID [2020-07-10 15:27:38,560 INFO L263 TraceCheckUtils]: 28: Hoare triple {577#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {577#false} is VALID [2020-07-10 15:27:38,561 INFO L280 TraceCheckUtils]: 29: Hoare triple {577#false} ~cond := #in~cond; {577#false} is VALID [2020-07-10 15:27:38,561 INFO L280 TraceCheckUtils]: 30: Hoare triple {577#false} assume 0 == ~cond; {577#false} is VALID [2020-07-10 15:27:38,561 INFO L280 TraceCheckUtils]: 31: Hoare triple {577#false} assume !false; {577#false} is VALID [2020-07-10 15:27:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:27:38,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5888440] [2020-07-10 15:27:38,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994897803] [2020-07-10 15:27:38,564 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:38,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:27:38,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:38,610 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:27:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:38,624 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:38,699 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:38,715 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:38,772 INFO L263 TraceCheckUtils]: 0: Hoare triple {576#true} call ULTIMATE.init(); {576#true} is VALID [2020-07-10 15:27:38,772 INFO L280 TraceCheckUtils]: 1: Hoare triple {576#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {576#true} is VALID [2020-07-10 15:27:38,773 INFO L280 TraceCheckUtils]: 2: Hoare triple {576#true} assume true; {576#true} is VALID [2020-07-10 15:27:38,773 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {576#true} {576#true} #115#return; {576#true} is VALID [2020-07-10 15:27:38,773 INFO L263 TraceCheckUtils]: 4: Hoare triple {576#true} call #t~ret14 := main(); {576#true} is VALID [2020-07-10 15:27:38,773 INFO L280 TraceCheckUtils]: 5: Hoare triple {576#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {576#true} is VALID [2020-07-10 15:27:38,774 INFO L280 TraceCheckUtils]: 6: Hoare triple {576#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {576#true} is VALID [2020-07-10 15:27:38,774 INFO L280 TraceCheckUtils]: 7: Hoare triple {576#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {576#true} is VALID [2020-07-10 15:27:38,774 INFO L280 TraceCheckUtils]: 8: Hoare triple {576#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {576#true} is VALID [2020-07-10 15:27:38,775 INFO L280 TraceCheckUtils]: 9: Hoare triple {576#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {576#true} is VALID [2020-07-10 15:27:38,775 INFO L280 TraceCheckUtils]: 10: Hoare triple {576#true} assume !(~i~0 < 5); {576#true} is VALID [2020-07-10 15:27:38,775 INFO L280 TraceCheckUtils]: 11: Hoare triple {576#true} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {576#true} is VALID [2020-07-10 15:27:38,776 INFO L280 TraceCheckUtils]: 12: Hoare triple {576#true} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {576#true} is VALID [2020-07-10 15:27:38,776 INFO L280 TraceCheckUtils]: 13: Hoare triple {576#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {576#true} is VALID [2020-07-10 15:27:38,776 INFO L280 TraceCheckUtils]: 14: Hoare triple {576#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {576#true} is VALID [2020-07-10 15:27:38,776 INFO L280 TraceCheckUtils]: 15: Hoare triple {576#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {576#true} is VALID [2020-07-10 15:27:38,777 INFO L280 TraceCheckUtils]: 16: Hoare triple {576#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {576#true} is VALID [2020-07-10 15:27:38,777 INFO L280 TraceCheckUtils]: 17: Hoare triple {576#true} assume !(~i~0 < 5); {576#true} is VALID [2020-07-10 15:27:38,777 INFO L280 TraceCheckUtils]: 18: Hoare triple {576#true} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {576#true} is VALID [2020-07-10 15:27:38,777 INFO L280 TraceCheckUtils]: 19: Hoare triple {576#true} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {576#true} is VALID [2020-07-10 15:27:38,778 INFO L280 TraceCheckUtils]: 20: Hoare triple {576#true} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {576#true} is VALID [2020-07-10 15:27:38,778 INFO L280 TraceCheckUtils]: 21: Hoare triple {576#true} assume !(0 != #t~mem6);havoc #t~mem6; {576#true} is VALID [2020-07-10 15:27:38,779 INFO L280 TraceCheckUtils]: 22: Hoare triple {576#true} ~nc_B~0 := 0; {654#(<= main_~nc_B~0 0)} is VALID [2020-07-10 15:27:38,780 INFO L280 TraceCheckUtils]: 23: Hoare triple {654#(<= main_~nc_B~0 0)} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {654#(<= main_~nc_B~0 0)} is VALID [2020-07-10 15:27:38,780 INFO L280 TraceCheckUtils]: 24: Hoare triple {654#(<= main_~nc_B~0 0)} assume !(0 != #t~mem8);havoc #t~mem8; {654#(<= main_~nc_B~0 0)} is VALID [2020-07-10 15:27:38,781 INFO L280 TraceCheckUtils]: 25: Hoare triple {654#(<= main_~nc_B~0 0)} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {664#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} is VALID [2020-07-10 15:27:38,782 INFO L280 TraceCheckUtils]: 26: Hoare triple {664#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {664#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} is VALID [2020-07-10 15:27:38,783 INFO L280 TraceCheckUtils]: 27: Hoare triple {664#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {671#(= 1 main_~found~0)} is VALID [2020-07-10 15:27:38,784 INFO L263 TraceCheckUtils]: 28: Hoare triple {671#(= 1 main_~found~0)} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {675#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:27:38,785 INFO L280 TraceCheckUtils]: 29: Hoare triple {675#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {679#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:27:38,786 INFO L280 TraceCheckUtils]: 30: Hoare triple {679#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {577#false} is VALID [2020-07-10 15:27:38,787 INFO L280 TraceCheckUtils]: 31: Hoare triple {577#false} assume !false; {577#false} is VALID [2020-07-10 15:27:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-10 15:27:38,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:27:38,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2020-07-10 15:27:38,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164064560] [2020-07-10 15:27:38,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-10 15:27:38,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:38,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:27:38,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:38,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:27:38,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:38,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:27:38,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:38,828 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 7 states. [2020-07-10 15:27:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:39,096 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-10 15:27:39,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:27:39,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-10 15:27:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-10 15:27:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-10 15:27:39,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2020-07-10 15:27:39,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:39,172 INFO L225 Difference]: With dead ends: 50 [2020-07-10 15:27:39,173 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 15:27:39,173 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:27:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 15:27:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-10 15:27:39,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:39,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-10 15:27:39,197 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 15:27:39,198 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 15:27:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:39,200 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-10 15:27:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-10 15:27:39,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:39,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:39,204 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 15:27:39,205 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 15:27:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:39,209 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-10 15:27:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-10 15:27:39,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:39,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:39,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:39,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:27:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-10 15:27:39,213 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 32 [2020-07-10 15:27:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:39,213 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-10 15:27:39,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:27:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-10 15:27:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 15:27:39,215 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:39,215 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:39,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:39,429 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:39,430 INFO L82 PathProgramCache]: Analyzing trace with hash 939255927, now seen corresponding path program 1 times [2020-07-10 15:27:39,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:39,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450087672] [2020-07-10 15:27:39,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {885#true} is VALID [2020-07-10 15:27:39,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {885#true} assume true; {885#true} is VALID [2020-07-10 15:27:39,555 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {885#true} {885#true} #115#return; {885#true} is VALID [2020-07-10 15:27:39,555 INFO L263 TraceCheckUtils]: 0: Hoare triple {885#true} call ULTIMATE.init(); {893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:39,556 INFO L280 TraceCheckUtils]: 1: Hoare triple {893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {885#true} is VALID [2020-07-10 15:27:39,556 INFO L280 TraceCheckUtils]: 2: Hoare triple {885#true} assume true; {885#true} is VALID [2020-07-10 15:27:39,556 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} #115#return; {885#true} is VALID [2020-07-10 15:27:39,557 INFO L263 TraceCheckUtils]: 4: Hoare triple {885#true} call #t~ret14 := main(); {885#true} is VALID [2020-07-10 15:27:39,558 INFO L280 TraceCheckUtils]: 5: Hoare triple {885#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {890#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:39,559 INFO L280 TraceCheckUtils]: 6: Hoare triple {890#(= 0 main_~i~0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {890#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:39,559 INFO L280 TraceCheckUtils]: 7: Hoare triple {890#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {891#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:39,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {891#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {891#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:39,561 INFO L280 TraceCheckUtils]: 9: Hoare triple {891#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {892#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:39,562 INFO L280 TraceCheckUtils]: 10: Hoare triple {892#(<= main_~i~0 2)} assume !(~i~0 < 5); {886#false} is VALID [2020-07-10 15:27:39,562 INFO L280 TraceCheckUtils]: 11: Hoare triple {886#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {886#false} is VALID [2020-07-10 15:27:39,562 INFO L280 TraceCheckUtils]: 12: Hoare triple {886#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {886#false} is VALID [2020-07-10 15:27:39,562 INFO L280 TraceCheckUtils]: 13: Hoare triple {886#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {886#false} is VALID [2020-07-10 15:27:39,563 INFO L280 TraceCheckUtils]: 14: Hoare triple {886#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {886#false} is VALID [2020-07-10 15:27:39,563 INFO L280 TraceCheckUtils]: 15: Hoare triple {886#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {886#false} is VALID [2020-07-10 15:27:39,563 INFO L280 TraceCheckUtils]: 16: Hoare triple {886#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {886#false} is VALID [2020-07-10 15:27:39,563 INFO L280 TraceCheckUtils]: 17: Hoare triple {886#false} assume !(~i~0 < 5); {886#false} is VALID [2020-07-10 15:27:39,564 INFO L280 TraceCheckUtils]: 18: Hoare triple {886#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {886#false} is VALID [2020-07-10 15:27:39,564 INFO L280 TraceCheckUtils]: 19: Hoare triple {886#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {886#false} is VALID [2020-07-10 15:27:39,564 INFO L280 TraceCheckUtils]: 20: Hoare triple {886#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {886#false} is VALID [2020-07-10 15:27:39,564 INFO L280 TraceCheckUtils]: 21: Hoare triple {886#false} assume !(0 != #t~mem6);havoc #t~mem6; {886#false} is VALID [2020-07-10 15:27:39,565 INFO L280 TraceCheckUtils]: 22: Hoare triple {886#false} ~nc_B~0 := 0; {886#false} is VALID [2020-07-10 15:27:39,565 INFO L280 TraceCheckUtils]: 23: Hoare triple {886#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {886#false} is VALID [2020-07-10 15:27:39,565 INFO L280 TraceCheckUtils]: 24: Hoare triple {886#false} assume !!(0 != #t~mem8);havoc #t~mem8;#t~post9 := ~nc_B~0;~nc_B~0 := 1 + #t~post9;havoc #t~post9; {886#false} is VALID [2020-07-10 15:27:39,565 INFO L280 TraceCheckUtils]: 25: Hoare triple {886#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {886#false} is VALID [2020-07-10 15:27:39,566 INFO L280 TraceCheckUtils]: 26: Hoare triple {886#false} assume !(0 != #t~mem8);havoc #t~mem8; {886#false} is VALID [2020-07-10 15:27:39,566 INFO L280 TraceCheckUtils]: 27: Hoare triple {886#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {886#false} is VALID [2020-07-10 15:27:39,566 INFO L280 TraceCheckUtils]: 28: Hoare triple {886#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {886#false} is VALID [2020-07-10 15:27:39,566 INFO L280 TraceCheckUtils]: 29: Hoare triple {886#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {886#false} is VALID [2020-07-10 15:27:39,567 INFO L263 TraceCheckUtils]: 30: Hoare triple {886#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {886#false} is VALID [2020-07-10 15:27:39,567 INFO L280 TraceCheckUtils]: 31: Hoare triple {886#false} ~cond := #in~cond; {886#false} is VALID [2020-07-10 15:27:39,567 INFO L280 TraceCheckUtils]: 32: Hoare triple {886#false} assume 0 == ~cond; {886#false} is VALID [2020-07-10 15:27:39,567 INFO L280 TraceCheckUtils]: 33: Hoare triple {886#false} assume !false; {886#false} is VALID [2020-07-10 15:27:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-10 15:27:39,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450087672] [2020-07-10 15:27:39,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981616793] [2020-07-10 15:27:39,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,609 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:27:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,620 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:39,672 INFO L263 TraceCheckUtils]: 0: Hoare triple {885#true} call ULTIMATE.init(); {885#true} is VALID [2020-07-10 15:27:39,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {885#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {885#true} is VALID [2020-07-10 15:27:39,673 INFO L280 TraceCheckUtils]: 2: Hoare triple {885#true} assume true; {885#true} is VALID [2020-07-10 15:27:39,673 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} #115#return; {885#true} is VALID [2020-07-10 15:27:39,673 INFO L263 TraceCheckUtils]: 4: Hoare triple {885#true} call #t~ret14 := main(); {885#true} is VALID [2020-07-10 15:27:39,674 INFO L280 TraceCheckUtils]: 5: Hoare triple {885#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {912#(<= main_~i~0 0)} is VALID [2020-07-10 15:27:39,675 INFO L280 TraceCheckUtils]: 6: Hoare triple {912#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {912#(<= main_~i~0 0)} is VALID [2020-07-10 15:27:39,676 INFO L280 TraceCheckUtils]: 7: Hoare triple {912#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {891#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:39,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {891#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {891#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:39,677 INFO L280 TraceCheckUtils]: 9: Hoare triple {891#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {892#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:39,678 INFO L280 TraceCheckUtils]: 10: Hoare triple {892#(<= main_~i~0 2)} assume !(~i~0 < 5); {886#false} is VALID [2020-07-10 15:27:39,678 INFO L280 TraceCheckUtils]: 11: Hoare triple {886#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {886#false} is VALID [2020-07-10 15:27:39,679 INFO L280 TraceCheckUtils]: 12: Hoare triple {886#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {886#false} is VALID [2020-07-10 15:27:39,679 INFO L280 TraceCheckUtils]: 13: Hoare triple {886#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {886#false} is VALID [2020-07-10 15:27:39,679 INFO L280 TraceCheckUtils]: 14: Hoare triple {886#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {886#false} is VALID [2020-07-10 15:27:39,679 INFO L280 TraceCheckUtils]: 15: Hoare triple {886#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {886#false} is VALID [2020-07-10 15:27:39,680 INFO L280 TraceCheckUtils]: 16: Hoare triple {886#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {886#false} is VALID [2020-07-10 15:27:39,680 INFO L280 TraceCheckUtils]: 17: Hoare triple {886#false} assume !(~i~0 < 5); {886#false} is VALID [2020-07-10 15:27:39,680 INFO L280 TraceCheckUtils]: 18: Hoare triple {886#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {886#false} is VALID [2020-07-10 15:27:39,680 INFO L280 TraceCheckUtils]: 19: Hoare triple {886#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {886#false} is VALID [2020-07-10 15:27:39,681 INFO L280 TraceCheckUtils]: 20: Hoare triple {886#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {886#false} is VALID [2020-07-10 15:27:39,681 INFO L280 TraceCheckUtils]: 21: Hoare triple {886#false} assume !(0 != #t~mem6);havoc #t~mem6; {886#false} is VALID [2020-07-10 15:27:39,681 INFO L280 TraceCheckUtils]: 22: Hoare triple {886#false} ~nc_B~0 := 0; {886#false} is VALID [2020-07-10 15:27:39,681 INFO L280 TraceCheckUtils]: 23: Hoare triple {886#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {886#false} is VALID [2020-07-10 15:27:39,682 INFO L280 TraceCheckUtils]: 24: Hoare triple {886#false} assume !!(0 != #t~mem8);havoc #t~mem8;#t~post9 := ~nc_B~0;~nc_B~0 := 1 + #t~post9;havoc #t~post9; {886#false} is VALID [2020-07-10 15:27:39,682 INFO L280 TraceCheckUtils]: 25: Hoare triple {886#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {886#false} is VALID [2020-07-10 15:27:39,682 INFO L280 TraceCheckUtils]: 26: Hoare triple {886#false} assume !(0 != #t~mem8);havoc #t~mem8; {886#false} is VALID [2020-07-10 15:27:39,682 INFO L280 TraceCheckUtils]: 27: Hoare triple {886#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {886#false} is VALID [2020-07-10 15:27:39,682 INFO L280 TraceCheckUtils]: 28: Hoare triple {886#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {886#false} is VALID [2020-07-10 15:27:39,683 INFO L280 TraceCheckUtils]: 29: Hoare triple {886#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {886#false} is VALID [2020-07-10 15:27:39,683 INFO L263 TraceCheckUtils]: 30: Hoare triple {886#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {886#false} is VALID [2020-07-10 15:27:39,683 INFO L280 TraceCheckUtils]: 31: Hoare triple {886#false} ~cond := #in~cond; {886#false} is VALID [2020-07-10 15:27:39,683 INFO L280 TraceCheckUtils]: 32: Hoare triple {886#false} assume 0 == ~cond; {886#false} is VALID [2020-07-10 15:27:39,684 INFO L280 TraceCheckUtils]: 33: Hoare triple {886#false} assume !false; {886#false} is VALID [2020-07-10 15:27:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-10 15:27:39,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:39,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-10 15:27:39,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353712670] [2020-07-10 15:27:39,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-07-10 15:27:39,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:39,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:27:39,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:39,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:27:39,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:39,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:27:39,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:39,730 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 7 states. [2020-07-10 15:27:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,039 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2020-07-10 15:27:40,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:27:40,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-07-10 15:27:40,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2020-07-10 15:27:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2020-07-10 15:27:40,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2020-07-10 15:27:40,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:40,152 INFO L225 Difference]: With dead ends: 79 [2020-07-10 15:27:40,152 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 15:27:40,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 15:27:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2020-07-10 15:27:40,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:40,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 40 states. [2020-07-10 15:27:40,174 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 40 states. [2020-07-10 15:27:40,174 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 40 states. [2020-07-10 15:27:40,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,177 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-07-10 15:27:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2020-07-10 15:27:40,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:40,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:40,178 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 54 states. [2020-07-10 15:27:40,178 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 54 states. [2020-07-10 15:27:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,181 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-07-10 15:27:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2020-07-10 15:27:40,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:40,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:40,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:40,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 15:27:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2020-07-10 15:27:40,185 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2020-07-10 15:27:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:40,186 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2020-07-10 15:27:40,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:27:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-07-10 15:27:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:27:40,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:40,187 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:40,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:40,401 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:40,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1936372809, now seen corresponding path program 2 times [2020-07-10 15:27:40,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:40,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087330471] [2020-07-10 15:27:40,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:40,502 INFO L280 TraceCheckUtils]: 0: Hoare triple {1283#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1274#true} is VALID [2020-07-10 15:27:40,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {1274#true} assume true; {1274#true} is VALID [2020-07-10 15:27:40,503 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1274#true} {1274#true} #115#return; {1274#true} is VALID [2020-07-10 15:27:40,504 INFO L263 TraceCheckUtils]: 0: Hoare triple {1274#true} call ULTIMATE.init(); {1283#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:40,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {1283#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1274#true} is VALID [2020-07-10 15:27:40,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {1274#true} assume true; {1274#true} is VALID [2020-07-10 15:27:40,505 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1274#true} {1274#true} #115#return; {1274#true} is VALID [2020-07-10 15:27:40,505 INFO L263 TraceCheckUtils]: 4: Hoare triple {1274#true} call #t~ret14 := main(); {1274#true} is VALID [2020-07-10 15:27:40,506 INFO L280 TraceCheckUtils]: 5: Hoare triple {1274#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1279#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:40,506 INFO L280 TraceCheckUtils]: 6: Hoare triple {1279#(= 0 main_~i~0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1279#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:40,507 INFO L280 TraceCheckUtils]: 7: Hoare triple {1279#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1280#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:40,507 INFO L280 TraceCheckUtils]: 8: Hoare triple {1280#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1280#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:40,508 INFO L280 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1281#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:40,509 INFO L280 TraceCheckUtils]: 10: Hoare triple {1281#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1281#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:40,509 INFO L280 TraceCheckUtils]: 11: Hoare triple {1281#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1282#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:40,510 INFO L280 TraceCheckUtils]: 12: Hoare triple {1282#(<= main_~i~0 3)} assume !(~i~0 < 5); {1275#false} is VALID [2020-07-10 15:27:40,510 INFO L280 TraceCheckUtils]: 13: Hoare triple {1275#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1275#false} is VALID [2020-07-10 15:27:40,510 INFO L280 TraceCheckUtils]: 14: Hoare triple {1275#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {1275#false} is VALID [2020-07-10 15:27:40,510 INFO L280 TraceCheckUtils]: 15: Hoare triple {1275#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1275#false} is VALID [2020-07-10 15:27:40,511 INFO L280 TraceCheckUtils]: 16: Hoare triple {1275#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1275#false} is VALID [2020-07-10 15:27:40,511 INFO L280 TraceCheckUtils]: 17: Hoare triple {1275#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1275#false} is VALID [2020-07-10 15:27:40,511 INFO L280 TraceCheckUtils]: 18: Hoare triple {1275#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1275#false} is VALID [2020-07-10 15:27:40,511 INFO L280 TraceCheckUtils]: 19: Hoare triple {1275#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1275#false} is VALID [2020-07-10 15:27:40,512 INFO L280 TraceCheckUtils]: 20: Hoare triple {1275#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1275#false} is VALID [2020-07-10 15:27:40,512 INFO L280 TraceCheckUtils]: 21: Hoare triple {1275#false} assume !(~i~0 < 5); {1275#false} is VALID [2020-07-10 15:27:40,512 INFO L280 TraceCheckUtils]: 22: Hoare triple {1275#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1275#false} is VALID [2020-07-10 15:27:40,512 INFO L280 TraceCheckUtils]: 23: Hoare triple {1275#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {1275#false} is VALID [2020-07-10 15:27:40,512 INFO L280 TraceCheckUtils]: 24: Hoare triple {1275#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1275#false} is VALID [2020-07-10 15:27:40,513 INFO L280 TraceCheckUtils]: 25: Hoare triple {1275#false} assume !(0 != #t~mem6);havoc #t~mem6; {1275#false} is VALID [2020-07-10 15:27:40,513 INFO L280 TraceCheckUtils]: 26: Hoare triple {1275#false} ~nc_B~0 := 0; {1275#false} is VALID [2020-07-10 15:27:40,513 INFO L280 TraceCheckUtils]: 27: Hoare triple {1275#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1275#false} is VALID [2020-07-10 15:27:40,513 INFO L280 TraceCheckUtils]: 28: Hoare triple {1275#false} assume !!(0 != #t~mem8);havoc #t~mem8;#t~post9 := ~nc_B~0;~nc_B~0 := 1 + #t~post9;havoc #t~post9; {1275#false} is VALID [2020-07-10 15:27:40,514 INFO L280 TraceCheckUtils]: 29: Hoare triple {1275#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1275#false} is VALID [2020-07-10 15:27:40,514 INFO L280 TraceCheckUtils]: 30: Hoare triple {1275#false} assume !(0 != #t~mem8);havoc #t~mem8; {1275#false} is VALID [2020-07-10 15:27:40,514 INFO L280 TraceCheckUtils]: 31: Hoare triple {1275#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1275#false} is VALID [2020-07-10 15:27:40,514 INFO L280 TraceCheckUtils]: 32: Hoare triple {1275#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1275#false} is VALID [2020-07-10 15:27:40,514 INFO L280 TraceCheckUtils]: 33: Hoare triple {1275#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1275#false} is VALID [2020-07-10 15:27:40,515 INFO L263 TraceCheckUtils]: 34: Hoare triple {1275#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1275#false} is VALID [2020-07-10 15:27:40,515 INFO L280 TraceCheckUtils]: 35: Hoare triple {1275#false} ~cond := #in~cond; {1275#false} is VALID [2020-07-10 15:27:40,515 INFO L280 TraceCheckUtils]: 36: Hoare triple {1275#false} assume 0 == ~cond; {1275#false} is VALID [2020-07-10 15:27:40,515 INFO L280 TraceCheckUtils]: 37: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2020-07-10 15:27:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-10 15:27:40,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087330471] [2020-07-10 15:27:40,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481973181] [2020-07-10 15:27:40,518 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:40,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:27:40,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:40,559 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:27:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:40,574 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:40,645 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-07-10 15:27:40,646 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:40,685 INFO L263 TraceCheckUtils]: 0: Hoare triple {1274#true} call ULTIMATE.init(); {1274#true} is VALID [2020-07-10 15:27:40,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {1274#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1274#true} is VALID [2020-07-10 15:27:40,685 INFO L280 TraceCheckUtils]: 2: Hoare triple {1274#true} assume true; {1274#true} is VALID [2020-07-10 15:27:40,685 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1274#true} {1274#true} #115#return; {1274#true} is VALID [2020-07-10 15:27:40,686 INFO L263 TraceCheckUtils]: 4: Hoare triple {1274#true} call #t~ret14 := main(); {1274#true} is VALID [2020-07-10 15:27:40,686 INFO L280 TraceCheckUtils]: 5: Hoare triple {1274#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1274#true} is VALID [2020-07-10 15:27:40,686 INFO L280 TraceCheckUtils]: 6: Hoare triple {1274#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1274#true} is VALID [2020-07-10 15:27:40,686 INFO L280 TraceCheckUtils]: 7: Hoare triple {1274#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1274#true} is VALID [2020-07-10 15:27:40,687 INFO L280 TraceCheckUtils]: 8: Hoare triple {1274#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1274#true} is VALID [2020-07-10 15:27:40,687 INFO L280 TraceCheckUtils]: 9: Hoare triple {1274#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1274#true} is VALID [2020-07-10 15:27:40,687 INFO L280 TraceCheckUtils]: 10: Hoare triple {1274#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1274#true} is VALID [2020-07-10 15:27:40,687 INFO L280 TraceCheckUtils]: 11: Hoare triple {1274#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1274#true} is VALID [2020-07-10 15:27:40,688 INFO L280 TraceCheckUtils]: 12: Hoare triple {1274#true} assume !(~i~0 < 5); {1274#true} is VALID [2020-07-10 15:27:40,688 INFO L280 TraceCheckUtils]: 13: Hoare triple {1274#true} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1274#true} is VALID [2020-07-10 15:27:40,688 INFO L280 TraceCheckUtils]: 14: Hoare triple {1274#true} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {1274#true} is VALID [2020-07-10 15:27:40,688 INFO L280 TraceCheckUtils]: 15: Hoare triple {1274#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1274#true} is VALID [2020-07-10 15:27:40,688 INFO L280 TraceCheckUtils]: 16: Hoare triple {1274#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1274#true} is VALID [2020-07-10 15:27:40,689 INFO L280 TraceCheckUtils]: 17: Hoare triple {1274#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1274#true} is VALID [2020-07-10 15:27:40,689 INFO L280 TraceCheckUtils]: 18: Hoare triple {1274#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1274#true} is VALID [2020-07-10 15:27:40,689 INFO L280 TraceCheckUtils]: 19: Hoare triple {1274#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1274#true} is VALID [2020-07-10 15:27:40,689 INFO L280 TraceCheckUtils]: 20: Hoare triple {1274#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1274#true} is VALID [2020-07-10 15:27:40,690 INFO L280 TraceCheckUtils]: 21: Hoare triple {1274#true} assume !(~i~0 < 5); {1274#true} is VALID [2020-07-10 15:27:40,690 INFO L280 TraceCheckUtils]: 22: Hoare triple {1274#true} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1274#true} is VALID [2020-07-10 15:27:40,690 INFO L280 TraceCheckUtils]: 23: Hoare triple {1274#true} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {1274#true} is VALID [2020-07-10 15:27:40,690 INFO L280 TraceCheckUtils]: 24: Hoare triple {1274#true} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1274#true} is VALID [2020-07-10 15:27:40,691 INFO L280 TraceCheckUtils]: 25: Hoare triple {1274#true} assume !(0 != #t~mem6);havoc #t~mem6; {1274#true} is VALID [2020-07-10 15:27:40,691 INFO L280 TraceCheckUtils]: 26: Hoare triple {1274#true} ~nc_B~0 := 0; {1274#true} is VALID [2020-07-10 15:27:40,691 INFO L280 TraceCheckUtils]: 27: Hoare triple {1274#true} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1274#true} is VALID [2020-07-10 15:27:40,691 INFO L280 TraceCheckUtils]: 28: Hoare triple {1274#true} assume !!(0 != #t~mem8);havoc #t~mem8;#t~post9 := ~nc_B~0;~nc_B~0 := 1 + #t~post9;havoc #t~post9; {1274#true} is VALID [2020-07-10 15:27:40,691 INFO L280 TraceCheckUtils]: 29: Hoare triple {1274#true} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1274#true} is VALID [2020-07-10 15:27:40,692 INFO L280 TraceCheckUtils]: 30: Hoare triple {1274#true} assume !(0 != #t~mem8);havoc #t~mem8; {1274#true} is VALID [2020-07-10 15:27:40,692 INFO L280 TraceCheckUtils]: 31: Hoare triple {1274#true} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1274#true} is VALID [2020-07-10 15:27:40,692 INFO L280 TraceCheckUtils]: 32: Hoare triple {1274#true} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1274#true} is VALID [2020-07-10 15:27:40,693 INFO L280 TraceCheckUtils]: 33: Hoare triple {1274#true} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1386#(or (= 1 main_~found~0) (= 0 main_~found~0))} is VALID [2020-07-10 15:27:40,694 INFO L263 TraceCheckUtils]: 34: Hoare triple {1386#(or (= 1 main_~found~0) (= 0 main_~found~0))} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1390#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:27:40,695 INFO L280 TraceCheckUtils]: 35: Hoare triple {1390#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1394#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:27:40,696 INFO L280 TraceCheckUtils]: 36: Hoare triple {1394#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1275#false} is VALID [2020-07-10 15:27:40,696 INFO L280 TraceCheckUtils]: 37: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2020-07-10 15:27:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-10 15:27:40,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:27:40,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2020-07-10 15:27:40,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329171809] [2020-07-10 15:27:40,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-10 15:27:40,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:40,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:40,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:40,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:40,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:40,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:40,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:27:40,732 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2020-07-10 15:27:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,870 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2020-07-10 15:27:40,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:27:40,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-10 15:27:40,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-10 15:27:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-10 15:27:40,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-10 15:27:40,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:40,911 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:27:40,912 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:27:40,912 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:27:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:27:40,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:40,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:40,913 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:40,913 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,914 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:27:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:40,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:40,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:40,914 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:40,915 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,915 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:27:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:40,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:40,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:40,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:40,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:27:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:27:40,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-10 15:27:40,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:40,916 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:27:40,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:40,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:41,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:41,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:27:41,273 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:27:41,273 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 15:27:41,273 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:27:41,273 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:27:41,274 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:27:41,274 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:27:41,274 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:27:41,274 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:27:41,274 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 15:27:41,274 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:27:41,274 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:27:41,274 INFO L264 CegarLoopResult]: At program point L35-3(lines 35 36) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2020-07-10 15:27:41,274 INFO L268 CegarLoopResult]: For program point L35-4(lines 18 61) no Hoare annotation was computed. [2020-07-10 15:27:41,274 INFO L268 CegarLoopResult]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2020-07-10 15:27:41,275 INFO L264 CegarLoopResult]: At program point L31-3(lines 31 32) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2020-07-10 15:27:41,275 INFO L268 CegarLoopResult]: For program point L31-4(lines 31 32) no Hoare annotation was computed. [2020-07-10 15:27:41,275 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 17 61) no Hoare annotation was computed. [2020-07-10 15:27:41,275 INFO L268 CegarLoopResult]: For program point L44(lines 44 53) no Hoare annotation was computed. [2020-07-10 15:27:41,275 INFO L264 CegarLoopResult]: At program point L44-2(lines 42 54) the Hoare annotation is: (or (= 1 main_~found~0) (and (<= 0 main_~j~0) (<= main_~nc_B~0 0)) (= 0 main_~found~0)) [2020-07-10 15:27:41,275 INFO L268 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2020-07-10 15:27:41,275 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-10 15:27:41,276 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2020-07-10 15:27:41,276 INFO L268 CegarLoopResult]: For program point L58-1(line 58) no Hoare annotation was computed. [2020-07-10 15:27:41,276 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 17 61) no Hoare annotation was computed. [2020-07-10 15:27:41,276 INFO L268 CegarLoopResult]: For program point L42-2(lines 42 54) no Hoare annotation was computed. [2020-07-10 15:27:41,276 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 17 61) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-10 15:27:41,276 INFO L268 CegarLoopResult]: For program point L26-2(lines 26 27) no Hoare annotation was computed. [2020-07-10 15:27:41,276 INFO L264 CegarLoopResult]: At program point L26-3(lines 26 27) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2020-07-10 15:27:41,276 INFO L268 CegarLoopResult]: For program point L26-4(lines 26 27) no Hoare annotation was computed. [2020-07-10 15:27:41,277 INFO L268 CegarLoopResult]: For program point L22-2(lines 22 23) no Hoare annotation was computed. [2020-07-10 15:27:41,277 INFO L264 CegarLoopResult]: At program point L22-3(lines 22 23) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2020-07-10 15:27:41,277 INFO L268 CegarLoopResult]: For program point L22-4(lines 22 23) no Hoare annotation was computed. [2020-07-10 15:27:41,277 INFO L268 CegarLoopResult]: For program point L35-1(lines 35 36) no Hoare annotation was computed. [2020-07-10 15:27:41,277 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 7 12) the Hoare annotation is: true [2020-07-10 15:27:41,277 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 7 12) no Hoare annotation was computed. [2020-07-10 15:27:41,277 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-10 15:27:41,277 INFO L268 CegarLoopResult]: For program point L8(lines 8 10) no Hoare annotation was computed. [2020-07-10 15:27:41,277 INFO L268 CegarLoopResult]: For program point L8-2(lines 7 12) no Hoare annotation was computed. [2020-07-10 15:27:41,278 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-10 15:27:41,281 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:41,282 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:27:41,283 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:27:41,283 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:41,283 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:41,284 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:41,284 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:41,284 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-10 15:27:41,284 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-10 15:27:41,284 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 15:27:41,284 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:27:41,284 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:27:41,284 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:41,284 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:41,284 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-10 15:27:41,284 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-10 15:27:41,285 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 15:27:41,285 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:27:41,285 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:27:41,285 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-10 15:27:41,285 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:27:41,285 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:27:41,285 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:41,285 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:41,285 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2020-07-10 15:27:41,285 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2020-07-10 15:27:41,285 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-10 15:27:41,285 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:27:41,286 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:27:41,287 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-10 15:27:41,287 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-10 15:27:41,287 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-10 15:27:41,287 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-10 15:27:41,287 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:27:41,287 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-10 15:27:41,288 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:27:41,288 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:27:41,288 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-10 15:27:41,288 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:27:41,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:41 BoogieIcfgContainer [2020-07-10 15:27:41,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:41,302 INFO L168 Benchmark]: Toolchain (without parser) took 5976.98 ms. Allocated memory was 144.2 MB in the beginning and 274.7 MB in the end (delta: 130.5 MB). Free memory was 102.5 MB in the beginning and 131.7 MB in the end (delta: -29.2 MB). Peak memory consumption was 101.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:41,302 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:41,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.70 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 102.3 MB in the beginning and 182.1 MB in the end (delta: -79.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:41,313 INFO L168 Benchmark]: Boogie Preprocessor took 48.26 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 180.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:41,313 INFO L168 Benchmark]: RCFGBuilder took 541.06 ms. Allocated memory is still 203.4 MB. Free memory was 180.2 MB in the beginning and 150.9 MB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:41,314 INFO L168 Benchmark]: TraceAbstraction took 5009.44 ms. Allocated memory was 203.4 MB in the beginning and 274.7 MB in the end (delta: 71.3 MB). Free memory was 150.3 MB in the beginning and 131.7 MB in the end (delta: 18.6 MB). Peak memory consumption was 89.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:41,321 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 369.70 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 102.3 MB in the beginning and 182.1 MB in the end (delta: -79.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.26 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 180.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 541.06 ms. Allocated memory is still 203.4 MB. Free memory was 180.2 MB in the beginning and 150.9 MB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5009.44 ms. Allocated memory was 203.4 MB in the beginning and 274.7 MB in the end (delta: 71.3 MB). Free memory was 150.3 MB in the beginning and 131.7 MB in the end (delta: 18.6 MB). Peak memory consumption was 89.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 1 == found || 0 == found - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 == found || 0 == found - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 == found || 0 == found - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: (1 == found || (0 <= j && nc_B <= 0)) || 0 == found - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 == found || 0 == found - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.7s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 139 SDtfs, 74 SDslu, 305 SDs, 0 SdLazy, 257 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 30 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 16 PreInvPairs, 30 NumberOfFragments, 65 HoareAnnotationTreeSize, 16 FomulaSimplifications, 87 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 24 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 286 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 13046 SizeOfPredicates, 10 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 57/80 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...