/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/loop-lit/jm2006_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:24:58,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:24:58,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:24:58,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:24:58,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:24:58,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:24:58,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:24:58,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:24:58,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:24:58,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:24:58,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:24:58,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:24:58,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:24:58,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:24:58,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:24:58,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:24:58,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:24:58,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:24:58,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:24:58,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:24:58,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:24:58,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:24:58,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:24:58,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:24:58,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:24:58,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:24:58,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:24:58,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:24:58,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:24:58,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:24:58,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:24:58,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:24:58,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:24:58,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:24:58,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:24:58,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:24:58,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:24:58,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:24:58,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:24:58,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:24:58,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:24:58,961 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:24:58,978 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:24:58,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:24:58,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:24:58,980 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:24:58,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:24:58,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:24:58,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:24:58,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:24:58,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:24:58,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:24:58,982 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:24:58,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:24:58,982 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:24:58,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:24:58,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:24:58,983 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:24:58,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:24:58,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:24:58,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:24:58,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:24:58,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:24:58,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:24:58,985 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:24:59,288 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:24:59,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:24:59,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:24:59,307 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:24:59,308 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:24:59,309 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i [2020-07-10 20:24:59,380 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a85db467/dea697abbf124827808b78e5c5bb167e/FLAGbd06c4fd1 [2020-07-10 20:24:59,844 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:24:59,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i [2020-07-10 20:24:59,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a85db467/dea697abbf124827808b78e5c5bb167e/FLAGbd06c4fd1 [2020-07-10 20:25:00,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a85db467/dea697abbf124827808b78e5c5bb167e [2020-07-10 20:25:00,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:25:00,290 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:25:00,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:25:00,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:25:00,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:25:00,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9cfe44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00, skipping insertion in model container [2020-07-10 20:25:00,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:25:00,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:25:00,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:25:00,592 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:25:00,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:25:00,620 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:25:00,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00 WrapperNode [2020-07-10 20:25:00,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:25:00,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:25:00,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:25:00,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:25:00,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:25:00,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:25:00,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:25:00,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:25:00,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (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:25:00,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:25:00,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:25:00,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:25:00,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:25:00,806 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:25:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:25:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:25:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:25:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:25:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:25:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:25:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:25:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:25:01,149 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:25:01,149 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:25:01,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:25:01 BoogieIcfgContainer [2020-07-10 20:25:01,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:25:01,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:25:01,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:25:01,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:25:01,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:25:00" (1/3) ... [2020-07-10 20:25:01,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad30721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:25:01, skipping insertion in model container [2020-07-10 20:25:01,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (2/3) ... [2020-07-10 20:25:01,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad30721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:25:01, skipping insertion in model container [2020-07-10 20:25:01,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:25:01" (3/3) ... [2020-07-10 20:25:01,184 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006_variant.i [2020-07-10 20:25:01,192 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:25:01,198 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:25:01,210 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:25:01,230 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:25:01,231 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:25:01,231 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:25:01,231 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:25:01,231 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:25:01,231 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:25:01,232 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:25:01,232 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:25:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-10 20:25:01,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 20:25:01,258 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:01,259 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] [2020-07-10 20:25:01,264 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash 394160949, now seen corresponding path program 1 times [2020-07-10 20:25:01,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:01,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1646240953] [2020-07-10 20:25:01,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:01,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 20:25:01,453 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {43#true} {43#true} #74#return; {43#true} is VALID [2020-07-10 20:25:01,454 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {43#true} is VALID [2020-07-10 20:25:01,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 20:25:01,455 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #74#return; {43#true} is VALID [2020-07-10 20:25:01,455 INFO L263 TraceCheckUtils]: 3: Hoare triple {43#true} call #t~ret4 := main(); {43#true} is VALID [2020-07-10 20:25:01,456 INFO L280 TraceCheckUtils]: 4: Hoare triple {43#true} havoc ~i~0; {43#true} is VALID [2020-07-10 20:25:01,456 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~j~0; {43#true} is VALID [2020-07-10 20:25:01,457 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {43#true} is VALID [2020-07-10 20:25:01,457 INFO L280 TraceCheckUtils]: 7: Hoare triple {43#true} ~i~0 := #t~nondet0; {43#true} is VALID [2020-07-10 20:25:01,457 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} havoc #t~nondet0; {43#true} is VALID [2020-07-10 20:25:01,457 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {43#true} is VALID [2020-07-10 20:25:01,458 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#true} ~j~0 := #t~nondet1; {43#true} is VALID [2020-07-10 20:25:01,458 INFO L280 TraceCheckUtils]: 11: Hoare triple {43#true} havoc #t~nondet1; {43#true} is VALID [2020-07-10 20:25:01,458 INFO L280 TraceCheckUtils]: 12: Hoare triple {43#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {43#true} is VALID [2020-07-10 20:25:01,459 INFO L280 TraceCheckUtils]: 13: Hoare triple {43#true} assume !!(~j~0 >= 0); {43#true} is VALID [2020-07-10 20:25:01,459 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#true} ~x~0 := ~i~0; {43#true} is VALID [2020-07-10 20:25:01,460 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#true} ~y~0 := ~j~0; {43#true} is VALID [2020-07-10 20:25:01,461 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#true} ~z~0 := 0; {43#true} is VALID [2020-07-10 20:25:01,462 INFO L280 TraceCheckUtils]: 17: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 20:25:01,463 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} assume ~i~0 == ~j~0; {44#false} is VALID [2020-07-10 20:25:01,463 INFO L263 TraceCheckUtils]: 19: Hoare triple {44#false} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {44#false} is VALID [2020-07-10 20:25:01,463 INFO L280 TraceCheckUtils]: 20: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2020-07-10 20:25:01,464 INFO L280 TraceCheckUtils]: 21: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2020-07-10 20:25:01,464 INFO L280 TraceCheckUtils]: 22: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-10 20:25:01,468 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:25:01,468 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:01,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1646240953] [2020-07-10 20:25:01,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:01,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:25:01,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042840369] [2020-07-10 20:25:01,479 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2020-07-10 20:25:01,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:01,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:25:01,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:01,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:25:01,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:01,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:25:01,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:25:01,571 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2020-07-10 20:25:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:01,689 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2020-07-10 20:25:01,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:25:01,690 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2020-07-10 20:25:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:25:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2020-07-10 20:25:01,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:25:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2020-07-10 20:25:01,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 60 transitions. [2020-07-10 20:25:01,813 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:25:01,826 INFO L225 Difference]: With dead ends: 53 [2020-07-10 20:25:01,826 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 20:25:01,831 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:25:01,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 20:25:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-10 20:25:01,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:01,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-10 20:25:01,892 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 20:25:01,893 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 20:25:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:01,898 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-10 20:25:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-10 20:25:01,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:01,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:01,900 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 20:25:01,900 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 20:25:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:01,905 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-10 20:25:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-10 20:25:01,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:01,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:01,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:01,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 20:25:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2020-07-10 20:25:01,912 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 23 [2020-07-10 20:25:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:01,913 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2020-07-10 20:25:01,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:25:01,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2020-07-10 20:25:01,958 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:25:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-10 20:25:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 20:25:01,960 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:01,960 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] [2020-07-10 20:25:01,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:25:01,961 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:01,962 INFO L82 PathProgramCache]: Analyzing trace with hash 79240288, now seen corresponding path program 1 times [2020-07-10 20:25:01,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:01,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1162789501] [2020-07-10 20:25:01,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:02,414 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 20:25:02,415 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {279#true} {279#true} #74#return; {279#true} is VALID [2020-07-10 20:25:02,416 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-10 20:25:02,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 20:25:02,416 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #74#return; {279#true} is VALID [2020-07-10 20:25:02,417 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret4 := main(); {279#true} is VALID [2020-07-10 20:25:02,420 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} havoc ~i~0; {279#true} is VALID [2020-07-10 20:25:02,421 INFO L280 TraceCheckUtils]: 5: Hoare triple {279#true} havoc ~j~0; {279#true} is VALID [2020-07-10 20:25:02,421 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {279#true} is VALID [2020-07-10 20:25:02,422 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} ~i~0 := #t~nondet0; {279#true} is VALID [2020-07-10 20:25:02,422 INFO L280 TraceCheckUtils]: 8: Hoare triple {279#true} havoc #t~nondet0; {279#true} is VALID [2020-07-10 20:25:02,423 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {279#true} is VALID [2020-07-10 20:25:02,423 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} ~j~0 := #t~nondet1; {279#true} is VALID [2020-07-10 20:25:02,423 INFO L280 TraceCheckUtils]: 11: Hoare triple {279#true} havoc #t~nondet1; {279#true} is VALID [2020-07-10 20:25:02,424 INFO L280 TraceCheckUtils]: 12: Hoare triple {279#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {279#true} is VALID [2020-07-10 20:25:02,424 INFO L280 TraceCheckUtils]: 13: Hoare triple {279#true} assume !!(~j~0 >= 0); {279#true} is VALID [2020-07-10 20:25:02,427 INFO L280 TraceCheckUtils]: 14: Hoare triple {279#true} ~x~0 := ~i~0; {283#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} is VALID [2020-07-10 20:25:02,428 INFO L280 TraceCheckUtils]: 15: Hoare triple {283#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} ~y~0 := ~j~0; {284#(and (<= (+ main_~y~0 main_~i~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0)))} is VALID [2020-07-10 20:25:02,430 INFO L280 TraceCheckUtils]: 16: Hoare triple {284#(and (<= (+ main_~y~0 main_~i~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0)))} ~z~0 := 0; {285#(and (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0))) (or (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} is VALID [2020-07-10 20:25:02,433 INFO L280 TraceCheckUtils]: 17: Hoare triple {285#(and (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0))) (or (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} assume !(0 != ~x~0); {286#(and (or (<= main_~j~0 (+ main_~y~0 main_~i~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~y~0 main_~i~0 main_~z~0) main_~j~0) (<= (+ main_~y~0 main_~z~0) 0)))} is VALID [2020-07-10 20:25:02,436 INFO L280 TraceCheckUtils]: 18: Hoare triple {286#(and (or (<= main_~j~0 (+ main_~y~0 main_~i~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~y~0 main_~i~0 main_~z~0) main_~j~0) (<= (+ main_~y~0 main_~z~0) 0)))} assume ~i~0 == ~j~0; {287#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} is VALID [2020-07-10 20:25:02,438 INFO L263 TraceCheckUtils]: 19: Hoare triple {287#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {288#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:02,439 INFO L280 TraceCheckUtils]: 20: Hoare triple {288#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {289#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:02,441 INFO L280 TraceCheckUtils]: 21: Hoare triple {289#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {280#false} is VALID [2020-07-10 20:25:02,442 INFO L280 TraceCheckUtils]: 22: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-10 20:25:02,454 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:25:02,454 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:02,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1162789501] [2020-07-10 20:25:02,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:02,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:25:02,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562559627] [2020-07-10 20:25:02,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-10 20:25:02,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:02,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:25:02,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:02,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:25:02,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:02,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:25:02,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:25:02,496 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2020-07-10 20:25:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:03,100 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2020-07-10 20:25:03,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:25:03,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-10 20:25:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:25:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2020-07-10 20:25:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:25:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2020-07-10 20:25:03,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2020-07-10 20:25:03,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:03,192 INFO L225 Difference]: With dead ends: 40 [2020-07-10 20:25:03,192 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 20:25:03,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-07-10 20:25:03,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 20:25:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-10 20:25:03,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:03,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-10 20:25:03,239 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-10 20:25:03,239 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-10 20:25:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:03,243 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-10 20:25:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-10 20:25:03,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:03,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:03,246 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-10 20:25:03,247 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-10 20:25:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:03,253 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-10 20:25:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-10 20:25:03,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:03,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:03,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:03,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 20:25:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2020-07-10 20:25:03,259 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2020-07-10 20:25:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:03,260 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2020-07-10 20:25:03,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:25:03,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2020-07-10 20:25:03,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-07-10 20:25:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:25:03,311 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:03,311 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:25:03,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:25:03,312 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:03,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash 821188708, now seen corresponding path program 1 times [2020-07-10 20:25:03,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:03,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227133079] [2020-07-10 20:25:03,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:03,848 INFO L280 TraceCheckUtils]: 0: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-10 20:25:03,849 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {514#true} {514#true} #74#return; {514#true} is VALID [2020-07-10 20:25:03,849 INFO L263 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2020-07-10 20:25:03,850 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-10 20:25:03,850 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {514#true} {514#true} #74#return; {514#true} is VALID [2020-07-10 20:25:03,850 INFO L263 TraceCheckUtils]: 3: Hoare triple {514#true} call #t~ret4 := main(); {514#true} is VALID [2020-07-10 20:25:03,851 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#true} havoc ~i~0; {514#true} is VALID [2020-07-10 20:25:03,851 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#true} havoc ~j~0; {514#true} is VALID [2020-07-10 20:25:03,851 INFO L280 TraceCheckUtils]: 6: Hoare triple {514#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {514#true} is VALID [2020-07-10 20:25:03,852 INFO L280 TraceCheckUtils]: 7: Hoare triple {514#true} ~i~0 := #t~nondet0; {514#true} is VALID [2020-07-10 20:25:03,852 INFO L280 TraceCheckUtils]: 8: Hoare triple {514#true} havoc #t~nondet0; {514#true} is VALID [2020-07-10 20:25:03,852 INFO L280 TraceCheckUtils]: 9: Hoare triple {514#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {514#true} is VALID [2020-07-10 20:25:03,853 INFO L280 TraceCheckUtils]: 10: Hoare triple {514#true} ~j~0 := #t~nondet1; {514#true} is VALID [2020-07-10 20:25:03,853 INFO L280 TraceCheckUtils]: 11: Hoare triple {514#true} havoc #t~nondet1; {514#true} is VALID [2020-07-10 20:25:03,853 INFO L280 TraceCheckUtils]: 12: Hoare triple {514#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {514#true} is VALID [2020-07-10 20:25:03,854 INFO L280 TraceCheckUtils]: 13: Hoare triple {514#true} assume !!(~j~0 >= 0); {514#true} is VALID [2020-07-10 20:25:03,855 INFO L280 TraceCheckUtils]: 14: Hoare triple {514#true} ~x~0 := ~i~0; {518#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} is VALID [2020-07-10 20:25:03,856 INFO L280 TraceCheckUtils]: 15: Hoare triple {518#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} ~y~0 := ~j~0; {519#(and (<= (+ main_~y~0 main_~i~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0)))} is VALID [2020-07-10 20:25:03,857 INFO L280 TraceCheckUtils]: 16: Hoare triple {519#(and (<= (+ main_~y~0 main_~i~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0)))} ~z~0 := 0; {520#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} is VALID [2020-07-10 20:25:03,858 INFO L280 TraceCheckUtils]: 17: Hoare triple {520#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} assume !!(0 != ~x~0); {520#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} is VALID [2020-07-10 20:25:03,859 INFO L280 TraceCheckUtils]: 18: Hoare triple {520#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} #t~post2 := ~x~0; {521#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ |main_#t~post2| main_~j~0)) (<= (+ |main_#t~post2| main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} is VALID [2020-07-10 20:25:03,861 INFO L280 TraceCheckUtils]: 19: Hoare triple {521#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ |main_#t~post2| main_~j~0)) (<= (+ |main_#t~post2| main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} ~x~0 := #t~post2 - 1; {522#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0 1)) (<= (+ main_~x~0 main_~j~0 1) (+ main_~y~0 main_~i~0 main_~z~0)))} is VALID [2020-07-10 20:25:03,862 INFO L280 TraceCheckUtils]: 20: Hoare triple {522#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0 1)) (<= (+ main_~x~0 main_~j~0 1) (+ main_~y~0 main_~i~0 main_~z~0)))} havoc #t~post2; {522#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0 1)) (<= (+ main_~x~0 main_~j~0 1) (+ main_~y~0 main_~i~0 main_~z~0)))} is VALID [2020-07-10 20:25:03,863 INFO L280 TraceCheckUtils]: 21: Hoare triple {522#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0 1)) (<= (+ main_~x~0 main_~j~0 1) (+ main_~y~0 main_~i~0 main_~z~0)))} ~y~0 := ~y~0 - 2; {523#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0 1)) (<= (+ main_~i~0 main_~y~0 main_~z~0 1) (+ main_~x~0 main_~j~0)))} is VALID [2020-07-10 20:25:03,864 INFO L280 TraceCheckUtils]: 22: Hoare triple {523#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0 1)) (<= (+ main_~i~0 main_~y~0 main_~z~0 1) (+ main_~x~0 main_~j~0)))} #t~post3 := ~z~0; {524#(and (<= (+ main_~i~0 main_~y~0 |main_#t~post3| 1) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 |main_#t~post3| 1)))} is VALID [2020-07-10 20:25:03,866 INFO L280 TraceCheckUtils]: 23: Hoare triple {524#(and (<= (+ main_~i~0 main_~y~0 |main_#t~post3| 1) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 |main_#t~post3| 1)))} ~z~0 := 1 + #t~post3; {525#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} is VALID [2020-07-10 20:25:03,867 INFO L280 TraceCheckUtils]: 24: Hoare triple {525#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} havoc #t~post3; {525#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} is VALID [2020-07-10 20:25:03,868 INFO L280 TraceCheckUtils]: 25: Hoare triple {525#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} assume !(0 != ~x~0); {526#(and (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~i~0 main_~y~0 main_~z~0) main_~j~0)) (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~i~0 main_~y~0 main_~z~0))))} is VALID [2020-07-10 20:25:03,870 INFO L280 TraceCheckUtils]: 26: Hoare triple {526#(and (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~i~0 main_~y~0 main_~z~0) main_~j~0)) (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~i~0 main_~y~0 main_~z~0))))} assume ~i~0 == ~j~0; {527#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} is VALID [2020-07-10 20:25:03,871 INFO L263 TraceCheckUtils]: 27: Hoare triple {527#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {528#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:03,872 INFO L280 TraceCheckUtils]: 28: Hoare triple {528#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {529#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:03,875 INFO L280 TraceCheckUtils]: 29: Hoare triple {529#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {515#false} is VALID [2020-07-10 20:25:03,875 INFO L280 TraceCheckUtils]: 30: Hoare triple {515#false} assume !false; {515#false} is VALID [2020-07-10 20:25:03,879 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:25:03,879 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:03,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227133079] [2020-07-10 20:25:03,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:03,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 20:25:03,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402348038] [2020-07-10 20:25:03,881 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2020-07-10 20:25:03,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:03,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 20:25:03,916 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:25:03,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 20:25:03,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:03,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 20:25:03,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-07-10 20:25:03,917 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 14 states. [2020-07-10 20:25:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:04,856 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-10 20:25:04,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 20:25:04,857 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2020-07-10 20:25:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 20:25:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 34 transitions. [2020-07-10 20:25:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 20:25:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 34 transitions. [2020-07-10 20:25:04,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 34 transitions. [2020-07-10 20:25:04,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:04,901 INFO L225 Difference]: With dead ends: 34 [2020-07-10 20:25:04,901 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:25:04,902 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2020-07-10 20:25:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:25:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:25:04,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:04,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:04,903 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:04,903 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:04,904 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:25:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:25:04,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:04,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:04,905 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:04,905 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:04,905 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:25:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:25:04,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:04,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:04,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:04,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:25:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:25:04,907 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-10 20:25:04,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:04,907 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:25:04,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 20:25:04,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:25:04,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:04,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:25:04,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:04,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:25:04,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:25:05,269 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:25:05,269 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:25:05,269 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:25:05,269 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:25:05,269 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:25:05,270 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:25:05,270 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:25:05,270 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:25:05,270 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:25:05,270 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:25:05,270 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:25:05,270 INFO L271 CegarLoopResult]: At program point L27(lines 27 29) the Hoare annotation is: true [2020-07-10 20:25:05,270 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~y~0 main_~z~0 1)) (.cse0 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:25:05,270 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 31) the Hoare annotation is: true [2020-07-10 20:25:05,271 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse2 (+ main_~i~0 main_~y~0 |main_#t~post3| 1)) (.cse1 (+ main_~i~0 main_~y~0 main_~z~0 1)) (.cse0 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse2 .cse0) (<= .cse0 .cse2) (<= .cse1 .cse0))) [2020-07-10 20:25:05,271 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:25:05,271 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse2 (+ main_~i~0 main_~y~0 |main_#t~post3| 1)) (.cse1 (+ main_~x~0 main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse2 .cse1) (<= .cse1 .cse2) (<= .cse1 .cse0))) [2020-07-10 20:25:05,271 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0)) (.cse2 (+ |main_#t~post2| main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse0 .cse2) (<= .cse1 .cse0) (<= .cse2 .cse0))) [2020-07-10 20:25:05,271 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0))) (and (<= main_~i~0 main_~x~0) (<= .cse0 .cse1) (<= main_~x~0 main_~i~0) (<= .cse1 .cse0))) [2020-07-10 20:25:05,271 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0 1)) (.cse2 (+ |main_#t~post2| main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse0 .cse2) (<= .cse2 .cse0))) [2020-07-10 20:25:05,271 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-10 20:25:05,272 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-10 20:25:05,272 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-10 20:25:05,272 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-10 20:25:05,272 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-10 20:25:05,272 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-10 20:25:05,272 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 31) the Hoare annotation is: true [2020-07-10 20:25:05,272 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 31) the Hoare annotation is: true [2020-07-10 20:25:05,272 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (let ((.cse5 (+ main_~y~0 main_~z~0))) (let ((.cse2 (<= .cse5 0)) (.cse3 (<= 0 .cse5)) (.cse1 (+ main_~x~0 main_~j~0))) (or (let ((.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) .cse2 (<= .cse1 .cse0) .cse3)) (let ((.cse4 (+ main_~y~0 main_~i~0))) (and (<= main_~i~0 main_~x~0) (<= .cse4 .cse1) .cse2 (<= main_~x~0 main_~i~0) .cse3 (<= .cse1 .cse4)))))) [2020-07-10 20:25:05,273 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0 1)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:25:05,273 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0)) [2020-07-10 20:25:05,273 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 26) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:25:05,273 INFO L264 CegarLoopResult]: At program point L22-3(lines 13 31) the Hoare annotation is: (let ((.cse4 (+ main_~y~0 main_~i~0 main_~z~0)) (.cse6 (+ main_~x~0 main_~j~0))) (let ((.cse2 (<= .cse4 .cse6)) (.cse1 (<= .cse6 .cse4)) (.cse3 (<= (+ main_~y~0 main_~z~0) 0)) (.cse0 (< 0 (+ main_~y~0 main_~z~0 1)))) (or (let ((.cse5 (+ main_~y~0 main_~i~0))) (and (<= main_~i~0 main_~x~0) (or .cse0 .cse1) (or .cse2 .cse3) (or (<= main_~j~0 .cse4) .cse0) (<= .cse5 .cse6) (or (<= .cse4 main_~j~0) .cse3) (<= main_~x~0 main_~i~0) (<= .cse6 .cse5))) (let ((.cse7 (+ main_~i~0 main_~y~0 main_~z~0))) (and .cse2 .cse1 (or .cse3 (<= .cse7 main_~j~0)) (or .cse0 (<= main_~j~0 .cse7))))))) [2020-07-10 20:25:05,273 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-10 20:25:05,274 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-10 20:25:05,274 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-10 20:25:05,274 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-10 20:25:05,274 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-10 20:25:05,274 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-10 20:25:05,274 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:25:05,275 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-10 20:25:05,275 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:25:05,275 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:25:05,275 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-10 20:25:05,275 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:25:05,280 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:25:05,283 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:25:05,284 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:25:05,288 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:25:05,288 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:25:05,301 INFO L163 areAnnotationChecker]: CFG has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:25:05,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:25:05 BoogieIcfgContainer [2020-07-10 20:25:05,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:25:05,317 INFO L168 Benchmark]: Toolchain (without parser) took 5026.45 ms. Allocated memory was 136.8 MB in the beginning and 250.1 MB in the end (delta: 113.2 MB). Free memory was 101.7 MB in the beginning and 99.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 115.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:05,318 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 136.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 20:25:05,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.13 ms. Allocated memory is still 136.8 MB. Free memory was 101.5 MB in the beginning and 91.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:05,320 INFO L168 Benchmark]: Boogie Preprocessor took 129.26 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 91.6 MB in the beginning and 181.4 MB in the end (delta: -89.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:05,320 INFO L168 Benchmark]: RCFGBuilder took 403.02 ms. Allocated memory is still 201.3 MB. Free memory was 181.4 MB in the beginning and 159.6 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:05,321 INFO L168 Benchmark]: TraceAbstraction took 4145.33 ms. Allocated memory was 201.3 MB in the beginning and 250.1 MB in the end (delta: 48.8 MB). Free memory was 159.6 MB in the beginning and 99.5 MB in the end (delta: 60.1 MB). Peak memory consumption was 108.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:05,326 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.26 ms. Allocated memory is still 136.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.13 ms. Allocated memory is still 136.8 MB. Free memory was 101.5 MB in the beginning and 91.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.26 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 91.6 MB in the beginning and 181.4 MB in the end (delta: -89.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 403.02 ms. Allocated memory is still 201.3 MB. Free memory was 181.4 MB in the beginning and 159.6 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4145.33 ms. Allocated memory was 201.3 MB in the beginning and 250.1 MB in the end (delta: 48.8 MB). Free memory was 159.6 MB in the beginning and 99.5 MB in the end (delta: 60.1 MB). Peak memory consumption was 108.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 22]: Loop Invariant Derived loop invariant: y + i + z <= x + j && x + j <= y + i + z - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.6s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 89 SDtfs, 34 SDslu, 249 SDs, 0 SdLazy, 234 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 40 LocationsWithAnnotation, 52 PreInvPairs, 68 NumberOfFragments, 456 HoareAnnotationTreeSize, 52 FomulaSimplifications, 159 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 40 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...