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/array-multidimensional/init-non-constant-2-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:34:19,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:34:19,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:34:20,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:34:20,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:34:20,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:34:20,007 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:34:20,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:34:20,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:34:20,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:34:20,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:34:20,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:34:20,014 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:34:20,015 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:34:20,016 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:34:20,017 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:34:20,018 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:34:20,020 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:34:20,022 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:34:20,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:34:20,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:34:20,026 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:34:20,028 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:34:20,029 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:34:20,029 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:34:20,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:34:20,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:34:20,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:34:20,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:34:20,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:34:20,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:34:20,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:34:20,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:34:20,035 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:34:20,036 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:34:20,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:34:20,037 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:34:20,053 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:34:20,053 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:34:20,054 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:34:20,054 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:34:20,054 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:34:20,055 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:34:20,055 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:34:20,055 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:34:20,055 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:34:20,056 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:34:20,056 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:34:20,056 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:34:20,056 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:34:20,057 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:34:20,057 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:34:20,057 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:34:20,057 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:34:20,057 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:34:20,058 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:34:20,058 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:34:20,058 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:34:20,058 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:34:20,059 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:34:20,059 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:34:20,059 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:34:20,059 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:34:20,059 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:34:20,060 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:34:20,060 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:34:20,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:34:20,060 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:34:20,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:34:20,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:34:20,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:34:20,122 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:34:20,123 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:34:20,124 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/init-non-constant-2-n-u_true-unreach-call.i [2018-11-23 12:34:20,185 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/180077681/51954e764e96411ba7c7eea2323787fc/FLAG0cfb7cd78 [2018-11-23 12:34:20,646 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:34:20,647 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-non-constant-2-n-u_true-unreach-call.i [2018-11-23 12:34:20,656 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/180077681/51954e764e96411ba7c7eea2323787fc/FLAG0cfb7cd78 [2018-11-23 12:34:21,008 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/180077681/51954e764e96411ba7c7eea2323787fc [2018-11-23 12:34:21,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:34:21,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:34:21,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:21,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:34:21,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:34:21,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:21" (1/1) ... [2018-11-23 12:34:21,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e523d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:21, skipping insertion in model container [2018-11-23 12:34:21,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:21" (1/1) ... [2018-11-23 12:34:21,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:34:21,070 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:34:21,337 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:21,346 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:34:21,373 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:21,398 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:34:21,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:21 WrapperNode [2018-11-23 12:34:21,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:21,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:21,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:34:21,400 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:34:21,410 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:34:21" (1/1) ... [2018-11-23 12:34:21,421 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:34:21" (1/1) ... [2018-11-23 12:34:21,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:21,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:34:21,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:34:21,430 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:34:21,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:21" (1/1) ... [2018-11-23 12:34:21,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:21" (1/1) ... [2018-11-23 12:34:21,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:21" (1/1) ... [2018-11-23 12:34:21,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:21" (1/1) ... [2018-11-23 12:34:21,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:21" (1/1) ... [2018-11-23 12:34:21,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:21" (1/1) ... [2018-11-23 12:34:21,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:21" (1/1) ... [2018-11-23 12:34:21,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:34:21,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:34:21,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:34:21,467 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:34:21,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:21" (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:34:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:34:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:34:21,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:34:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:34:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:34:21,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:34:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:34:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:34:21,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:34:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:34:21,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:34:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:34:22,280 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:34:22,281 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:34:22,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:22 BoogieIcfgContainer [2018-11-23 12:34:22,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:34:22,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:34:22,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:34:22,289 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:34:22,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:34:21" (1/3) ... [2018-11-23 12:34:22,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5eb776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:22, skipping insertion in model container [2018-11-23 12:34:22,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:21" (2/3) ... [2018-11-23 12:34:22,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5eb776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:22, skipping insertion in model container [2018-11-23 12:34:22,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:22" (3/3) ... [2018-11-23 12:34:22,293 INFO L112 eAbstractionObserver]: Analyzing ICFG init-non-constant-2-n-u_true-unreach-call.i [2018-11-23 12:34:22,305 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:34:22,315 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:34:22,332 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:34:22,362 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:34:22,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:34:22,363 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:34:22,364 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:34:22,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:34:22,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:34:22,364 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:34:22,364 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:34:22,365 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:34:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 12:34:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:34:22,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:22,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:22,391 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:22,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:22,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1832694891, now seen corresponding path program 1 times [2018-11-23 12:34:22,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:22,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:22,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:22,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:22,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:22,490 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:22,490 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:22,490 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:34:22,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:22,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:23,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 12:34:23,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29#true} is VALID [2018-11-23 12:34:23,053 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 12:34:23,053 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #73#return; {29#true} is VALID [2018-11-23 12:34:23,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2018-11-23 12:34:23,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;havoc ~q~0;havoc ~s~0;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~C~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~q~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~s~0 := #t~nondet3;havoc #t~nondet3;~i~0 := 0;~j~0 := 0;assume 0 != (if ~q~0 < ~m~0 then 1 else 0);assume 0 != (if ~s~0 < ~n~0 then 1 else 0); {49#(<= main_~i~0 0)} is VALID [2018-11-23 12:34:23,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {49#(<= main_~i~0 0)} assume !(~i~0 < ~q~0); {53#(<= main_~q~0 0)} is VALID [2018-11-23 12:34:23,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#(<= main_~q~0 0)} ~i~0 := 0;~j~0 := 0; {57#(and (<= main_~q~0 0) (<= 0 main_~i~0))} is VALID [2018-11-23 12:34:23,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#(and (<= main_~q~0 0) (<= 0 main_~i~0))} assume !!(~i~0 < ~q~0);~j~0 := 0; {30#false} is VALID [2018-11-23 12:34:23,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} assume !!(~j~0 < ~s~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {30#false} is VALID [2018-11-23 12:34:23,061 INFO L256 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 == (~i~0 + ~j~0 + ~C~0) % 4294967296 then 1 else 0)); {30#false} is VALID [2018-11-23 12:34:23,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-23 12:34:23,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2018-11-23 12:34:23,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 12:34:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:23,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:23,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:34:23,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:34:23,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:23,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:23,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:23,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:23,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:23,160 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2018-11-23 12:34:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:23,829 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2018-11-23 12:34:23,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:23,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:34:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2018-11-23 12:34:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2018-11-23 12:34:23,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 91 transitions. [2018-11-23 12:34:24,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:24,267 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:34:24,267 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:34:24,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:34:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-11-23 12:34:24,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:24,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 22 states. [2018-11-23 12:34:24,442 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 22 states. [2018-11-23 12:34:24,442 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 22 states. [2018-11-23 12:34:24,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:24,448 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 12:34:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 12:34:24,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:24,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:24,450 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 29 states. [2018-11-23 12:34:24,450 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 29 states. [2018-11-23 12:34:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:24,454 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 12:34:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 12:34:24,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:24,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:24,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:24,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:34:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 12:34:24,460 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2018-11-23 12:34:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:24,460 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 12:34:24,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 12:34:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:34:24,462 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:24,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:24,462 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:24,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1374604441, now seen corresponding path program 1 times [2018-11-23 12:34:24,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:24,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:24,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:24,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:24,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:24,473 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:24,473 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:24,473 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:34:24,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:24,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:24,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {254#true} is VALID [2018-11-23 12:34:24,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {254#true} is VALID [2018-11-23 12:34:24,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2018-11-23 12:34:24,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} #73#return; {254#true} is VALID [2018-11-23 12:34:24,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {254#true} call #t~ret5 := main(); {254#true} is VALID [2018-11-23 12:34:24,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {254#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;havoc ~q~0;havoc ~s~0;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~C~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~q~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~s~0 := #t~nondet3;havoc #t~nondet3;~i~0 := 0;~j~0 := 0;assume 0 != (if ~q~0 < ~m~0 then 1 else 0);assume 0 != (if ~s~0 < ~n~0 then 1 else 0); {254#true} is VALID [2018-11-23 12:34:24,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {254#true} assume !!(~i~0 < ~q~0);~j~0 := 0; {277#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:24,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {277#(<= main_~j~0 0)} assume !(~j~0 < ~s~0); {281#(<= main_~s~0 0)} is VALID [2018-11-23 12:34:24,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {281#(<= main_~s~0 0)} ~i~0 := 1 + ~i~0; {281#(<= main_~s~0 0)} is VALID [2018-11-23 12:34:24,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {281#(<= main_~s~0 0)} assume !(~i~0 < ~q~0); {281#(<= main_~s~0 0)} is VALID [2018-11-23 12:34:24,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {281#(<= main_~s~0 0)} ~i~0 := 0;~j~0 := 0; {281#(<= main_~s~0 0)} is VALID [2018-11-23 12:34:24,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {281#(<= main_~s~0 0)} assume !!(~i~0 < ~q~0);~j~0 := 0; {294#(and (<= 0 main_~j~0) (<= main_~s~0 0))} is VALID [2018-11-23 12:34:24,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {294#(and (<= 0 main_~j~0) (<= main_~s~0 0))} assume !!(~j~0 < ~s~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {255#false} is VALID [2018-11-23 12:34:24,743 INFO L256 TraceCheckUtils]: 13: Hoare triple {255#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 == (~i~0 + ~j~0 + ~C~0) % 4294967296 then 1 else 0)); {255#false} is VALID [2018-11-23 12:34:24,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {255#false} ~cond := #in~cond; {255#false} is VALID [2018-11-23 12:34:24,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {255#false} assume 0 == ~cond; {255#false} is VALID [2018-11-23 12:34:24,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {255#false} assume !false; {255#false} is VALID [2018-11-23 12:34:24,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:24,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:24,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:34:24,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:34:24,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:24,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:24,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:24,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:24,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:24,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:24,830 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2018-11-23 12:34:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:25,217 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2018-11-23 12:34:25,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:25,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:34:25,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-23 12:34:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-23 12:34:25,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2018-11-23 12:34:25,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:25,368 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:34:25,369 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:34:25,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:34:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-23 12:34:25,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:25,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 24 states. [2018-11-23 12:34:25,392 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 24 states. [2018-11-23 12:34:25,392 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 24 states. [2018-11-23 12:34:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:25,397 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 12:34:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:34:25,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:25,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:25,398 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 27 states. [2018-11-23 12:34:25,399 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 27 states. [2018-11-23 12:34:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:25,401 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 12:34:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:34:25,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:25,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:25,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:25,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:34:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 12:34:25,405 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2018-11-23 12:34:25,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:25,406 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 12:34:25,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:34:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:34:25,407 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:25,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:25,407 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:25,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:25,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1853309542, now seen corresponding path program 1 times [2018-11-23 12:34:25,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:25,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:25,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:25,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:25,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:25,416 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:25,416 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:25,416 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:34:25,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:25,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:25,740 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:25,741 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) 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.pqe.XnfDer.derSimple(XnfDer.java:130) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.tryToEliminate(XnfDer.java:97) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.applyEliminationTechniques(QuantifierPusher.java:302) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:215) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPush(QuantifierPusher.java:134) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:107) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) 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.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.constructQuantifiedFormula(TermDomainOperationProvider.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) 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:34:25,746 INFO L168 Benchmark]: Toolchain (without parser) took 4729.07 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.4 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -525.7 MB). Peak memory consumption was 172.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:25,748 INFO L168 Benchmark]: CDTParser took 0.20 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:34:25,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.07 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:34:25,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.02 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:34:25,750 INFO L168 Benchmark]: Boogie Preprocessor took 36.17 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:34:25,751 INFO L168 Benchmark]: RCFGBuilder took 815.34 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -731.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:25,752 INFO L168 Benchmark]: TraceAbstraction took 3459.80 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 195.0 MB). Peak memory consumption was 195.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:25,756 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.20 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 379.07 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 30.02 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 36.17 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 815.34 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -731.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3459.80 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 195.0 MB). Peak memory consumption was 195.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...