java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-lit/gj2007.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:59:06,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:59:06,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:59:06,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:59:06,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:59:06,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:59:06,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:59:06,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:59:06,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:59:06,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:59:06,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:59:06,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:59:06,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:59:06,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:59:06,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:59:06,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:59:06,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:59:06,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:59:06,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:59:06,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:59:06,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:59:06,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:59:06,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:59:06,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:59:06,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:59:06,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:59:06,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:59:06,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:59:06,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:59:06,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:59:06,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:59:06,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:59:06,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:59:06,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:59:06,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:59:06,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:59:06,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:59:06,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:59:06,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:59:06,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:59:06,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:59:06,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 22:59:06,912 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:59:06,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:59:06,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:59:06,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:59:06,914 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:59:06,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:59:06,914 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:59:06,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:59:06,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:59:06,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:59:06,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:59:06,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:59:06,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:59:06,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:59:06,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:59:06,918 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:59:06,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:59:06,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:59:06,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:59:06,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:59:06,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:59:06,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:59:06,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:59:06,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:59:06,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:59:06,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:59:06,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:59:06,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:59:06,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:59:07,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:59:07,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:59:07,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:59:07,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:59:07,214 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:59:07,215 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.i [2019-10-13 22:59:07,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b6aa09c6/de1d3036d1a44365861408e2ef07c646/FLAGdc7fa78f6 [2019-10-13 22:59:07,684 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:59:07,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.i [2019-10-13 22:59:07,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b6aa09c6/de1d3036d1a44365861408e2ef07c646/FLAGdc7fa78f6 [2019-10-13 22:59:08,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b6aa09c6/de1d3036d1a44365861408e2ef07c646 [2019-10-13 22:59:08,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:59:08,116 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:59:08,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:59:08,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:59:08,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:59:08,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:08" (1/1) ... [2019-10-13 22:59:08,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ebadfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:08, skipping insertion in model container [2019-10-13 22:59:08,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:08" (1/1) ... [2019-10-13 22:59:08,134 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:59:08,151 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:59:08,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:59:08,339 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:59:08,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:59:08,368 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:59:08,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:08 WrapperNode [2019-10-13 22:59:08,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:59:08,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:59:08,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:59:08,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:59:08,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:08" (1/1) ... [2019-10-13 22:59:08,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:08" (1/1) ... [2019-10-13 22:59:08,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:08" (1/1) ... [2019-10-13 22:59:08,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:08" (1/1) ... [2019-10-13 22:59:08,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:08" (1/1) ... [2019-10-13 22:59:08,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:08" (1/1) ... [2019-10-13 22:59:08,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:08" (1/1) ... [2019-10-13 22:59:08,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:59:08,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:59:08,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:59:08,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:59:08,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:08" (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 [2019-10-13 22:59:08,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:59:08,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:59:08,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 22:59:08,523 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:59:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:59:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:59:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:59:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:59:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:59:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:59:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:59:08,712 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:59:08,713 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 22:59:08,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:08 BoogieIcfgContainer [2019-10-13 22:59:08,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:59:08,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:59:08,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:59:08,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:59:08,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:59:08" (1/3) ... [2019-10-13 22:59:08,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3ef99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:08, skipping insertion in model container [2019-10-13 22:59:08,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:08" (2/3) ... [2019-10-13 22:59:08,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3ef99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:08, skipping insertion in model container [2019-10-13 22:59:08,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:08" (3/3) ... [2019-10-13 22:59:08,722 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.i [2019-10-13 22:59:08,734 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:59:08,745 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:59:08,756 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:59:08,785 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:59:08,786 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:59:08,786 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:59:08,786 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:59:08,786 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:59:08,787 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:59:08,787 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:59:08,787 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:59:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-10-13 22:59:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 22:59:08,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:08,814 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:08,816 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1733570904, now seen corresponding path program 1 times [2019-10-13 22:59:08,832 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:08,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189709573] [2019-10-13 22:59:08,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:08,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:08,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:08,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189709573] [2019-10-13 22:59:08,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:08,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:59:08,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914942437] [2019-10-13 22:59:08,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:59:08,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:08,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:59:08,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:59:08,990 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-10-13 22:59:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:09,044 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-13 22:59:09,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:59:09,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-13 22:59:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:09,061 INFO L225 Difference]: With dead ends: 29 [2019-10-13 22:59:09,062 INFO L226 Difference]: Without dead ends: 12 [2019-10-13 22:59:09,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:59:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-10-13 22:59:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-13 22:59:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-13 22:59:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-10-13 22:59:09,099 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-10-13 22:59:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:09,099 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-10-13 22:59:09,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:59:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-10-13 22:59:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 22:59:09,100 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:09,100 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:09,101 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:09,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:09,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2033404008, now seen corresponding path program 1 times [2019-10-13 22:59:09,102 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:09,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974092298] [2019-10-13 22:59:09,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:09,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:09,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:09,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974092298] [2019-10-13 22:59:09,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872947458] [2019-10-13 22:59:09,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:09,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 22:59:09,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:09,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:59:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:09,239 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:09,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:59:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:09,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2026420225] [2019-10-13 22:59:09,322 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-13 22:59:09,323 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:09,329 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:09,337 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:09,338 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:09,399 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:09,691 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:09,718 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:09,725 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:09,726 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:09,726 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-13 22:59:09,726 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:09,727 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:09,727 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 120#true [2019-10-13 22:59:09,728 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 86#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-13 22:59:09,728 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:09,728 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 115#true [2019-10-13 22:59:09,729 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 106#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:09,729 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 96#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 22:59:09,730 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 101#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:59:09,730 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 111#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:09,911 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:09,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 6] total 11 [2019-10-13 22:59:09,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322294712] [2019-10-13 22:59:09,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 22:59:09,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:09,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 22:59:09,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-13 22:59:09,919 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-10-13 22:59:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:10,052 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-10-13 22:59:10,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 22:59:10,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-10-13 22:59:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:10,055 INFO L225 Difference]: With dead ends: 20 [2019-10-13 22:59:10,055 INFO L226 Difference]: Without dead ends: 15 [2019-10-13 22:59:10,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-10-13 22:59:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-13 22:59:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-13 22:59:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-13 22:59:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-10-13 22:59:10,068 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2019-10-13 22:59:10,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:10,070 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-10-13 22:59:10,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 22:59:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-10-13 22:59:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 22:59:10,071 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:10,072 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:10,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:10,274 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:10,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1000095400, now seen corresponding path program 2 times [2019-10-13 22:59:10,275 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:10,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053227129] [2019-10-13 22:59:10,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:10,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:10,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:10,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053227129] [2019-10-13 22:59:10,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531248351] [2019-10-13 22:59:10,347 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:10,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 22:59:10,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:10,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 22:59:10,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:10,440 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:10,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1729898026] [2019-10-13 22:59:10,562 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-13 22:59:10,563 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:10,565 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:10,565 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:10,565 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:10,583 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:10,719 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:10,741 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:10,743 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:10,743 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:10,744 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-13 22:59:10,744 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:10,745 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:10,745 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 120#true [2019-10-13 22:59:10,745 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 86#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-13 22:59:10,746 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:10,746 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 115#true [2019-10-13 22:59:10,746 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 106#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:10,746 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 96#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 22:59:10,747 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 101#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:59:10,747 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 111#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:10,866 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:10,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 6] total 17 [2019-10-13 22:59:10,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577993105] [2019-10-13 22:59:10,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 22:59:10,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:10,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 22:59:10,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-10-13 22:59:10,869 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 17 states. [2019-10-13 22:59:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:11,068 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-10-13 22:59:11,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 22:59:11,069 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-13 22:59:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:11,070 INFO L225 Difference]: With dead ends: 26 [2019-10-13 22:59:11,071 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 22:59:11,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2019-10-13 22:59:11,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 22:59:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 22:59:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 22:59:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-10-13 22:59:11,081 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2019-10-13 22:59:11,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:11,082 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-10-13 22:59:11,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 22:59:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-10-13 22:59:11,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 22:59:11,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:11,084 INFO L380 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:11,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:11,296 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1156847960, now seen corresponding path program 3 times [2019-10-13 22:59:11,297 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:11,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713289496] [2019-10-13 22:59:11,297 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:11,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:11,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:11,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713289496] [2019-10-13 22:59:11,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60065829] [2019-10-13 22:59:11,478 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:11,527 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 22:59:11,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:11,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 22:59:11,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:11,650 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:11,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [832044803] [2019-10-13 22:59:11,989 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-13 22:59:11,989 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:11,989 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:11,989 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:11,990 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:12,003 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:12,060 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:12,077 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:12,079 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:12,080 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:12,080 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-13 22:59:12,080 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:12,080 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:12,081 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 120#true [2019-10-13 22:59:12,081 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 86#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-13 22:59:12,081 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:12,081 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 115#true [2019-10-13 22:59:12,081 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 106#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:12,082 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 96#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 22:59:12,082 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 101#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:59:12,082 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 111#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:12,219 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:12,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 6] total 29 [2019-10-13 22:59:12,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763515062] [2019-10-13 22:59:12,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 22:59:12,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:12,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 22:59:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=522, Unknown=0, NotChecked=0, Total=812 [2019-10-13 22:59:12,222 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 29 states. [2019-10-13 22:59:12,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:12,731 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-10-13 22:59:12,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-13 22:59:12,737 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-10-13 22:59:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:12,738 INFO L225 Difference]: With dead ends: 38 [2019-10-13 22:59:12,738 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 22:59:12,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=840, Invalid=1710, Unknown=0, NotChecked=0, Total=2550 [2019-10-13 22:59:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 22:59:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-13 22:59:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 22:59:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-10-13 22:59:12,747 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2019-10-13 22:59:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:12,747 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-10-13 22:59:12,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 22:59:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-10-13 22:59:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 22:59:12,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:12,751 INFO L380 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:12,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:12,957 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:12,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:12,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1890503000, now seen corresponding path program 4 times [2019-10-13 22:59:12,958 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:12,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206510005] [2019-10-13 22:59:12,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:12,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:12,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:13,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206510005] [2019-10-13 22:59:13,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313581766] [2019-10-13 22:59:13,323 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:13,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 22:59:13,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:13,712 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:14,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1829381906] [2019-10-13 22:59:14,739 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-13 22:59:14,739 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:14,740 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:14,740 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:14,740 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:14,748 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:14,812 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:14,827 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:14,829 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:14,829 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:14,829 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:14,830 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:14,830 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 89#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-13 22:59:14,830 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 118#true [2019-10-13 22:59:14,830 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 84#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-13 22:59:14,830 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:14,831 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 113#true [2019-10-13 22:59:14,831 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 104#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:14,831 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 94#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 22:59:14,831 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 99#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:59:14,832 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 109#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:15,010 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:15,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 6] total 53 [2019-10-13 22:59:15,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127997832] [2019-10-13 22:59:15,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-13 22:59:15,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:15,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-13 22:59:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1142, Invalid=1614, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 22:59:15,015 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 53 states. [2019-10-13 22:59:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:16,484 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2019-10-13 22:59:16,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-13 22:59:16,484 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 32 [2019-10-13 22:59:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:16,485 INFO L225 Difference]: With dead ends: 62 [2019-10-13 22:59:16,486 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 22:59:16,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 47 SyntacticMatches, 22 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3396, Invalid=6306, Unknown=0, NotChecked=0, Total=9702 [2019-10-13 22:59:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 22:59:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-13 22:59:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-13 22:59:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-10-13 22:59:16,502 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2019-10-13 22:59:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:16,502 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-10-13 22:59:16,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-13 22:59:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-10-13 22:59:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 22:59:16,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:16,504 INFO L380 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:16,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:16,709 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:16,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:16,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1015818584, now seen corresponding path program 5 times [2019-10-13 22:59:16,709 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:16,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129067141] [2019-10-13 22:59:16,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:16,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:16,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:17,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129067141] [2019-10-13 22:59:17,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127197649] [2019-10-13 22:59:17,861 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:17,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-13 22:59:17,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:17,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-13 22:59:17,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:19,178 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:22,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1005454233] [2019-10-13 22:59:22,373 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-13 22:59:22,373 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:22,373 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:22,374 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:22,374 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:22,394 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:22,465 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:22,484 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:22,486 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:22,486 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:22,486 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:22,487 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:22,487 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 89#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-13 22:59:22,487 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 118#true [2019-10-13 22:59:22,488 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 84#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-13 22:59:22,488 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:22,488 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 113#true [2019-10-13 22:59:22,491 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 104#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:22,492 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 94#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 22:59:22,492 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 109#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:22,493 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 99#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:59:22,818 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:22,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 6] total 101 [2019-10-13 22:59:22,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977282218] [2019-10-13 22:59:22,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-10-13 22:59:22,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:22,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-10-13 22:59:22,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4574, Invalid=5526, Unknown=0, NotChecked=0, Total=10100 [2019-10-13 22:59:22,831 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 101 states. [2019-10-13 22:59:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:27,723 INFO L93 Difference]: Finished difference Result 110 states and 157 transitions. [2019-10-13 22:59:27,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-10-13 22:59:27,723 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 56 [2019-10-13 22:59:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:27,726 INFO L225 Difference]: With dead ends: 110 [2019-10-13 22:59:27,726 INFO L226 Difference]: Without dead ends: 105 [2019-10-13 22:59:27,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 71 SyntacticMatches, 46 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7232 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13692, Invalid=24138, Unknown=0, NotChecked=0, Total=37830 [2019-10-13 22:59:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-13 22:59:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-10-13 22:59:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-13 22:59:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-10-13 22:59:27,747 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 56 [2019-10-13 22:59:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:27,748 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-10-13 22:59:27,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-10-13 22:59:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-10-13 22:59:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 22:59:27,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:27,752 INFO L380 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:27,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:27,954 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:27,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash -169416360, now seen corresponding path program 6 times [2019-10-13 22:59:27,955 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:27,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195979254] [2019-10-13 22:59:27,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:27,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:27,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:33,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195979254] [2019-10-13 22:59:33,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702102232] [2019-10-13 22:59:33,043 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:33,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 22:59:33,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:33,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 97 conjunts are in the unsatisfiable core [2019-10-13 22:59:33,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:37,883 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:48,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [913732856] [2019-10-13 22:59:48,427 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-13 22:59:48,428 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:48,428 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:48,428 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:48,428 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:48,438 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:48,509 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:48,521 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:48,523 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:48,523 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:48,523 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:48,523 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:48,523 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-13 22:59:48,524 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 120#true [2019-10-13 22:59:48,524 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 86#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-13 22:59:48,524 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:48,524 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 115#true [2019-10-13 22:59:48,524 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 106#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:48,524 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 96#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 22:59:48,525 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 111#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:48,525 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 101#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))))