java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sep_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:16:44,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:16:44,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:16:44,680 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:16:44,681 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:16:44,682 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:16:44,684 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:16:44,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:16:44,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:16:44,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:16:44,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:16:44,701 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:16:44,702 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:16:44,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:16:44,704 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:16:44,705 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:16:44,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:16:44,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:16:44,713 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:16:44,714 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:16:44,715 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:16:44,719 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:16:44,723 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:16:44,723 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:16:44,723 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:16:44,724 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:16:44,725 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:16:44,726 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:16:44,727 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:16:44,731 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:16:44,731 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:16:44,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:16:44,732 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:16:44,732 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:16:44,735 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:16:44,736 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:16:44,736 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:16:44,759 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:16:44,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:16:44,760 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:16:44,761 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:16:44,761 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:16:44,761 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:16:44,762 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:16:44,763 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:16:44,763 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:16:44,763 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:16:44,763 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:16:44,763 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:16:44,764 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:16:44,764 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:16:44,764 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:16:44,764 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:16:44,764 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:16:44,764 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:16:44,766 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:16:44,766 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:16:44,766 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:16:44,766 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:16:44,766 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:16:44,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:16:44,767 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:16:44,767 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:16:44,767 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:16:44,768 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:16:44,768 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:16:44,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:16:44,768 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:16:44,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:16:44,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:16:44,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:16:44,860 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:16:44,860 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:16:44,861 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-11-23 12:16:44,940 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796b7935e/595ef4b91d2c4fd1bd38d89eeae413fe/FLAG514352b46 [2018-11-23 12:16:45,437 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:16:45,438 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-11-23 12:16:45,445 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796b7935e/595ef4b91d2c4fd1bd38d89eeae413fe/FLAG514352b46 [2018-11-23 12:16:45,769 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796b7935e/595ef4b91d2c4fd1bd38d89eeae413fe [2018-11-23 12:16:45,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:16:45,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:16:45,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:45,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:16:45,785 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:16:45,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:45" (1/1) ... [2018-11-23 12:16:45,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@536a37b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:45, skipping insertion in model container [2018-11-23 12:16:45,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:45" (1/1) ... [2018-11-23 12:16:45,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:16:45,830 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:16:46,053 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:46,069 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:16:46,095 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:46,111 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:16:46,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:46 WrapperNode [2018-11-23 12:16:46,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:46,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:46,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:16:46,113 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:16:46,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:46" (1/1) ... [2018-11-23 12:16:46,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:46" (1/1) ... [2018-11-23 12:16:46,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:46,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:16:46,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:16:46,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:16:46,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:46" (1/1) ... [2018-11-23 12:16:46,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:46" (1/1) ... [2018-11-23 12:16:46,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:46" (1/1) ... [2018-11-23 12:16:46,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:46" (1/1) ... [2018-11-23 12:16:46,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:46" (1/1) ... [2018-11-23 12:16:46,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:46" (1/1) ... [2018-11-23 12:16:46,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:46" (1/1) ... [2018-11-23 12:16:46,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:16:46,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:16:46,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:16:46,173 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:16:46,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:46" (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 [2018-11-23 12:16:46,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:16:46,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:16:46,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:16:46,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:16:46,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:16:46,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:16:46,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:16:46,301 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:16:46,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:16:46,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:16:46,302 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2018-11-23 12:16:46,302 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2018-11-23 12:16:47,006 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:16:47,006 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:16:47,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:47 BoogieIcfgContainer [2018-11-23 12:16:47,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:16:47,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:16:47,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:16:47,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:16:47,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:16:45" (1/3) ... [2018-11-23 12:16:47,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b145693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:47, skipping insertion in model container [2018-11-23 12:16:47,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:46" (2/3) ... [2018-11-23 12:16:47,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b145693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:47, skipping insertion in model container [2018-11-23 12:16:47,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:47" (3/3) ... [2018-11-23 12:16:47,016 INFO L112 eAbstractionObserver]: Analyzing ICFG sep_true-unreach-call_true-termination.i [2018-11-23 12:16:47,028 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:16:47,036 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:16:47,056 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:16:47,089 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:16:47,089 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:16:47,090 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:16:47,090 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:16:47,090 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:16:47,090 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:16:47,090 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:16:47,091 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:16:47,091 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:16:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:16:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:16:47,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:47,119 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:47,121 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:47,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:47,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1691531413, now seen corresponding path program 1 times [2018-11-23 12:16:47,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:47,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:47,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:47,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:47,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:47,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:16:47,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {35#true} is VALID [2018-11-23 12:16:47,641 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:47,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #65#return; {35#true} is VALID [2018-11-23 12:16:47,642 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret13 := main(); {35#true} is VALID [2018-11-23 12:16:47,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2018-11-23 12:16:47,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {37#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:47,644 INFO L256 TraceCheckUtils]: 7: Hoare triple {37#(<= 2 ~N~0)} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {35#true} is VALID [2018-11-23 12:16:47,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {38#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:47,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#(= sep_~i~0 0)} assume !(~i~0 < ~N~0); {39#(<= ~N~0 0)} is VALID [2018-11-23 12:16:47,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {39#(<= ~N~0 0)} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {39#(<= ~N~0 0)} is VALID [2018-11-23 12:16:47,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#(<= ~N~0 0)} assume true; {39#(<= ~N~0 0)} is VALID [2018-11-23 12:16:47,657 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {39#(<= ~N~0 0)} {37#(<= 2 ~N~0)} #69#return; {36#false} is VALID [2018-11-23 12:16:47,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36#false} is VALID [2018-11-23 12:16:47,658 INFO L256 TraceCheckUtils]: 14: Hoare triple {36#false} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {35#true} is VALID [2018-11-23 12:16:47,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {35#true} is VALID [2018-11-23 12:16:47,658 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#true} assume !(~i~0 < ~N~0); {35#true} is VALID [2018-11-23 12:16:47,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {35#true} is VALID [2018-11-23 12:16:47,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:47,659 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#true} {36#false} #71#return; {36#false} is VALID [2018-11-23 12:16:47,659 INFO L273 TraceCheckUtils]: 20: Hoare triple {36#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {36#false} is VALID [2018-11-23 12:16:47,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {36#false} assume !(~i~1 < ~N~0 - 1); {36#false} is VALID [2018-11-23 12:16:47,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {36#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {36#false} is VALID [2018-11-23 12:16:47,660 INFO L256 TraceCheckUtils]: 23: Hoare triple {36#false} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {35#true} is VALID [2018-11-23 12:16:47,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {35#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {35#true} is VALID [2018-11-23 12:16:47,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#true} assume !(~i~0 < ~N~0); {35#true} is VALID [2018-11-23 12:16:47,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {35#true} is VALID [2018-11-23 12:16:47,662 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:47,662 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#true} {36#false} #73#return; {36#false} is VALID [2018-11-23 12:16:47,662 INFO L273 TraceCheckUtils]: 29: Hoare triple {36#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {36#false} is VALID [2018-11-23 12:16:47,663 INFO L273 TraceCheckUtils]: 30: Hoare triple {36#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {36#false} is VALID [2018-11-23 12:16:47,663 INFO L273 TraceCheckUtils]: 31: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:16:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:16:47,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:47,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:47,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:47,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:48,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:16:48,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {35#true} is VALID [2018-11-23 12:16:48,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:48,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #65#return; {35#true} is VALID [2018-11-23 12:16:48,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret13 := main(); {35#true} is VALID [2018-11-23 12:16:48,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2018-11-23 12:16:48,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {37#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:48,282 INFO L256 TraceCheckUtils]: 7: Hoare triple {37#(<= 2 ~N~0)} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {37#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:48,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {67#(and (<= 2 ~N~0) (<= sep_~i~0 0))} is VALID [2018-11-23 12:16:48,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {67#(and (<= 2 ~N~0) (<= sep_~i~0 0))} assume !(~i~0 < ~N~0); {36#false} is VALID [2018-11-23 12:16:48,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36#false} is VALID [2018-11-23 12:16:48,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-23 12:16:48,288 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {36#false} {37#(<= 2 ~N~0)} #69#return; {36#false} is VALID [2018-11-23 12:16:48,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36#false} is VALID [2018-11-23 12:16:48,288 INFO L256 TraceCheckUtils]: 14: Hoare triple {36#false} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {36#false} is VALID [2018-11-23 12:16:48,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {36#false} is VALID [2018-11-23 12:16:48,289 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2018-11-23 12:16:48,289 INFO L273 TraceCheckUtils]: 17: Hoare triple {36#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36#false} is VALID [2018-11-23 12:16:48,290 INFO L273 TraceCheckUtils]: 18: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-23 12:16:48,290 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {36#false} {36#false} #71#return; {36#false} is VALID [2018-11-23 12:16:48,291 INFO L273 TraceCheckUtils]: 20: Hoare triple {36#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {36#false} is VALID [2018-11-23 12:16:48,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {36#false} assume !(~i~1 < ~N~0 - 1); {36#false} is VALID [2018-11-23 12:16:48,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {36#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {36#false} is VALID [2018-11-23 12:16:48,292 INFO L256 TraceCheckUtils]: 23: Hoare triple {36#false} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {36#false} is VALID [2018-11-23 12:16:48,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {36#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {36#false} is VALID [2018-11-23 12:16:48,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2018-11-23 12:16:48,293 INFO L273 TraceCheckUtils]: 26: Hoare triple {36#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36#false} is VALID [2018-11-23 12:16:48,293 INFO L273 TraceCheckUtils]: 27: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-23 12:16:48,293 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {36#false} {36#false} #73#return; {36#false} is VALID [2018-11-23 12:16:48,294 INFO L273 TraceCheckUtils]: 29: Hoare triple {36#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {36#false} is VALID [2018-11-23 12:16:48,294 INFO L273 TraceCheckUtils]: 30: Hoare triple {36#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {36#false} is VALID [2018-11-23 12:16:48,295 INFO L273 TraceCheckUtils]: 31: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:16:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:16:48,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:16:48,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-11-23 12:16:48,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 12:16:48,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:48,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:16:48,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:48,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:16:48,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:16:48,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:16:48,534 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 6 states. [2018-11-23 12:16:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:49,692 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2018-11-23 12:16:49,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:16:49,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 12:16:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:16:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2018-11-23 12:16:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:16:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2018-11-23 12:16:49,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 83 transitions. [2018-11-23 12:16:49,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:49,920 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:16:49,921 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:16:49,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:16:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:16:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 12:16:49,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:49,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 12:16:49,999 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 12:16:49,999 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 12:16:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:50,006 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:16:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:16:50,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:50,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:50,008 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 12:16:50,008 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 12:16:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:50,013 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:16:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:16:50,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:50,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:50,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:50,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:16:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:16:50,020 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:16:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:50,020 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:16:50,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:16:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:16:50,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:16:50,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:50,023 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:50,023 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:50,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:50,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2111009974, now seen corresponding path program 1 times [2018-11-23 12:16:50,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:50,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:50,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:50,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:50,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:50,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {315#true} call ULTIMATE.init(); {315#true} is VALID [2018-11-23 12:16:50,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {315#true} is VALID [2018-11-23 12:16:50,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {315#true} assume true; {315#true} is VALID [2018-11-23 12:16:50,287 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {315#true} {315#true} #65#return; {315#true} is VALID [2018-11-23 12:16:50,287 INFO L256 TraceCheckUtils]: 4: Hoare triple {315#true} call #t~ret13 := main(); {315#true} is VALID [2018-11-23 12:16:50,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {315#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {315#true} is VALID [2018-11-23 12:16:50,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {315#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {317#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:50,289 INFO L256 TraceCheckUtils]: 7: Hoare triple {317#(<= 2 ~N~0)} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {315#true} is VALID [2018-11-23 12:16:50,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {315#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {318#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:50,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {318#(= sep_~i~0 0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {318#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:50,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {318#(= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {318#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:50,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {318#(= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {319#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:50,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {319#(<= sep_~i~0 1)} assume !(~i~0 < ~N~0); {320#(<= ~N~0 1)} is VALID [2018-11-23 12:16:50,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {320#(<= ~N~0 1)} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {320#(<= ~N~0 1)} is VALID [2018-11-23 12:16:50,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {320#(<= ~N~0 1)} assume true; {320#(<= ~N~0 1)} is VALID [2018-11-23 12:16:50,296 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {320#(<= ~N~0 1)} {317#(<= 2 ~N~0)} #69#return; {316#false} is VALID [2018-11-23 12:16:50,297 INFO L273 TraceCheckUtils]: 16: Hoare triple {316#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {316#false} is VALID [2018-11-23 12:16:50,297 INFO L256 TraceCheckUtils]: 17: Hoare triple {316#false} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {315#true} is VALID [2018-11-23 12:16:50,298 INFO L273 TraceCheckUtils]: 18: Hoare triple {315#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {315#true} is VALID [2018-11-23 12:16:50,298 INFO L273 TraceCheckUtils]: 19: Hoare triple {315#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {315#true} is VALID [2018-11-23 12:16:50,298 INFO L273 TraceCheckUtils]: 20: Hoare triple {315#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {315#true} is VALID [2018-11-23 12:16:50,299 INFO L273 TraceCheckUtils]: 21: Hoare triple {315#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {315#true} is VALID [2018-11-23 12:16:50,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {315#true} assume !(~i~0 < ~N~0); {315#true} is VALID [2018-11-23 12:16:50,299 INFO L273 TraceCheckUtils]: 23: Hoare triple {315#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {315#true} is VALID [2018-11-23 12:16:50,300 INFO L273 TraceCheckUtils]: 24: Hoare triple {315#true} assume true; {315#true} is VALID [2018-11-23 12:16:50,300 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {315#true} {316#false} #71#return; {316#false} is VALID [2018-11-23 12:16:50,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {316#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {316#false} is VALID [2018-11-23 12:16:50,301 INFO L273 TraceCheckUtils]: 27: Hoare triple {316#false} assume !(~i~1 < ~N~0 - 1); {316#false} is VALID [2018-11-23 12:16:50,301 INFO L273 TraceCheckUtils]: 28: Hoare triple {316#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {316#false} is VALID [2018-11-23 12:16:50,301 INFO L256 TraceCheckUtils]: 29: Hoare triple {316#false} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {315#true} is VALID [2018-11-23 12:16:50,302 INFO L273 TraceCheckUtils]: 30: Hoare triple {315#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {315#true} is VALID [2018-11-23 12:16:50,302 INFO L273 TraceCheckUtils]: 31: Hoare triple {315#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {315#true} is VALID [2018-11-23 12:16:50,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {315#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {315#true} is VALID [2018-11-23 12:16:50,303 INFO L273 TraceCheckUtils]: 33: Hoare triple {315#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {315#true} is VALID [2018-11-23 12:16:50,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {315#true} assume !(~i~0 < ~N~0); {315#true} is VALID [2018-11-23 12:16:50,303 INFO L273 TraceCheckUtils]: 35: Hoare triple {315#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {315#true} is VALID [2018-11-23 12:16:50,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {315#true} assume true; {315#true} is VALID [2018-11-23 12:16:50,304 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {315#true} {316#false} #73#return; {316#false} is VALID [2018-11-23 12:16:50,304 INFO L273 TraceCheckUtils]: 38: Hoare triple {316#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {316#false} is VALID [2018-11-23 12:16:50,305 INFO L273 TraceCheckUtils]: 39: Hoare triple {316#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {316#false} is VALID [2018-11-23 12:16:50,305 INFO L273 TraceCheckUtils]: 40: Hoare triple {316#false} assume !false; {316#false} is VALID [2018-11-23 12:16:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 12:16:50,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:50,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:50,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:50,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:50,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {315#true} call ULTIMATE.init(); {315#true} is VALID [2018-11-23 12:16:50,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {315#true} is VALID [2018-11-23 12:16:50,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {315#true} assume true; {315#true} is VALID [2018-11-23 12:16:50,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {315#true} {315#true} #65#return; {315#true} is VALID [2018-11-23 12:16:50,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {315#true} call #t~ret13 := main(); {315#true} is VALID [2018-11-23 12:16:50,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {315#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {315#true} is VALID [2018-11-23 12:16:50,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {315#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {317#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:50,535 INFO L256 TraceCheckUtils]: 7: Hoare triple {317#(<= 2 ~N~0)} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {317#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:50,536 INFO L273 TraceCheckUtils]: 8: Hoare triple {317#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {348#(and (<= 2 ~N~0) (<= sep_~i~0 0))} is VALID [2018-11-23 12:16:50,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {348#(and (<= 2 ~N~0) (<= sep_~i~0 0))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {348#(and (<= 2 ~N~0) (<= sep_~i~0 0))} is VALID [2018-11-23 12:16:50,539 INFO L273 TraceCheckUtils]: 10: Hoare triple {348#(and (<= 2 ~N~0) (<= sep_~i~0 0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {348#(and (<= 2 ~N~0) (<= sep_~i~0 0))} is VALID [2018-11-23 12:16:50,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {348#(and (<= 2 ~N~0) (<= sep_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {358#(and (<= 2 ~N~0) (<= sep_~i~0 1))} is VALID [2018-11-23 12:16:50,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {358#(and (<= 2 ~N~0) (<= sep_~i~0 1))} assume !(~i~0 < ~N~0); {316#false} is VALID [2018-11-23 12:16:50,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {316#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {316#false} is VALID [2018-11-23 12:16:50,541 INFO L273 TraceCheckUtils]: 14: Hoare triple {316#false} assume true; {316#false} is VALID [2018-11-23 12:16:50,541 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {316#false} {317#(<= 2 ~N~0)} #69#return; {316#false} is VALID [2018-11-23 12:16:50,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {316#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {316#false} is VALID [2018-11-23 12:16:50,542 INFO L256 TraceCheckUtils]: 17: Hoare triple {316#false} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {316#false} is VALID [2018-11-23 12:16:50,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {316#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {316#false} is VALID [2018-11-23 12:16:50,543 INFO L273 TraceCheckUtils]: 19: Hoare triple {316#false} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {316#false} is VALID [2018-11-23 12:16:50,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {316#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {316#false} is VALID [2018-11-23 12:16:50,544 INFO L273 TraceCheckUtils]: 21: Hoare triple {316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {316#false} is VALID [2018-11-23 12:16:50,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {316#false} assume !(~i~0 < ~N~0); {316#false} is VALID [2018-11-23 12:16:50,544 INFO L273 TraceCheckUtils]: 23: Hoare triple {316#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {316#false} is VALID [2018-11-23 12:16:50,545 INFO L273 TraceCheckUtils]: 24: Hoare triple {316#false} assume true; {316#false} is VALID [2018-11-23 12:16:50,545 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {316#false} {316#false} #71#return; {316#false} is VALID [2018-11-23 12:16:50,545 INFO L273 TraceCheckUtils]: 26: Hoare triple {316#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {316#false} is VALID [2018-11-23 12:16:50,546 INFO L273 TraceCheckUtils]: 27: Hoare triple {316#false} assume !(~i~1 < ~N~0 - 1); {316#false} is VALID [2018-11-23 12:16:50,546 INFO L273 TraceCheckUtils]: 28: Hoare triple {316#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {316#false} is VALID [2018-11-23 12:16:50,546 INFO L256 TraceCheckUtils]: 29: Hoare triple {316#false} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {316#false} is VALID [2018-11-23 12:16:50,547 INFO L273 TraceCheckUtils]: 30: Hoare triple {316#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {316#false} is VALID [2018-11-23 12:16:50,547 INFO L273 TraceCheckUtils]: 31: Hoare triple {316#false} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {316#false} is VALID [2018-11-23 12:16:50,547 INFO L273 TraceCheckUtils]: 32: Hoare triple {316#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {316#false} is VALID [2018-11-23 12:16:50,547 INFO L273 TraceCheckUtils]: 33: Hoare triple {316#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {316#false} is VALID [2018-11-23 12:16:50,548 INFO L273 TraceCheckUtils]: 34: Hoare triple {316#false} assume !(~i~0 < ~N~0); {316#false} is VALID [2018-11-23 12:16:50,548 INFO L273 TraceCheckUtils]: 35: Hoare triple {316#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {316#false} is VALID [2018-11-23 12:16:50,548 INFO L273 TraceCheckUtils]: 36: Hoare triple {316#false} assume true; {316#false} is VALID [2018-11-23 12:16:50,549 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {316#false} {316#false} #73#return; {316#false} is VALID [2018-11-23 12:16:50,549 INFO L273 TraceCheckUtils]: 38: Hoare triple {316#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {316#false} is VALID [2018-11-23 12:16:50,549 INFO L273 TraceCheckUtils]: 39: Hoare triple {316#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {316#false} is VALID [2018-11-23 12:16:50,550 INFO L273 TraceCheckUtils]: 40: Hoare triple {316#false} assume !false; {316#false} is VALID [2018-11-23 12:16:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 12:16:50,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:50,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-23 12:16:50,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 12:16:50,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:50,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:16:50,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:50,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:16:50,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:16:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:50,686 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 8 states. [2018-11-23 12:16:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,067 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 12:16:51,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:16:51,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 12:16:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 12:16:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 12:16:51,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2018-11-23 12:16:51,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:51,177 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:16:51,177 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:16:51,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:16:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:16:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 12:16:51,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:51,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-23 12:16:51,207 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-23 12:16:51,207 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-23 12:16:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,210 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 12:16:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:16:51,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:51,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:51,212 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-23 12:16:51,212 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-23 12:16:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,216 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 12:16:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:16:51,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:51,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:51,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:51,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:16:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:16:51,221 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 41 [2018-11-23 12:16:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:51,221 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:16:51,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:16:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:16:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:16:51,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:51,224 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:51,224 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:51,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:51,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1048726581, now seen corresponding path program 2 times [2018-11-23 12:16:51,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:51,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:51,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:51,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:51,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:51,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2018-11-23 12:16:51,388 INFO L273 TraceCheckUtils]: 1: Hoare triple {623#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {623#true} is VALID [2018-11-23 12:16:51,388 INFO L273 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2018-11-23 12:16:51,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #65#return; {623#true} is VALID [2018-11-23 12:16:51,388 INFO L256 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret13 := main(); {623#true} is VALID [2018-11-23 12:16:51,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {623#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {623#true} is VALID [2018-11-23 12:16:51,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {623#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {625#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:51,392 INFO L256 TraceCheckUtils]: 7: Hoare triple {625#(<= 2 ~N~0)} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {623#true} is VALID [2018-11-23 12:16:51,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {623#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {623#true} is VALID [2018-11-23 12:16:51,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {623#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {623#true} is VALID [2018-11-23 12:16:51,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {623#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {623#true} is VALID [2018-11-23 12:16:51,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {623#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {623#true} is VALID [2018-11-23 12:16:51,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {623#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {623#true} is VALID [2018-11-23 12:16:51,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {623#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {623#true} is VALID [2018-11-23 12:16:51,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {623#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {623#true} is VALID [2018-11-23 12:16:51,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {623#true} assume !(~i~0 < ~N~0); {623#true} is VALID [2018-11-23 12:16:51,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {623#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {623#true} is VALID [2018-11-23 12:16:51,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {623#true} assume true; {623#true} is VALID [2018-11-23 12:16:51,395 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {623#true} {625#(<= 2 ~N~0)} #69#return; {625#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:51,399 INFO L273 TraceCheckUtils]: 19: Hoare triple {625#(<= 2 ~N~0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {625#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:51,399 INFO L256 TraceCheckUtils]: 20: Hoare triple {625#(<= 2 ~N~0)} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {623#true} is VALID [2018-11-23 12:16:51,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {623#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {623#true} is VALID [2018-11-23 12:16:51,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {623#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {623#true} is VALID [2018-11-23 12:16:51,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {623#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {623#true} is VALID [2018-11-23 12:16:51,400 INFO L273 TraceCheckUtils]: 24: Hoare triple {623#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {623#true} is VALID [2018-11-23 12:16:51,401 INFO L273 TraceCheckUtils]: 25: Hoare triple {623#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {623#true} is VALID [2018-11-23 12:16:51,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {623#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {623#true} is VALID [2018-11-23 12:16:51,401 INFO L273 TraceCheckUtils]: 27: Hoare triple {623#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {623#true} is VALID [2018-11-23 12:16:51,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {623#true} assume !(~i~0 < ~N~0); {623#true} is VALID [2018-11-23 12:16:51,402 INFO L273 TraceCheckUtils]: 29: Hoare triple {623#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {623#true} is VALID [2018-11-23 12:16:51,402 INFO L273 TraceCheckUtils]: 30: Hoare triple {623#true} assume true; {623#true} is VALID [2018-11-23 12:16:51,405 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {623#true} {625#(<= 2 ~N~0)} #71#return; {625#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:51,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {625#(<= 2 ~N~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {626#(and (<= 2 ~N~0) (= main_~i~1 0))} is VALID [2018-11-23 12:16:51,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {626#(and (<= 2 ~N~0) (= main_~i~1 0))} assume !(~i~1 < ~N~0 - 1); {624#false} is VALID [2018-11-23 12:16:51,408 INFO L273 TraceCheckUtils]: 34: Hoare triple {624#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {624#false} is VALID [2018-11-23 12:16:51,408 INFO L256 TraceCheckUtils]: 35: Hoare triple {624#false} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {623#true} is VALID [2018-11-23 12:16:51,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {623#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {623#true} is VALID [2018-11-23 12:16:51,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {623#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {623#true} is VALID [2018-11-23 12:16:51,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {623#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {623#true} is VALID [2018-11-23 12:16:51,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {623#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {623#true} is VALID [2018-11-23 12:16:51,410 INFO L273 TraceCheckUtils]: 40: Hoare triple {623#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {623#true} is VALID [2018-11-23 12:16:51,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {623#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {623#true} is VALID [2018-11-23 12:16:51,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {623#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {623#true} is VALID [2018-11-23 12:16:51,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {623#true} assume !(~i~0 < ~N~0); {623#true} is VALID [2018-11-23 12:16:51,411 INFO L273 TraceCheckUtils]: 44: Hoare triple {623#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {623#true} is VALID [2018-11-23 12:16:51,411 INFO L273 TraceCheckUtils]: 45: Hoare triple {623#true} assume true; {623#true} is VALID [2018-11-23 12:16:51,412 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {623#true} {624#false} #73#return; {624#false} is VALID [2018-11-23 12:16:51,412 INFO L273 TraceCheckUtils]: 47: Hoare triple {624#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {624#false} is VALID [2018-11-23 12:16:51,412 INFO L273 TraceCheckUtils]: 48: Hoare triple {624#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {624#false} is VALID [2018-11-23 12:16:51,413 INFO L273 TraceCheckUtils]: 49: Hoare triple {624#false} assume !false; {624#false} is VALID [2018-11-23 12:16:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:16:51,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:51,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:16:51,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-23 12:16:51,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:51,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:16:51,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:51,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:16:51,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:16:51,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:16:51,509 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2018-11-23 12:16:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,734 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 12:16:51,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:16:51,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-23 12:16:51,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:16:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-23 12:16:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:16:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-23 12:16:51,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2018-11-23 12:16:51,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:51,810 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:16:51,810 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:16:51,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:16:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:16:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:16:51,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:51,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:16:51,851 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:16:51,851 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:16:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,855 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-23 12:16:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 12:16:51,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:51,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:51,856 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:16:51,857 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:16:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,859 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-23 12:16:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 12:16:51,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:51,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:51,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:51,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:16:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 12:16:51,863 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 50 [2018-11-23 12:16:51,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:51,864 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 12:16:51,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:16:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:16:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:16:51,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:51,866 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:51,866 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:51,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:51,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1671851891, now seen corresponding path program 1 times [2018-11-23 12:16:51,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:51,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:51,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:51,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:51,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:53,151 INFO L256 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2018-11-23 12:16:53,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {804#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {804#true} is VALID [2018-11-23 12:16:53,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2018-11-23 12:16:53,152 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #65#return; {804#true} is VALID [2018-11-23 12:16:53,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret13 := main(); {804#true} is VALID [2018-11-23 12:16:53,153 INFO L273 TraceCheckUtils]: 5: Hoare triple {804#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {804#true} is VALID [2018-11-23 12:16:53,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {804#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {804#true} is VALID [2018-11-23 12:16:53,154 INFO L256 TraceCheckUtils]: 7: Hoare triple {804#true} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {804#true} is VALID [2018-11-23 12:16:53,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {804#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {806#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:53,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {806#(= sep_~ret~0 0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {806#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:53,163 INFO L273 TraceCheckUtils]: 10: Hoare triple {806#(= sep_~ret~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:53,163 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:53,164 INFO L273 TraceCheckUtils]: 12: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:53,165 INFO L273 TraceCheckUtils]: 13: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:53,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:53,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !(~i~0 < ~N~0); {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:53,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {809#(or (<= 4294967298 |sep_#res|) (= |sep_#res| 2) (<= (+ |sep_#res| 4294967294) 0))} is VALID [2018-11-23 12:16:53,170 INFO L273 TraceCheckUtils]: 17: Hoare triple {809#(or (<= 4294967298 |sep_#res|) (= |sep_#res| 2) (<= (+ |sep_#res| 4294967294) 0))} assume true; {809#(or (<= 4294967298 |sep_#res|) (= |sep_#res| 2) (<= (+ |sep_#res| 4294967294) 0))} is VALID [2018-11-23 12:16:53,176 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {809#(or (<= 4294967298 |sep_#res|) (= |sep_#res| 2) (<= (+ |sep_#res| 4294967294) 0))} {804#true} #69#return; {810#(or (= |main_#t~ret5| 2) (<= (+ |main_#t~ret5| 4294967294) 0) (<= 4294967298 |main_#t~ret5|))} is VALID [2018-11-23 12:16:53,179 INFO L273 TraceCheckUtils]: 19: Hoare triple {810#(or (= |main_#t~ret5| 2) (<= (+ |main_#t~ret5| 4294967294) 0) (<= 4294967298 |main_#t~ret5|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {811#(= main_~ret~1 2)} is VALID [2018-11-23 12:16:53,179 INFO L256 TraceCheckUtils]: 20: Hoare triple {811#(= main_~ret~1 2)} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {804#true} is VALID [2018-11-23 12:16:53,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {804#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {806#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:53,180 INFO L273 TraceCheckUtils]: 22: Hoare triple {806#(= sep_~ret~0 0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {806#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:53,181 INFO L273 TraceCheckUtils]: 23: Hoare triple {806#(= sep_~ret~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:53,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:53,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:53,184 INFO L273 TraceCheckUtils]: 26: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:53,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:53,186 INFO L273 TraceCheckUtils]: 28: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !(~i~0 < ~N~0); {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:53,187 INFO L273 TraceCheckUtils]: 29: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {809#(or (<= 4294967298 |sep_#res|) (= |sep_#res| 2) (<= (+ |sep_#res| 4294967294) 0))} is VALID [2018-11-23 12:16:53,188 INFO L273 TraceCheckUtils]: 30: Hoare triple {809#(or (<= 4294967298 |sep_#res|) (= |sep_#res| 2) (<= (+ |sep_#res| 4294967294) 0))} assume true; {809#(or (<= 4294967298 |sep_#res|) (= |sep_#res| 2) (<= (+ |sep_#res| 4294967294) 0))} is VALID [2018-11-23 12:16:53,190 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {809#(or (<= 4294967298 |sep_#res|) (= |sep_#res| 2) (<= (+ |sep_#res| 4294967294) 0))} {811#(= main_~ret~1 2)} #71#return; {812#(and (or (<= 4294967298 |main_#t~ret8|) (<= (+ |main_#t~ret8| 4294967294) 0) (= main_~ret~1 |main_#t~ret8|)) (= main_~ret~1 2))} is VALID [2018-11-23 12:16:53,192 INFO L273 TraceCheckUtils]: 32: Hoare triple {812#(and (or (<= 4294967298 |main_#t~ret8|) (<= (+ |main_#t~ret8| 4294967294) 0) (= main_~ret~1 |main_#t~ret8|)) (= main_~ret~1 2))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} is VALID [2018-11-23 12:16:53,193 INFO L273 TraceCheckUtils]: 33: Hoare triple {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} assume !!(~i~1 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~mem11; {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} is VALID [2018-11-23 12:16:53,195 INFO L273 TraceCheckUtils]: 34: Hoare triple {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} #t~post10 := ~i~1;~i~1 := 1 + #t~post10;havoc #t~post10; {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} is VALID [2018-11-23 12:16:53,196 INFO L273 TraceCheckUtils]: 35: Hoare triple {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} assume !(~i~1 < ~N~0 - 1); {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} is VALID [2018-11-23 12:16:53,197 INFO L273 TraceCheckUtils]: 36: Hoare triple {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} is VALID [2018-11-23 12:16:53,197 INFO L256 TraceCheckUtils]: 37: Hoare triple {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {804#true} is VALID [2018-11-23 12:16:53,198 INFO L273 TraceCheckUtils]: 38: Hoare triple {804#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {806#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:53,199 INFO L273 TraceCheckUtils]: 39: Hoare triple {806#(= sep_~ret~0 0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {806#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:53,201 INFO L273 TraceCheckUtils]: 40: Hoare triple {806#(= sep_~ret~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:53,204 INFO L273 TraceCheckUtils]: 41: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:53,204 INFO L273 TraceCheckUtils]: 42: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:53,206 INFO L273 TraceCheckUtils]: 43: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:53,209 INFO L273 TraceCheckUtils]: 44: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:53,210 INFO L273 TraceCheckUtils]: 45: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !(~i~0 < ~N~0); {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:53,211 INFO L273 TraceCheckUtils]: 46: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} is VALID [2018-11-23 12:16:53,212 INFO L273 TraceCheckUtils]: 47: Hoare triple {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} assume true; {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} is VALID [2018-11-23 12:16:53,213 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} #73#return; {815#(and (= main_~ret~1 |main_#t~ret12|) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:53,213 INFO L273 TraceCheckUtils]: 49: Hoare triple {815#(and (= main_~ret~1 |main_#t~ret12|) (= main_~ret2~0 main_~ret~1))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {816#(and (= main_~ret5~0 main_~ret~1) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:53,214 INFO L273 TraceCheckUtils]: 50: Hoare triple {816#(and (= main_~ret5~0 main_~ret~1) (= main_~ret2~0 main_~ret~1))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {805#false} is VALID [2018-11-23 12:16:53,214 INFO L273 TraceCheckUtils]: 51: Hoare triple {805#false} assume !false; {805#false} is VALID [2018-11-23 12:16:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 4 proven. 45 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:16:53,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:53,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:53,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:53,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:54,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2018-11-23 12:16:54,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {804#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {804#true} is VALID [2018-11-23 12:16:54,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2018-11-23 12:16:54,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #65#return; {804#true} is VALID [2018-11-23 12:16:54,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret13 := main(); {804#true} is VALID [2018-11-23 12:16:54,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {804#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {804#true} is VALID [2018-11-23 12:16:54,219 INFO L273 TraceCheckUtils]: 6: Hoare triple {804#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {804#true} is VALID [2018-11-23 12:16:54,219 INFO L256 TraceCheckUtils]: 7: Hoare triple {804#true} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {804#true} is VALID [2018-11-23 12:16:54,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {804#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {806#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:54,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {806#(= sep_~ret~0 0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {806#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:54,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {806#(= sep_~ret~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:54,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:54,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:54,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:54,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:54,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !(~i~0 < ~N~0); {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:54,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} is VALID [2018-11-23 12:16:54,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} assume true; {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} is VALID [2018-11-23 12:16:54,234 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} {804#true} #69#return; {874#(and (<= |main_#t~ret5| 2) (<= 2 |main_#t~ret5|))} is VALID [2018-11-23 12:16:54,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {874#(and (<= |main_#t~ret5| 2) (<= 2 |main_#t~ret5|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {811#(= main_~ret~1 2)} is VALID [2018-11-23 12:16:54,236 INFO L256 TraceCheckUtils]: 20: Hoare triple {811#(= main_~ret~1 2)} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {804#true} is VALID [2018-11-23 12:16:54,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {804#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {806#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:54,237 INFO L273 TraceCheckUtils]: 22: Hoare triple {806#(= sep_~ret~0 0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {806#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:54,239 INFO L273 TraceCheckUtils]: 23: Hoare triple {806#(= sep_~ret~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:54,240 INFO L273 TraceCheckUtils]: 24: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:54,241 INFO L273 TraceCheckUtils]: 25: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:54,242 INFO L273 TraceCheckUtils]: 26: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:54,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:54,244 INFO L273 TraceCheckUtils]: 28: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !(~i~0 < ~N~0); {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:54,246 INFO L273 TraceCheckUtils]: 29: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} is VALID [2018-11-23 12:16:54,247 INFO L273 TraceCheckUtils]: 30: Hoare triple {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} assume true; {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} is VALID [2018-11-23 12:16:54,249 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} {811#(= main_~ret~1 2)} #71#return; {914#(and (<= |main_#t~ret8| 2) (= main_~ret~1 2) (<= 2 |main_#t~ret8|))} is VALID [2018-11-23 12:16:54,254 INFO L273 TraceCheckUtils]: 32: Hoare triple {914#(and (<= |main_#t~ret8| 2) (= main_~ret~1 2) (<= 2 |main_#t~ret8|))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} is VALID [2018-11-23 12:16:54,255 INFO L273 TraceCheckUtils]: 33: Hoare triple {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} assume !!(~i~1 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~mem11; {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} is VALID [2018-11-23 12:16:54,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} #t~post10 := ~i~1;~i~1 := 1 + #t~post10;havoc #t~post10; {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} is VALID [2018-11-23 12:16:54,256 INFO L273 TraceCheckUtils]: 35: Hoare triple {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} assume !(~i~1 < ~N~0 - 1); {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} is VALID [2018-11-23 12:16:54,257 INFO L273 TraceCheckUtils]: 36: Hoare triple {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} is VALID [2018-11-23 12:16:54,257 INFO L256 TraceCheckUtils]: 37: Hoare triple {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {804#true} is VALID [2018-11-23 12:16:54,257 INFO L273 TraceCheckUtils]: 38: Hoare triple {804#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {806#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:54,258 INFO L273 TraceCheckUtils]: 39: Hoare triple {806#(= sep_~ret~0 0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {806#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:54,259 INFO L273 TraceCheckUtils]: 40: Hoare triple {806#(= sep_~ret~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:54,260 INFO L273 TraceCheckUtils]: 41: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:54,261 INFO L273 TraceCheckUtils]: 42: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:54,262 INFO L273 TraceCheckUtils]: 43: Hoare triple {807#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:54,263 INFO L273 TraceCheckUtils]: 44: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:54,264 INFO L273 TraceCheckUtils]: 45: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !(~i~0 < ~N~0); {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:54,266 INFO L273 TraceCheckUtils]: 46: Hoare triple {808#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} is VALID [2018-11-23 12:16:54,267 INFO L273 TraceCheckUtils]: 47: Hoare triple {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} assume true; {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} is VALID [2018-11-23 12:16:54,269 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {814#(and (<= 2 |sep_#res|) (<= |sep_#res| 2))} {813#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} #73#return; {966#(and (<= |main_#t~ret12| 2) (<= 2 |main_#t~ret12|) (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} is VALID [2018-11-23 12:16:54,270 INFO L273 TraceCheckUtils]: 49: Hoare triple {966#(and (<= |main_#t~ret12| 2) (<= 2 |main_#t~ret12|) (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {970#(and (<= 2 main_~ret5~0) (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2) (<= main_~ret5~0 2))} is VALID [2018-11-23 12:16:54,271 INFO L273 TraceCheckUtils]: 50: Hoare triple {970#(and (<= 2 main_~ret5~0) (= main_~ret2~0 main_~ret~1) (= main_~ret~1 2) (<= main_~ret5~0 2))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {805#false} is VALID [2018-11-23 12:16:54,272 INFO L273 TraceCheckUtils]: 51: Hoare triple {805#false} assume !false; {805#false} is VALID [2018-11-23 12:16:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:54,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:54,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2018-11-23 12:16:54,300 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-23 12:16:54,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:54,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:16:54,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:54,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:16:54,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:16:54,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:16:54,362 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 17 states. [2018-11-23 12:16:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:56,503 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2018-11-23 12:16:56,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:16:56,503 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-23 12:16:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:16:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2018-11-23 12:16:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:16:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2018-11-23 12:16:56,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 95 transitions. [2018-11-23 12:16:56,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:56,656 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:16:56,656 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 12:16:56,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 14 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:16:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 12:16:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-11-23 12:16:56,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:56,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 53 states. [2018-11-23 12:16:56,729 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 53 states. [2018-11-23 12:16:56,729 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 53 states. [2018-11-23 12:16:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:56,737 INFO L93 Difference]: Finished difference Result 73 states and 101 transitions. [2018-11-23 12:16:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2018-11-23 12:16:56,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:56,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:56,740 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 73 states. [2018-11-23 12:16:56,740 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 73 states. [2018-11-23 12:16:56,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:56,749 INFO L93 Difference]: Finished difference Result 73 states and 101 transitions. [2018-11-23 12:16:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2018-11-23 12:16:56,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:56,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:56,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:56,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:16:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2018-11-23 12:16:56,756 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 52 [2018-11-23 12:16:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:56,757 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2018-11-23 12:16:56,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:16:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2018-11-23 12:16:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:16:56,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:56,759 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:56,762 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:56,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:56,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1943057035, now seen corresponding path program 1 times [2018-11-23 12:16:56,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:56,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:56,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:56,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:56,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:58,805 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: must not be argument of unary minus + at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:16:58,810 INFO L168 Benchmark]: Toolchain (without parser) took 13032.04 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 851.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -630.8 MB). Peak memory consumption was 220.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:58,812 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:16:58,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:58,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:16:58,814 INFO L168 Benchmark]: Boogie Preprocessor took 34.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:16:58,815 INFO L168 Benchmark]: RCFGBuilder took 834.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -738.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:58,816 INFO L168 Benchmark]: TraceAbstraction took 11801.17 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 145.8 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 96.8 MB). Peak memory consumption was 242.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:58,820 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 331.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 834.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -738.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11801.17 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 145.8 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 96.8 MB). Peak memory consumption was 242.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: must not be argument of unary minus + de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: must not be argument of unary minus +: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...