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/avg_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:15:11,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:15:11,788 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:15:11,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:15:11,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:15:11,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:15:11,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:15:11,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:15:11,809 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:15:11,809 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:15:11,810 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:15:11,810 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:15:11,811 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:15:11,812 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:15:11,813 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:15:11,814 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:15:11,815 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:15:11,817 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:15:11,819 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:15:11,820 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:15:11,821 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:15:11,823 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:15:11,825 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:15:11,825 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:15:11,826 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:15:11,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:15:11,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:15:11,828 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:15:11,829 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:15:11,830 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:15:11,831 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:15:11,831 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:15:11,832 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:15:11,832 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:15:11,833 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:15:11,834 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:15:11,834 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:15:11,857 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:15:11,857 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:15:11,858 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:15:11,858 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:15:11,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:15:11,860 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:15:11,860 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:15:11,861 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:15:11,861 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:15:11,861 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:15:11,861 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:15:11,861 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:15:11,863 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:15:11,863 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:15:11,863 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:15:11,863 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:15:11,863 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:15:11,864 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:15:11,864 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:15:11,864 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:15:11,864 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:15:11,864 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:15:11,866 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:15:11,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:15:11,866 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:15:11,866 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:15:11,867 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:15:11,867 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:15:11,867 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:15:11,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:15:11,867 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:15:11,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:15:11,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:15:11,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:15:11,937 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:15:11,937 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:15:11,938 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/avg_true-unreach-call_true-termination.i [2018-11-23 12:15:11,992 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5285b34c6/56e9ef32fcf34f11bb3dc616d909c2ca/FLAG96619d7cf [2018-11-23 12:15:12,390 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:15:12,391 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg_true-unreach-call_true-termination.i [2018-11-23 12:15:12,398 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5285b34c6/56e9ef32fcf34f11bb3dc616d909c2ca/FLAG96619d7cf [2018-11-23 12:15:12,769 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5285b34c6/56e9ef32fcf34f11bb3dc616d909c2ca [2018-11-23 12:15:12,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:15:12,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:15:12,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:15:12,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:15:12,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:15:12,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:15:12" (1/1) ... [2018-11-23 12:15:12,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d94b8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:12, skipping insertion in model container [2018-11-23 12:15:12,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:15:12" (1/1) ... [2018-11-23 12:15:12,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:15:12,824 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:15:13,056 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:15:13,069 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:15:13,107 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:15:13,128 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:15:13,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:13 WrapperNode [2018-11-23 12:15:13,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:15:13,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:15:13,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:15:13,130 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:15:13,139 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:15:13" (1/1) ... [2018-11-23 12:15:13,149 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:15:13" (1/1) ... [2018-11-23 12:15:13,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:15:13,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:15:13,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:15:13,159 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:15:13,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:13" (1/1) ... [2018-11-23 12:15:13,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:13" (1/1) ... [2018-11-23 12:15:13,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:13" (1/1) ... [2018-11-23 12:15:13,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:13" (1/1) ... [2018-11-23 12:15:13,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:13" (1/1) ... [2018-11-23 12:15:13,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:13" (1/1) ... [2018-11-23 12:15:13,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:13" (1/1) ... [2018-11-23 12:15:13,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:15:13,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:15:13,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:15:13,229 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:15:13,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:13" (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:15:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:15:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:15:13,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:15:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure avg [2018-11-23 12:15:13,390 INFO L138 BoogieDeclarations]: Found implementation of procedure avg [2018-11-23 12:15:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:15:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:15:13,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:15:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:15:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:15:13,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:15:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:15:14,175 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:15:14,176 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:15:14,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:14 BoogieIcfgContainer [2018-11-23 12:15:14,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:15:14,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:15:14,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:15:14,181 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:15:14,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:15:12" (1/3) ... [2018-11-23 12:15:14,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78752e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:15:14, skipping insertion in model container [2018-11-23 12:15:14,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:13" (2/3) ... [2018-11-23 12:15:14,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78752e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:15:14, skipping insertion in model container [2018-11-23 12:15:14,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:14" (3/3) ... [2018-11-23 12:15:14,185 INFO L112 eAbstractionObserver]: Analyzing ICFG avg_true-unreach-call_true-termination.i [2018-11-23 12:15:14,193 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:15:14,200 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:15:14,215 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:15:14,256 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:15:14,257 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:15:14,257 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:15:14,257 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:15:14,257 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:15:14,257 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:15:14,258 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:15:14,258 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:15:14,258 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:15:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:15:14,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:15:14,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:14,284 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:15:14,287 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:14,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:14,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1931873834, now seen corresponding path program 1 times [2018-11-23 12:15:14,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:14,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:14,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:14,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:14,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:14,393 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:15:14,393 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:15:14,394 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:15:14,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:14,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:14,883 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:15:14,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {34#true} is VALID [2018-11-23 12:15:14,888 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:15:14,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #60#return; {34#true} is VALID [2018-11-23 12:15:14,889 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret11 := main(); {34#true} is VALID [2018-11-23 12:15:14,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {34#true} is VALID [2018-11-23 12:15:14,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#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; {57#(< 1 ~N~0)} is VALID [2018-11-23 12:15:14,894 INFO L256 TraceCheckUtils]: 7: Hoare triple {57#(< 1 ~N~0)} call #t~ret3 := avg(~#x~0.base, ~#x~0.offset); {57#(< 1 ~N~0)} is VALID [2018-11-23 12:15:14,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#(< 1 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {64#(and (<= avg_~i~0 0) (< 1 ~N~0))} is VALID [2018-11-23 12:15:14,898 INFO L273 TraceCheckUtils]: 9: Hoare triple {64#(and (<= avg_~i~0 0) (< 1 ~N~0))} assume !(~i~0 < ~N~0); {35#false} is VALID [2018-11-23 12:15:14,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:15:14,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:15:14,899 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#false} {57#(< 1 ~N~0)} #64#return; {35#false} is VALID [2018-11-23 12:15:14,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:15:14,900 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret6 := avg(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 12:15:14,900 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {35#false} is VALID [2018-11-23 12:15:14,901 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume !(~i~0 < ~N~0); {35#false} is VALID [2018-11-23 12:15:14,901 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:15:14,901 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:15:14,902 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#false} {35#false} #66#return; {35#false} is VALID [2018-11-23 12:15:14,902 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {35#false} is VALID [2018-11-23 12:15:14,903 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !(~i~1 < ~N~0 - 1); {35#false} is VALID [2018-11-23 12:15:14,903 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {35#false} is VALID [2018-11-23 12:15:14,903 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret10 := avg(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 12:15:14,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {35#false} is VALID [2018-11-23 12:15:14,904 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#false} assume !(~i~0 < ~N~0); {35#false} is VALID [2018-11-23 12:15:14,904 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:15:14,905 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:15:14,905 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#false} {35#false} #68#return; {35#false} is VALID [2018-11-23 12:15:14,905 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {35#false} is VALID [2018-11-23 12:15:14,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {35#false} is VALID [2018-11-23 12:15:14,906 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:15:14,914 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:15:14,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:15:14,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:15:14,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 12:15:14,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:14,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:15:15,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:15,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:15:15,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:15:15,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:15:15,111 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-11-23 12:15:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:15,867 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-23 12:15:15,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:15:15,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 12:15:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:15,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:15:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 12:15:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:15:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 12:15:15,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2018-11-23 12:15:16,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:16,096 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:15:16,096 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:15:16,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:15:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:15:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 12:15:16,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:16,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 12:15:16,149 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 12:15:16,149 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 12:15:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:16,155 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 12:15:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:15:16,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:16,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:16,156 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 12:15:16,157 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 12:15:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:16,161 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 12:15:16,162 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:15:16,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:16,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:16,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:16,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:15:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 12:15:16,169 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 32 [2018-11-23 12:15:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:16,169 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 12:15:16,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:15:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:15:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:15:16,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:16,171 INFO L402 BasicCegarLoop]: trace histogram [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:15:16,172 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:16,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:16,172 INFO L82 PathProgramCache]: Analyzing trace with hash -334011672, now seen corresponding path program 1 times [2018-11-23 12:15:16,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:16,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:16,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:16,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:16,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:16,191 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:15:16,191 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:15:16,192 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:15:16,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:16,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:16,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2018-11-23 12:15:16,739 INFO L273 TraceCheckUtils]: 1: Hoare triple {301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {301#true} is VALID [2018-11-23 12:15:16,739 INFO L273 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 12:15:16,739 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2018-11-23 12:15:16,740 INFO L256 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret11 := main(); {301#true} is VALID [2018-11-23 12:15:16,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {301#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {301#true} is VALID [2018-11-23 12:15:16,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {301#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; {324#(< 1 ~N~0)} is VALID [2018-11-23 12:15:16,742 INFO L256 TraceCheckUtils]: 7: Hoare triple {324#(< 1 ~N~0)} call #t~ret3 := avg(~#x~0.base, ~#x~0.offset); {324#(< 1 ~N~0)} is VALID [2018-11-23 12:15:16,742 INFO L273 TraceCheckUtils]: 8: Hoare triple {324#(< 1 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {331#(and (<= avg_~i~0 0) (< 1 ~N~0))} is VALID [2018-11-23 12:15:16,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {331#(and (<= avg_~i~0 0) (< 1 ~N~0))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {331#(and (<= avg_~i~0 0) (< 1 ~N~0))} is VALID [2018-11-23 12:15:16,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {331#(and (<= avg_~i~0 0) (< 1 ~N~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {338#(and (<= avg_~i~0 1) (< 1 ~N~0))} is VALID [2018-11-23 12:15:16,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#(and (<= avg_~i~0 1) (< 1 ~N~0))} assume !(~i~0 < ~N~0); {302#false} is VALID [2018-11-23 12:15:16,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {302#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 - 4294967296); {302#false} is VALID [2018-11-23 12:15:16,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {302#false} assume true; {302#false} is VALID [2018-11-23 12:15:16,748 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {302#false} {324#(< 1 ~N~0)} #64#return; {302#false} is VALID [2018-11-23 12:15:16,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {302#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {302#false} is VALID [2018-11-23 12:15:16,749 INFO L256 TraceCheckUtils]: 16: Hoare triple {302#false} call #t~ret6 := avg(~#x~0.base, ~#x~0.offset); {302#false} is VALID [2018-11-23 12:15:16,749 INFO L273 TraceCheckUtils]: 17: Hoare triple {302#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {302#false} is VALID [2018-11-23 12:15:16,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {302#false} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {302#false} is VALID [2018-11-23 12:15:16,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {302#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {302#false} is VALID [2018-11-23 12:15:16,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {302#false} assume !(~i~0 < ~N~0); {302#false} is VALID [2018-11-23 12:15:16,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {302#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 - 4294967296); {302#false} is VALID [2018-11-23 12:15:16,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {302#false} assume true; {302#false} is VALID [2018-11-23 12:15:16,751 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {302#false} {302#false} #66#return; {302#false} is VALID [2018-11-23 12:15:16,751 INFO L273 TraceCheckUtils]: 24: Hoare triple {302#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {302#false} is VALID [2018-11-23 12:15:16,752 INFO L273 TraceCheckUtils]: 25: Hoare triple {302#false} assume !(~i~1 < ~N~0 - 1); {302#false} is VALID [2018-11-23 12:15:16,752 INFO L273 TraceCheckUtils]: 26: Hoare triple {302#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {302#false} is VALID [2018-11-23 12:15:16,752 INFO L256 TraceCheckUtils]: 27: Hoare triple {302#false} call #t~ret10 := avg(~#x~0.base, ~#x~0.offset); {302#false} is VALID [2018-11-23 12:15:16,753 INFO L273 TraceCheckUtils]: 28: Hoare triple {302#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {302#false} is VALID [2018-11-23 12:15:16,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {302#false} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {302#false} is VALID [2018-11-23 12:15:16,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {302#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {302#false} is VALID [2018-11-23 12:15:16,754 INFO L273 TraceCheckUtils]: 31: Hoare triple {302#false} assume !(~i~0 < ~N~0); {302#false} is VALID [2018-11-23 12:15:16,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {302#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 - 4294967296); {302#false} is VALID [2018-11-23 12:15:16,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {302#false} assume true; {302#false} is VALID [2018-11-23 12:15:16,755 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {302#false} {302#false} #68#return; {302#false} is VALID [2018-11-23 12:15:16,755 INFO L273 TraceCheckUtils]: 35: Hoare triple {302#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {302#false} is VALID [2018-11-23 12:15:16,755 INFO L273 TraceCheckUtils]: 36: Hoare triple {302#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {302#false} is VALID [2018-11-23 12:15:16,756 INFO L273 TraceCheckUtils]: 37: Hoare triple {302#false} assume !false; {302#false} is VALID [2018-11-23 12:15:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 12:15:16,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:15:16,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:15:16,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-23 12:15:16,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:16,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:15:16,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:16,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:15:16,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:15:16,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:15:16,879 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2018-11-23 12:15:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:17,133 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-23 12:15:17,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:15:17,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-23 12:15:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:15:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:15:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:15:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:15:17,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2018-11-23 12:15:17,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:17,253 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:15:17,253 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:15:17,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:15:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:15:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:15:17,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:17,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:15:17,281 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:15:17,281 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:15:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:17,284 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 12:15:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:15:17,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:17,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:17,286 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:15:17,286 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:15:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:17,289 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 12:15:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:15:17,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:17,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:17,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:17,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:15:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 12:15:17,293 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 38 [2018-11-23 12:15:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:17,293 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 12:15:17,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:15:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 12:15:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:15:17,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:17,296 INFO L402 BasicCegarLoop]: trace histogram [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:15:17,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:17,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:17,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1171787482, now seen corresponding path program 2 times [2018-11-23 12:15:17,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:17,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:17,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:17,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:17,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:17,315 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:15:17,316 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:15:17,316 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:15:17,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:15:17,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:15:17,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:15:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:17,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:17,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {582#true} call ULTIMATE.init(); {582#true} is VALID [2018-11-23 12:15:17,521 INFO L273 TraceCheckUtils]: 1: Hoare triple {582#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {582#true} is VALID [2018-11-23 12:15:17,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2018-11-23 12:15:17,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #60#return; {582#true} is VALID [2018-11-23 12:15:17,522 INFO L256 TraceCheckUtils]: 4: Hoare triple {582#true} call #t~ret11 := main(); {582#true} is VALID [2018-11-23 12:15:17,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {582#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {582#true} is VALID [2018-11-23 12:15:17,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {582#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; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,534 INFO L256 TraceCheckUtils]: 7: Hoare triple {605#(< 1 ~N~0)} call #t~ret3 := avg(~#x~0.base, ~#x~0.offset); {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {605#(< 1 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {605#(< 1 ~N~0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,535 INFO L273 TraceCheckUtils]: 10: Hoare triple {605#(< 1 ~N~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {605#(< 1 ~N~0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {605#(< 1 ~N~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,537 INFO L273 TraceCheckUtils]: 13: Hoare triple {605#(< 1 ~N~0)} assume !(~i~0 < ~N~0); {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {605#(< 1 ~N~0)} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 - 4294967296); {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {605#(< 1 ~N~0)} assume true; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,539 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {605#(< 1 ~N~0)} {605#(< 1 ~N~0)} #64#return; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {605#(< 1 ~N~0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,546 INFO L256 TraceCheckUtils]: 18: Hoare triple {605#(< 1 ~N~0)} call #t~ret6 := avg(~#x~0.base, ~#x~0.offset); {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,546 INFO L273 TraceCheckUtils]: 19: Hoare triple {605#(< 1 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,548 INFO L273 TraceCheckUtils]: 20: Hoare triple {605#(< 1 ~N~0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,548 INFO L273 TraceCheckUtils]: 21: Hoare triple {605#(< 1 ~N~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {605#(< 1 ~N~0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,550 INFO L273 TraceCheckUtils]: 23: Hoare triple {605#(< 1 ~N~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {605#(< 1 ~N~0)} assume !(~i~0 < ~N~0); {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,551 INFO L273 TraceCheckUtils]: 25: Hoare triple {605#(< 1 ~N~0)} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 - 4294967296); {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {605#(< 1 ~N~0)} assume true; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,552 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {605#(< 1 ~N~0)} {605#(< 1 ~N~0)} #66#return; {605#(< 1 ~N~0)} is VALID [2018-11-23 12:15:17,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {605#(< 1 ~N~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {672#(and (<= main_~i~1 0) (< 1 ~N~0))} is VALID [2018-11-23 12:15:17,554 INFO L273 TraceCheckUtils]: 29: Hoare triple {672#(and (<= main_~i~1 0) (< 1 ~N~0))} assume !(~i~1 < ~N~0 - 1); {583#false} is VALID [2018-11-23 12:15:17,555 INFO L273 TraceCheckUtils]: 30: Hoare triple {583#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {583#false} is VALID [2018-11-23 12:15:17,555 INFO L256 TraceCheckUtils]: 31: Hoare triple {583#false} call #t~ret10 := avg(~#x~0.base, ~#x~0.offset); {583#false} is VALID [2018-11-23 12:15:17,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {583#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {583#false} is VALID [2018-11-23 12:15:17,556 INFO L273 TraceCheckUtils]: 33: Hoare triple {583#false} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {583#false} is VALID [2018-11-23 12:15:17,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {583#false} is VALID [2018-11-23 12:15:17,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {583#false} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {583#false} is VALID [2018-11-23 12:15:17,557 INFO L273 TraceCheckUtils]: 36: Hoare triple {583#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {583#false} is VALID [2018-11-23 12:15:17,558 INFO L273 TraceCheckUtils]: 37: Hoare triple {583#false} assume !(~i~0 < ~N~0); {583#false} is VALID [2018-11-23 12:15:17,558 INFO L273 TraceCheckUtils]: 38: Hoare triple {583#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~N~0 then (if ~N~0 < 0 then ~ret~0 / ~N~0 - 1 else 1 + ~ret~0 / ~N~0) else ~ret~0 / ~N~0) % 4294967296 - 4294967296); {583#false} is VALID [2018-11-23 12:15:17,558 INFO L273 TraceCheckUtils]: 39: Hoare triple {583#false} assume true; {583#false} is VALID [2018-11-23 12:15:17,559 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {583#false} {583#false} #68#return; {583#false} is VALID [2018-11-23 12:15:17,559 INFO L273 TraceCheckUtils]: 41: Hoare triple {583#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {583#false} is VALID [2018-11-23 12:15:17,559 INFO L273 TraceCheckUtils]: 42: Hoare triple {583#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {583#false} is VALID [2018-11-23 12:15:17,560 INFO L273 TraceCheckUtils]: 43: Hoare triple {583#false} assume !false; {583#false} is VALID [2018-11-23 12:15:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 12:15:17,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:15:17,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:15:17,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-23 12:15:17,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:17,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:15:17,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:17,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:15:17,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:15:17,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:15:17,651 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2018-11-23 12:15:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:17,839 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:15:17,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:15:17,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-23 12:15:17,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:15:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-23 12:15:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:15:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-23 12:15:17,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2018-11-23 12:15:17,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:17,911 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:15:17,911 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:15:17,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 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:15:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:15:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:15:17,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:17,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:15:17,938 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:15:17,938 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:15:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:17,940 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 12:15:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 12:15:17,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:17,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:17,942 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:15:17,942 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:15:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:17,944 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 12:15:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 12:15:17,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:17,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:17,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:17,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:15:17,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 12:15:17,948 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 44 [2018-11-23 12:15:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:17,949 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 12:15:17,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:15:17,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:15:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:15:17,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:17,951 INFO L402 BasicCegarLoop]: trace histogram [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:15:17,951 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:17,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:17,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1051431772, now seen corresponding path program 1 times [2018-11-23 12:15:17,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:17,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:17,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:15:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:17,969 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:15:17,969 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:15:17,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:15:17,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:18,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:19,041 WARN L180 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2018-11-23 12:15:19,570 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-23 12:15:19,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:15:19,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 126 [2018-11-23 12:15:19,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:15:19,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:15:19,947 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 128 [2018-11-23 12:15:20,248 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-23 12:15:20,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:15:20,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 77 [2018-11-23 12:15:20,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:15:20,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:15:20,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:15:20,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 80 [2018-11-23 12:15:20,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:15:21,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:15:21,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:17:53,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:17:53,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 108 [2018-11-23 12:17:53,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:17:53,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:17:53,171 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 115 [2018-11-23 12:17:53,564 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2018-11-23 12:17:53,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:17:53,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 71 [2018-11-23 12:17:53,591 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 12:17:53,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:17:53,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:17:53,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 64 [2018-11-23 12:17:53,692 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 12:17:53,788 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:17:53,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.