/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/invert_string-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:50,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:50,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:50,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:50,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:50,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:50,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:50,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:50,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:50,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:50,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:50,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:50,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:50,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:50,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:50,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:50,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:50,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:50,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:50,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:50,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:50,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:50,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:50,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:50,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:50,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:50,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:50,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:50,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:50,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:50,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:50,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:50,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:50,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:50,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:50,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:50,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:50,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:50,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:50,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:50,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:50,860 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:50,869 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:50,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:50,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:50,871 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:50,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:50,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:50,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:50,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:50,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:50,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:50,872 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:50,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:50,873 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:50,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:50,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:50,873 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:50,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:50,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:50,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:50,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:50,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:50,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:50,875 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:51,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:51,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:51,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:51,187 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:51,188 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:51,188 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-1.c [2020-07-10 20:21:51,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5991a1b8f/1c87f4a141e048538acd9db1be444e60/FLAGa3564110e [2020-07-10 20:21:51,760 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:51,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-1.c [2020-07-10 20:21:51,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5991a1b8f/1c87f4a141e048538acd9db1be444e60/FLAGa3564110e [2020-07-10 20:21:52,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5991a1b8f/1c87f4a141e048538acd9db1be444e60 [2020-07-10 20:21:52,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:52,141 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:52,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:52,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:52,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:52,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:52" (1/1) ... [2020-07-10 20:21:52,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d81a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:52, skipping insertion in model container [2020-07-10 20:21:52,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:52" (1/1) ... [2020-07-10 20:21:52,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:52,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:52,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:52,396 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:52,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:52,444 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:52,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:52 WrapperNode [2020-07-10 20:21:52,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:52,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:52,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:52,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:52,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:52" (1/1) ... [2020-07-10 20:21:52,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:52" (1/1) ... [2020-07-10 20:21:52,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:52" (1/1) ... [2020-07-10 20:21:52,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:52" (1/1) ... [2020-07-10 20:21:52,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:52" (1/1) ... [2020-07-10 20:21:52,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:52" (1/1) ... [2020-07-10 20:21:52,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:52" (1/1) ... [2020-07-10 20:21:52,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:52,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:52,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:52,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:52,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:52" (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 20:21:52,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:52,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:52,656 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:52,656 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:52,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:52,656 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:52,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:52,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-10 20:21:52,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-10 20:21:52,657 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:52,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:52,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:52,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:52,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:52,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:52,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:53,103 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:53,104 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:21:53,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:53 BoogieIcfgContainer [2020-07-10 20:21:53,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:53,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:53,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:53,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:53,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:52" (1/3) ... [2020-07-10 20:21:53,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310b4791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:53, skipping insertion in model container [2020-07-10 20:21:53,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:52" (2/3) ... [2020-07-10 20:21:53,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310b4791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:53, skipping insertion in model container [2020-07-10 20:21:53,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:53" (3/3) ... [2020-07-10 20:21:53,117 INFO L109 eAbstractionObserver]: Analyzing ICFG invert_string-1.c [2020-07-10 20:21:53,127 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:53,136 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:53,151 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:53,174 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:53,174 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:53,175 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:53,175 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:53,175 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:53,175 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:53,175 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:53,176 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2020-07-10 20:21:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:21:53,204 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:53,206 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, 1, 1, 1] [2020-07-10 20:21:53,206 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:53,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1584943199, now seen corresponding path program 1 times [2020-07-10 20:21:53,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:53,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [351761892] [2020-07-10 20:21:53,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:53,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {69#true} is VALID [2020-07-10 20:21:53,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {69#true} #valid := #valid[0 := 0]; {69#true} is VALID [2020-07-10 20:21:53,477 INFO L280 TraceCheckUtils]: 2: Hoare triple {69#true} assume 0 < #StackHeapBarrier; {69#true} is VALID [2020-07-10 20:21:53,478 INFO L280 TraceCheckUtils]: 3: Hoare triple {69#true} assume true; {69#true} is VALID [2020-07-10 20:21:53,478 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {69#true} {69#true} #107#return; {69#true} is VALID [2020-07-10 20:21:53,482 INFO L263 TraceCheckUtils]: 0: Hoare triple {69#true} call ULTIMATE.init(); {76#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:53,483 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {69#true} is VALID [2020-07-10 20:21:53,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {69#true} #valid := #valid[0 := 0]; {69#true} is VALID [2020-07-10 20:21:53,483 INFO L280 TraceCheckUtils]: 3: Hoare triple {69#true} assume 0 < #StackHeapBarrier; {69#true} is VALID [2020-07-10 20:21:53,484 INFO L280 TraceCheckUtils]: 4: Hoare triple {69#true} assume true; {69#true} is VALID [2020-07-10 20:21:53,484 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {69#true} {69#true} #107#return; {69#true} is VALID [2020-07-10 20:21:53,485 INFO L263 TraceCheckUtils]: 6: Hoare triple {69#true} call #t~ret10 := main(); {69#true} is VALID [2020-07-10 20:21:53,485 INFO L280 TraceCheckUtils]: 7: Hoare triple {69#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {69#true} is VALID [2020-07-10 20:21:53,486 INFO L280 TraceCheckUtils]: 8: Hoare triple {69#true} havoc #t~nondet0; {69#true} is VALID [2020-07-10 20:21:53,486 INFO L280 TraceCheckUtils]: 9: Hoare triple {69#true} assume !!(~MAX~0 > 0); {69#true} is VALID [2020-07-10 20:21:53,487 INFO L280 TraceCheckUtils]: 10: Hoare triple {69#true} SUMMARY for call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0); srcloc: L15-3 {69#true} is VALID [2020-07-10 20:21:53,487 INFO L280 TraceCheckUtils]: 11: Hoare triple {69#true} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0); srcloc: L16 {69#true} is VALID [2020-07-10 20:21:53,488 INFO L280 TraceCheckUtils]: 12: Hoare triple {69#true} havoc ~cont~0; {69#true} is VALID [2020-07-10 20:21:53,488 INFO L280 TraceCheckUtils]: 13: Hoare triple {69#true} havoc ~i~0; {69#true} is VALID [2020-07-10 20:21:53,488 INFO L280 TraceCheckUtils]: 14: Hoare triple {69#true} havoc ~j~0; {69#true} is VALID [2020-07-10 20:21:53,489 INFO L280 TraceCheckUtils]: 15: Hoare triple {69#true} ~cont~0 := 0; {69#true} is VALID [2020-07-10 20:21:53,490 INFO L280 TraceCheckUtils]: 16: Hoare triple {69#true} ~i~0 := 0; {69#true} is VALID [2020-07-10 20:21:53,493 INFO L280 TraceCheckUtils]: 17: Hoare triple {69#true} assume !true; {70#false} is VALID [2020-07-10 20:21:53,493 INFO L280 TraceCheckUtils]: 18: Hoare triple {70#false} SUMMARY for call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); srcloc: L20-7 {70#false} is VALID [2020-07-10 20:21:53,494 INFO L280 TraceCheckUtils]: 19: Hoare triple {70#false} ~j~0 := 0; {70#false} is VALID [2020-07-10 20:21:53,494 INFO L280 TraceCheckUtils]: 20: Hoare triple {70#false} ~i~0 := ~MAX~0 - 1; {70#false} is VALID [2020-07-10 20:21:53,495 INFO L280 TraceCheckUtils]: 21: Hoare triple {70#false} assume !(~i~0 >= 0); {70#false} is VALID [2020-07-10 20:21:53,495 INFO L280 TraceCheckUtils]: 22: Hoare triple {70#false} ~j~0 := ~MAX~0 - 1; {70#false} is VALID [2020-07-10 20:21:53,495 INFO L280 TraceCheckUtils]: 23: Hoare triple {70#false} ~i~0 := 0; {70#false} is VALID [2020-07-10 20:21:53,496 INFO L280 TraceCheckUtils]: 24: Hoare triple {70#false} assume !!(~i~0 < ~MAX~0); {70#false} is VALID [2020-07-10 20:21:53,496 INFO L280 TraceCheckUtils]: 25: Hoare triple {70#false} SUMMARY for call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); srcloc: L34 {70#false} is VALID [2020-07-10 20:21:53,497 INFO L280 TraceCheckUtils]: 26: Hoare triple {70#false} SUMMARY for call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); srcloc: L34-1 {70#false} is VALID [2020-07-10 20:21:53,497 INFO L263 TraceCheckUtils]: 27: Hoare triple {70#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {70#false} is VALID [2020-07-10 20:21:53,497 INFO L280 TraceCheckUtils]: 28: Hoare triple {70#false} ~cond := #in~cond; {70#false} is VALID [2020-07-10 20:21:53,498 INFO L280 TraceCheckUtils]: 29: Hoare triple {70#false} assume 0 == ~cond; {70#false} is VALID [2020-07-10 20:21:53,498 INFO L280 TraceCheckUtils]: 30: Hoare triple {70#false} assume !false; {70#false} is VALID [2020-07-10 20:21:53,503 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 20:21:53,504 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:53,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [351761892] [2020-07-10 20:21:53,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:53,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:53,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138252942] [2020-07-10 20:21:53,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-10 20:21:53,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:53,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:53,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:53,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:53,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:53,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:53,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:53,595 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2020-07-10 20:21:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:53,956 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2020-07-10 20:21:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:53,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-10 20:21:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2020-07-10 20:21:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2020-07-10 20:21:53,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2020-07-10 20:21:54,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:54,154 INFO L225 Difference]: With dead ends: 121 [2020-07-10 20:21:54,154 INFO L226 Difference]: Without dead ends: 57 [2020-07-10 20:21:54,158 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-10 20:21:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-10 20:21:54,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:54,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2020-07-10 20:21:54,250 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-10 20:21:54,250 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-10 20:21:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:54,256 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-07-10 20:21:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-07-10 20:21:54,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:54,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:54,258 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-10 20:21:54,258 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-10 20:21:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:54,265 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-07-10 20:21:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-07-10 20:21:54,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:54,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:54,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:54,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-10 20:21:54,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2020-07-10 20:21:54,272 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 31 [2020-07-10 20:21:54,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:54,273 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-07-10 20:21:54,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:54,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 59 transitions. [2020-07-10 20:21:54,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-07-10 20:21:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:21:54,348 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:54,349 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, 1, 1, 1] [2020-07-10 20:21:54,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:54,349 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:54,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:54,350 INFO L82 PathProgramCache]: Analyzing trace with hash -318765620, now seen corresponding path program 1 times [2020-07-10 20:21:54,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:54,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [663621959] [2020-07-10 20:21:54,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:54,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {558#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {549#true} is VALID [2020-07-10 20:21:54,548 INFO L280 TraceCheckUtils]: 1: Hoare triple {549#true} #valid := #valid[0 := 0]; {549#true} is VALID [2020-07-10 20:21:54,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {549#true} assume 0 < #StackHeapBarrier; {549#true} is VALID [2020-07-10 20:21:54,548 INFO L280 TraceCheckUtils]: 3: Hoare triple {549#true} assume true; {549#true} is VALID [2020-07-10 20:21:54,549 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {549#true} {549#true} #107#return; {549#true} is VALID [2020-07-10 20:21:54,551 INFO L263 TraceCheckUtils]: 0: Hoare triple {549#true} call ULTIMATE.init(); {558#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:54,551 INFO L280 TraceCheckUtils]: 1: Hoare triple {558#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {549#true} is VALID [2020-07-10 20:21:54,552 INFO L280 TraceCheckUtils]: 2: Hoare triple {549#true} #valid := #valid[0 := 0]; {549#true} is VALID [2020-07-10 20:21:54,552 INFO L280 TraceCheckUtils]: 3: Hoare triple {549#true} assume 0 < #StackHeapBarrier; {549#true} is VALID [2020-07-10 20:21:54,552 INFO L280 TraceCheckUtils]: 4: Hoare triple {549#true} assume true; {549#true} is VALID [2020-07-10 20:21:54,553 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {549#true} {549#true} #107#return; {549#true} is VALID [2020-07-10 20:21:54,553 INFO L263 TraceCheckUtils]: 6: Hoare triple {549#true} call #t~ret10 := main(); {549#true} is VALID [2020-07-10 20:21:54,554 INFO L280 TraceCheckUtils]: 7: Hoare triple {549#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {549#true} is VALID [2020-07-10 20:21:54,554 INFO L280 TraceCheckUtils]: 8: Hoare triple {549#true} havoc #t~nondet0; {549#true} is VALID [2020-07-10 20:21:54,559 INFO L280 TraceCheckUtils]: 9: Hoare triple {549#true} assume !!(~MAX~0 > 0); {556#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:54,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {556#(<= 1 main_~MAX~0)} SUMMARY for call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0); srcloc: L15-3 {556#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:54,564 INFO L280 TraceCheckUtils]: 11: Hoare triple {556#(<= 1 main_~MAX~0)} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0); srcloc: L16 {556#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:54,565 INFO L280 TraceCheckUtils]: 12: Hoare triple {556#(<= 1 main_~MAX~0)} havoc ~cont~0; {556#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:54,567 INFO L280 TraceCheckUtils]: 13: Hoare triple {556#(<= 1 main_~MAX~0)} havoc ~i~0; {556#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:54,568 INFO L280 TraceCheckUtils]: 14: Hoare triple {556#(<= 1 main_~MAX~0)} havoc ~j~0; {556#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:54,569 INFO L280 TraceCheckUtils]: 15: Hoare triple {556#(<= 1 main_~MAX~0)} ~cont~0 := 0; {556#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:54,570 INFO L280 TraceCheckUtils]: 16: Hoare triple {556#(<= 1 main_~MAX~0)} ~i~0 := 0; {557#(and (= 0 main_~i~0) (<= 1 main_~MAX~0))} is VALID [2020-07-10 20:21:54,572 INFO L280 TraceCheckUtils]: 17: Hoare triple {557#(and (= 0 main_~i~0) (<= 1 main_~MAX~0))} assume !(~i~0 < ~MAX~0); {550#false} is VALID [2020-07-10 20:21:54,573 INFO L280 TraceCheckUtils]: 18: Hoare triple {550#false} SUMMARY for call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); srcloc: L20-7 {550#false} is VALID [2020-07-10 20:21:54,573 INFO L280 TraceCheckUtils]: 19: Hoare triple {550#false} ~j~0 := 0; {550#false} is VALID [2020-07-10 20:21:54,573 INFO L280 TraceCheckUtils]: 20: Hoare triple {550#false} ~i~0 := ~MAX~0 - 1; {550#false} is VALID [2020-07-10 20:21:54,574 INFO L280 TraceCheckUtils]: 21: Hoare triple {550#false} assume !(~i~0 >= 0); {550#false} is VALID [2020-07-10 20:21:54,574 INFO L280 TraceCheckUtils]: 22: Hoare triple {550#false} ~j~0 := ~MAX~0 - 1; {550#false} is VALID [2020-07-10 20:21:54,577 INFO L280 TraceCheckUtils]: 23: Hoare triple {550#false} ~i~0 := 0; {550#false} is VALID [2020-07-10 20:21:54,577 INFO L280 TraceCheckUtils]: 24: Hoare triple {550#false} assume !!(~i~0 < ~MAX~0); {550#false} is VALID [2020-07-10 20:21:54,577 INFO L280 TraceCheckUtils]: 25: Hoare triple {550#false} SUMMARY for call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); srcloc: L34 {550#false} is VALID [2020-07-10 20:21:54,578 INFO L280 TraceCheckUtils]: 26: Hoare triple {550#false} SUMMARY for call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); srcloc: L34-1 {550#false} is VALID [2020-07-10 20:21:54,578 INFO L263 TraceCheckUtils]: 27: Hoare triple {550#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {550#false} is VALID [2020-07-10 20:21:54,579 INFO L280 TraceCheckUtils]: 28: Hoare triple {550#false} ~cond := #in~cond; {550#false} is VALID [2020-07-10 20:21:54,579 INFO L280 TraceCheckUtils]: 29: Hoare triple {550#false} assume 0 == ~cond; {550#false} is VALID [2020-07-10 20:21:54,579 INFO L280 TraceCheckUtils]: 30: Hoare triple {550#false} assume !false; {550#false} is VALID [2020-07-10 20:21:54,582 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 20:21:54,582 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:54,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [663621959] [2020-07-10 20:21:54,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:54,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:54,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702174517] [2020-07-10 20:21:54,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-10 20:21:54,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:54,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:54,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:54,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:54,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:54,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:54,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:54,628 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2020-07-10 20:21:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:55,141 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2020-07-10 20:21:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:55,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-10 20:21:55,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-10 20:21:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-10 20:21:55,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 112 transitions. [2020-07-10 20:21:55,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:55,287 INFO L225 Difference]: With dead ends: 107 [2020-07-10 20:21:55,287 INFO L226 Difference]: Without dead ends: 74 [2020-07-10 20:21:55,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 20:21:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-10 20:21:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2020-07-10 20:21:55,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:55,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 58 states. [2020-07-10 20:21:55,369 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 58 states. [2020-07-10 20:21:55,369 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 58 states. [2020-07-10 20:21:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:55,374 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-10 20:21:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-10 20:21:55,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:55,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:55,376 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 74 states. [2020-07-10 20:21:55,376 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 74 states. [2020-07-10 20:21:55,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:55,381 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-10 20:21:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-10 20:21:55,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:55,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:55,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:55,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-10 20:21:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-07-10 20:21:55,386 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 31 [2020-07-10 20:21:55,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:55,386 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-07-10 20:21:55,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:55,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 60 transitions. [2020-07-10 20:21:55,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-07-10 20:21:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 20:21:55,460 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:55,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:55,461 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:55,461 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:55,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1837873718, now seen corresponding path program 1 times [2020-07-10 20:21:55,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:55,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1522158620] [2020-07-10 20:21:55,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:55,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {1050#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1041#true} is VALID [2020-07-10 20:21:55,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {1041#true} #valid := #valid[0 := 0]; {1041#true} is VALID [2020-07-10 20:21:55,630 INFO L280 TraceCheckUtils]: 2: Hoare triple {1041#true} assume 0 < #StackHeapBarrier; {1041#true} is VALID [2020-07-10 20:21:55,630 INFO L280 TraceCheckUtils]: 3: Hoare triple {1041#true} assume true; {1041#true} is VALID [2020-07-10 20:21:55,631 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1041#true} {1041#true} #107#return; {1041#true} is VALID [2020-07-10 20:21:55,632 INFO L263 TraceCheckUtils]: 0: Hoare triple {1041#true} call ULTIMATE.init(); {1050#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:55,633 INFO L280 TraceCheckUtils]: 1: Hoare triple {1050#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1041#true} is VALID [2020-07-10 20:21:55,633 INFO L280 TraceCheckUtils]: 2: Hoare triple {1041#true} #valid := #valid[0 := 0]; {1041#true} is VALID [2020-07-10 20:21:55,633 INFO L280 TraceCheckUtils]: 3: Hoare triple {1041#true} assume 0 < #StackHeapBarrier; {1041#true} is VALID [2020-07-10 20:21:55,633 INFO L280 TraceCheckUtils]: 4: Hoare triple {1041#true} assume true; {1041#true} is VALID [2020-07-10 20:21:55,634 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1041#true} {1041#true} #107#return; {1041#true} is VALID [2020-07-10 20:21:55,634 INFO L263 TraceCheckUtils]: 6: Hoare triple {1041#true} call #t~ret10 := main(); {1041#true} is VALID [2020-07-10 20:21:55,634 INFO L280 TraceCheckUtils]: 7: Hoare triple {1041#true} ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1041#true} is VALID [2020-07-10 20:21:55,635 INFO L280 TraceCheckUtils]: 8: Hoare triple {1041#true} havoc #t~nondet0; {1041#true} is VALID [2020-07-10 20:21:55,636 INFO L280 TraceCheckUtils]: 9: Hoare triple {1041#true} assume !!(~MAX~0 > 0); {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,637 INFO L280 TraceCheckUtils]: 10: Hoare triple {1048#(<= 1 main_~MAX~0)} SUMMARY for call ~#str1~0.base, ~#str1~0.offset := #Ultimate.allocOnStack(~MAX~0); srcloc: L15-3 {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,638 INFO L280 TraceCheckUtils]: 11: Hoare triple {1048#(<= 1 main_~MAX~0)} SUMMARY for call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(~MAX~0); srcloc: L16 {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,638 INFO L280 TraceCheckUtils]: 12: Hoare triple {1048#(<= 1 main_~MAX~0)} havoc ~cont~0; {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,639 INFO L280 TraceCheckUtils]: 13: Hoare triple {1048#(<= 1 main_~MAX~0)} havoc ~i~0; {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,640 INFO L280 TraceCheckUtils]: 14: Hoare triple {1048#(<= 1 main_~MAX~0)} havoc ~j~0; {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,641 INFO L280 TraceCheckUtils]: 15: Hoare triple {1048#(<= 1 main_~MAX~0)} ~cont~0 := 0; {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,642 INFO L280 TraceCheckUtils]: 16: Hoare triple {1048#(<= 1 main_~MAX~0)} ~i~0 := 0; {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,642 INFO L280 TraceCheckUtils]: 17: Hoare triple {1048#(<= 1 main_~MAX~0)} assume !!(~i~0 < ~MAX~0); {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,643 INFO L280 TraceCheckUtils]: 18: Hoare triple {1048#(<= 1 main_~MAX~0)} assume -128 <= #t~nondet2 && #t~nondet2 <= 127; {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,644 INFO L280 TraceCheckUtils]: 19: Hoare triple {1048#(<= 1 main_~MAX~0)} SUMMARY for call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); srcloc: L21-1 {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,645 INFO L280 TraceCheckUtils]: 20: Hoare triple {1048#(<= 1 main_~MAX~0)} havoc #t~nondet2; {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,645 INFO L280 TraceCheckUtils]: 21: Hoare triple {1048#(<= 1 main_~MAX~0)} #t~post1 := ~i~0; {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,646 INFO L280 TraceCheckUtils]: 22: Hoare triple {1048#(<= 1 main_~MAX~0)} ~i~0 := 1 + #t~post1; {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,647 INFO L280 TraceCheckUtils]: 23: Hoare triple {1048#(<= 1 main_~MAX~0)} havoc #t~post1; {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,647 INFO L280 TraceCheckUtils]: 24: Hoare triple {1048#(<= 1 main_~MAX~0)} assume !(~i~0 < ~MAX~0); {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,648 INFO L280 TraceCheckUtils]: 25: Hoare triple {1048#(<= 1 main_~MAX~0)} SUMMARY for call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); srcloc: L20-7 {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,649 INFO L280 TraceCheckUtils]: 26: Hoare triple {1048#(<= 1 main_~MAX~0)} ~j~0 := 0; {1048#(<= 1 main_~MAX~0)} is VALID [2020-07-10 20:21:55,650 INFO L280 TraceCheckUtils]: 27: Hoare triple {1048#(<= 1 main_~MAX~0)} ~i~0 := ~MAX~0 - 1; {1049#(<= 0 main_~i~0)} is VALID [2020-07-10 20:21:55,651 INFO L280 TraceCheckUtils]: 28: Hoare triple {1049#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {1042#false} is VALID [2020-07-10 20:21:55,651 INFO L280 TraceCheckUtils]: 29: Hoare triple {1042#false} ~j~0 := ~MAX~0 - 1; {1042#false} is VALID [2020-07-10 20:21:55,651 INFO L280 TraceCheckUtils]: 30: Hoare triple {1042#false} ~i~0 := 0; {1042#false} is VALID [2020-07-10 20:21:55,652 INFO L280 TraceCheckUtils]: 31: Hoare triple {1042#false} assume !!(~i~0 < ~MAX~0); {1042#false} is VALID [2020-07-10 20:21:55,652 INFO L280 TraceCheckUtils]: 32: Hoare triple {1042#false} SUMMARY for call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); srcloc: L34 {1042#false} is VALID [2020-07-10 20:21:55,652 INFO L280 TraceCheckUtils]: 33: Hoare triple {1042#false} SUMMARY for call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); srcloc: L34-1 {1042#false} is VALID [2020-07-10 20:21:55,653 INFO L263 TraceCheckUtils]: 34: Hoare triple {1042#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1042#false} is VALID [2020-07-10 20:21:55,653 INFO L280 TraceCheckUtils]: 35: Hoare triple {1042#false} ~cond := #in~cond; {1042#false} is VALID [2020-07-10 20:21:55,653 INFO L280 TraceCheckUtils]: 36: Hoare triple {1042#false} assume 0 == ~cond; {1042#false} is VALID [2020-07-10 20:21:55,653 INFO L280 TraceCheckUtils]: 37: Hoare triple {1042#false} assume !false; {1042#false} is VALID [2020-07-10 20:21:55,656 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 20:21:55,656 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:55,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1522158620] [2020-07-10 20:21:55,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:55,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:55,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580443364] [2020-07-10 20:21:55,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-10 20:21:55,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:55,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:55,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:55,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:55,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:55,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:55,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:55,699 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2020-07-10 20:21:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:56,179 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2020-07-10 20:21:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:56,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-10 20:21:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2020-07-10 20:21:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2020-07-10 20:21:56,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 99 transitions. [2020-07-10 20:21:56,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:56,303 INFO L225 Difference]: With dead ends: 95 [2020-07-10 20:21:56,303 INFO L226 Difference]: Without dead ends: 75 [2020-07-10 20:21:56,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:21:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-10 20:21:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2020-07-10 20:21:56,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:56,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 59 states. [2020-07-10 20:21:56,435 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 59 states. [2020-07-10 20:21:56,435 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 59 states. [2020-07-10 20:21:56,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:56,439 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2020-07-10 20:21:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2020-07-10 20:21:56,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:56,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:56,441 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 75 states. [2020-07-10 20:21:56,441 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 75 states. [2020-07-10 20:21:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:56,445 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2020-07-10 20:21:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2020-07-10 20:21:56,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:56,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:56,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:56,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 20:21:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-07-10 20:21:56,449 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 38 [2020-07-10 20:21:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:56,450 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-07-10 20:21:56,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:56,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 61 transitions. [2020-07-10 20:21:56,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:56,541 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-10 20:21:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 20:21:56,542 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:56,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:56,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:56,543 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2141827952, now seen corresponding path program 1 times [2020-07-10 20:21:56,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:56,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2048909380] [2020-07-10 20:21:56,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:56,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:21:56,557 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 20:21:56,566 INFO L168 Benchmark]: Toolchain (without parser) took 4424.17 ms. Allocated memory was 138.4 MB in the beginning and 246.9 MB in the end (delta: 108.5 MB). Free memory was 103.3 MB in the beginning and 111.9 MB in the end (delta: -8.6 MB). Peak memory consumption was 100.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:56,567 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.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 20:21:56,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.49 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 92.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:56,568 INFO L168 Benchmark]: Boogie Preprocessor took 138.27 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 92.2 MB in the beginning and 178.7 MB in the end (delta: -86.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:56,569 INFO L168 Benchmark]: RCFGBuilder took 524.67 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 150.3 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:56,570 INFO L168 Benchmark]: TraceAbstraction took 3452.83 ms. Allocated memory was 201.3 MB in the beginning and 246.9 MB in the end (delta: 45.6 MB). Free memory was 149.7 MB in the beginning and 111.9 MB in the end (delta: 37.8 MB). Peak memory consumption was 83.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:56,574 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.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 302.49 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 92.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.27 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 92.2 MB in the beginning and 178.7 MB in the end (delta: -86.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 524.67 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 150.3 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3452.83 ms. Allocated memory was 201.3 MB in the beginning and 246.9 MB in the end (delta: 45.6 MB). Free memory was 149.7 MB in the beginning and 111.9 MB in the end (delta: 37.8 MB). Peak memory consumption was 83.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...