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-3-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:34:20,880 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:34:20,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:34:20,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:34:20,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:34:20,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:34:20,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:34:20,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:34:20,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:34:20,913 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:34:20,914 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:34:20,915 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:34:20,915 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:34:20,922 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:34:20,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:34:20,924 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:34:20,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:34:20,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:34:20,936 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:34:20,937 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:34:20,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:34:20,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:34:20,945 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:34:20,946 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:34:20,946 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:34:20,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:34:20,948 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:34:20,948 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:34:20,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:34:20,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:34:20,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:34:20,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:34:20,955 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:34:20,956 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:34:20,957 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:34:20,957 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:34:20,958 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,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:34:20,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:34:20,991 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:34:20,991 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:34:20,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:34:20,992 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:34:20,992 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:34:20,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:34:20,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:34:20,993 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:34:20,994 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:34:20,994 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:34:20,994 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:34:20,994 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:34:20,994 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:34:20,995 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:34:20,995 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:34:20,995 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:34:20,995 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:34:20,995 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:34:20,996 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:34:20,997 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:34:20,997 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:34:20,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:34:20,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:34:20,998 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:34:20,998 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:34:20,998 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:34:20,998 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:34:20,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:34:20,999 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:34:21,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:34:21,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:34:21,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:34:21,093 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:34:21,094 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:34:21,094 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/init-non-constant-3-u_true-unreach-call.i [2018-11-23 12:34:21,160 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad9167be/6231725ef06d4524b7df02193cc4eb78/FLAG2d3b989e2 [2018-11-23 12:34:21,604 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:34:21,605 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-non-constant-3-u_true-unreach-call.i [2018-11-23 12:34:21,612 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad9167be/6231725ef06d4524b7df02193cc4eb78/FLAG2d3b989e2 [2018-11-23 12:34:21,971 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad9167be/6231725ef06d4524b7df02193cc4eb78 [2018-11-23 12:34:21,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:34:21,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:34:21,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:21,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:34:21,987 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:34:21,988 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,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f73a7ca 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,992 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:22,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:34:22,026 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:34:22,240 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:22,245 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:34:22,271 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:22,295 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:34:22,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:22 WrapperNode [2018-11-23 12:34:22,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:22,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:22,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:34:22,296 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:34:22,306 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:22" (1/1) ... [2018-11-23 12:34:22,315 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:22" (1/1) ... [2018-11-23 12:34:22,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:22,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:34:22,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:34:22,323 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:34:22,332 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:22" (1/1) ... [2018-11-23 12:34:22,332 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:22" (1/1) ... [2018-11-23 12:34:22,334 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:22" (1/1) ... [2018-11-23 12:34:22,334 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:22" (1/1) ... [2018-11-23 12:34:22,344 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:22" (1/1) ... [2018-11-23 12:34:22,352 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:22" (1/1) ... [2018-11-23 12:34:22,354 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:22" (1/1) ... [2018-11-23 12:34:22,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:34:22,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:34:22,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:34:22,357 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:34:22,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:22" (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:22,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:34:22,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:34:22,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:34:22,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:34:22,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:34:22,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:34:22,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:34:22,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:34:22,491 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:34:22,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:34:22,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:34:22,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:34:23,040 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:34:23,041 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:34:23,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:23 BoogieIcfgContainer [2018-11-23 12:34:23,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:34:23,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:34:23,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:34:23,046 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:34:23,047 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:23,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdc9bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:23, skipping insertion in model container [2018-11-23 12:34:23,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:22" (2/3) ... [2018-11-23 12:34:23,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdc9bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:23, skipping insertion in model container [2018-11-23 12:34:23,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:23" (3/3) ... [2018-11-23 12:34:23,051 INFO L112 eAbstractionObserver]: Analyzing ICFG init-non-constant-3-u_true-unreach-call.i [2018-11-23 12:34:23,061 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:34:23,070 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:34:23,087 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:34:23,119 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:34:23,119 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:34:23,120 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:34:23,120 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:34:23,120 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:34:23,120 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:34:23,121 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:34:23,121 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:34:23,121 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:34:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 12:34:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:34:23,148 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:23,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:23,152 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:23,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:23,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1375180307, now seen corresponding path program 1 times [2018-11-23 12:34:23,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:23,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:23,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:23,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:23,240 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:23,241 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:23,241 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:23,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:23,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:23,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 12:34:23,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-23 12:34:23,431 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 12:34:23,431 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #99#return; {33#true} is VALID [2018-11-23 12:34:23,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2018-11-23 12:34:23,432 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {33#true} is VALID [2018-11-23 12:34:23,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 12:34:23,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {34#false} is VALID [2018-11-23 12:34:23,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {34#false} is VALID [2018-11-23 12:34:23,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {34#false} is VALID [2018-11-23 12:34:23,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {34#false} is VALID [2018-11-23 12:34:23,436 INFO L256 TraceCheckUtils]: 11: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {34#false} is VALID [2018-11-23 12:34:23,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 12:34:23,436 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-23 12:34:23,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 12:34:23,439 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,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:23,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:34:23,468 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:34:23,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:23,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:34:23,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:23,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:34:23,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:34:23,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:34:23,571 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 12:34:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:23,822 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2018-11-23 12:34:23,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:34:23,823 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:34:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:34:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-23 12:34:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:34:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-23 12:34:23,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2018-11-23 12:34:24,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:24,169 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:34:24,169 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:34:24,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:34:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:34:24,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 12:34:24,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:24,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 12:34:24,224 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:34:24,225 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:34:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:24,229 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 12:34:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 12:34:24,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:24,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:24,231 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:34:24,231 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:34:24,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:24,235 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 12:34:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 12:34:24,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:24,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:24,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:24,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:34:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-11-23 12:34:24,241 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 15 [2018-11-23 12:34:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:24,242 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-23 12:34:24,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:34:24,242 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 12:34:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:34:24,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:24,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:24,244 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:24,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:24,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1308846031, now seen corresponding path program 1 times [2018-11-23 12:34:24,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:24,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:24,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:24,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:24,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:24,255 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:24,255 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:24,255 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,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:24,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:24,689 INFO L256 TraceCheckUtils]: 0: Hoare triple {240#true} call ULTIMATE.init(); {240#true} is VALID [2018-11-23 12:34:24,689 INFO L273 TraceCheckUtils]: 1: Hoare triple {240#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {240#true} is VALID [2018-11-23 12:34:24,690 INFO L273 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2018-11-23 12:34:24,690 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #99#return; {240#true} is VALID [2018-11-23 12:34:24,690 INFO L256 TraceCheckUtils]: 4: Hoare triple {240#true} call #t~ret2 := main(); {240#true} is VALID [2018-11-23 12:34:24,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {240#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {260#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:24,696 INFO L273 TraceCheckUtils]: 6: Hoare triple {260#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {241#false} is VALID [2018-11-23 12:34:24,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {241#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {241#false} is VALID [2018-11-23 12:34:24,697 INFO L273 TraceCheckUtils]: 8: Hoare triple {241#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {241#false} is VALID [2018-11-23 12:34:24,697 INFO L273 TraceCheckUtils]: 9: Hoare triple {241#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {241#false} is VALID [2018-11-23 12:34:24,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {241#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {241#false} is VALID [2018-11-23 12:34:24,698 INFO L256 TraceCheckUtils]: 11: Hoare triple {241#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {241#false} is VALID [2018-11-23 12:34:24,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {241#false} ~cond := #in~cond; {241#false} is VALID [2018-11-23 12:34:24,698 INFO L273 TraceCheckUtils]: 13: Hoare triple {241#false} assume 0 == ~cond; {241#false} is VALID [2018-11-23 12:34:24,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {241#false} assume !false; {241#false} is VALID [2018-11-23 12:34:24,700 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:24,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:24,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:34:24,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:34:24,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:24,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:34:24,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:24,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:34:24,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:34:24,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:24,761 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 3 states. [2018-11-23 12:34:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:25,172 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 12:34:25,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:34:25,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:34:25,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:34:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:34:25,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:34:25,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:25,294 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:34:25,294 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:34:25,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:34:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-23 12:34:25,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:25,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 26 states. [2018-11-23 12:34:25,318 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 26 states. [2018-11-23 12:34:25,319 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 26 states. [2018-11-23 12:34:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:25,322 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 12:34:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:34:25,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:25,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:25,323 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 30 states. [2018-11-23 12:34:25,323 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 30 states. [2018-11-23 12:34:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:25,326 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 12:34:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:34:25,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:25,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:25,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:25,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:34:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 12:34:25,330 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2018-11-23 12:34:25,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:25,330 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 12:34:25,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:34:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 12:34:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:34:25,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:25,332 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,332 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:25,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:25,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1886649102, now seen corresponding path program 1 times [2018-11-23 12:34:25,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:25,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:25,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:25,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:25,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:25,341 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:25,342 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:25,342 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,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:25,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:25,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {450#true} is VALID [2018-11-23 12:34:25,508 INFO L273 TraceCheckUtils]: 1: Hoare triple {450#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {450#true} is VALID [2018-11-23 12:34:25,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 12:34:25,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #99#return; {450#true} is VALID [2018-11-23 12:34:25,510 INFO L256 TraceCheckUtils]: 4: Hoare triple {450#true} call #t~ret2 := main(); {450#true} is VALID [2018-11-23 12:34:25,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {450#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {470#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:25,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {470#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {474#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:25,512 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {451#false} is VALID [2018-11-23 12:34:25,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {451#false} ~i~0 := 1 + ~i~0; {451#false} is VALID [2018-11-23 12:34:25,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {451#false} assume !(~i~0 < ~n~0); {451#false} is VALID [2018-11-23 12:34:25,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {451#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {451#false} is VALID [2018-11-23 12:34:25,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {451#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {451#false} is VALID [2018-11-23 12:34:25,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {451#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {451#false} is VALID [2018-11-23 12:34:25,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {451#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {451#false} is VALID [2018-11-23 12:34:25,515 INFO L256 TraceCheckUtils]: 14: Hoare triple {451#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {451#false} is VALID [2018-11-23 12:34:25,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {451#false} ~cond := #in~cond; {451#false} is VALID [2018-11-23 12:34:25,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {451#false} assume 0 == ~cond; {451#false} is VALID [2018-11-23 12:34:25,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {451#false} assume !false; {451#false} is VALID [2018-11-23 12:34:25,518 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:25,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:25,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:25,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:34:25,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:25,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:25,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:25,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:25,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:25,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:25,593 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2018-11-23 12:34:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:25,883 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 12:34:25,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:25,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:34:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 12:34:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 12:34:25,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2018-11-23 12:34:26,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:26,017 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:34:26,017 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:34:26,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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:34:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:34:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-11-23 12:34:26,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:26,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 28 states. [2018-11-23 12:34:26,049 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 28 states. [2018-11-23 12:34:26,049 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 28 states. [2018-11-23 12:34:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:26,054 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-11-23 12:34:26,054 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 12:34:26,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:26,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:26,055 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 35 states. [2018-11-23 12:34:26,055 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 35 states. [2018-11-23 12:34:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:26,059 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-11-23 12:34:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 12:34:26,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:26,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:26,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:26,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:34:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 12:34:26,062 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2018-11-23 12:34:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:26,063 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 12:34:26,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 12:34:26,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:34:26,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:26,064 INFO L402 BasicCegarLoop]: trace histogram [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:34:26,064 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:26,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:26,065 INFO L82 PathProgramCache]: Analyzing trace with hash -464275123, now seen corresponding path program 1 times [2018-11-23 12:34:26,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:26,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:26,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:26,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:26,073 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:26,074 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:26,074 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:34:26,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:26,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:26,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {701#true} is VALID [2018-11-23 12:34:26,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {701#true} is VALID [2018-11-23 12:34:26,215 INFO L273 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 12:34:26,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} #99#return; {701#true} is VALID [2018-11-23 12:34:26,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {701#true} call #t~ret2 := main(); {701#true} is VALID [2018-11-23 12:34:26,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {701#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {721#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:26,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {721#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {721#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:26,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {721#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {728#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:26,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {728#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !(~k~0 < ~n~0); {702#false} is VALID [2018-11-23 12:34:26,223 INFO L273 TraceCheckUtils]: 9: Hoare triple {702#false} ~j~0 := 1 + ~j~0; {702#false} is VALID [2018-11-23 12:34:26,223 INFO L273 TraceCheckUtils]: 10: Hoare triple {702#false} assume !(~j~0 < ~n~0); {702#false} is VALID [2018-11-23 12:34:26,223 INFO L273 TraceCheckUtils]: 11: Hoare triple {702#false} ~i~0 := 1 + ~i~0; {702#false} is VALID [2018-11-23 12:34:26,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {702#false} assume !(~i~0 < ~n~0); {702#false} is VALID [2018-11-23 12:34:26,224 INFO L273 TraceCheckUtils]: 13: Hoare triple {702#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {702#false} is VALID [2018-11-23 12:34:26,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {702#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {702#false} is VALID [2018-11-23 12:34:26,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {702#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {702#false} is VALID [2018-11-23 12:34:26,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {702#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {702#false} is VALID [2018-11-23 12:34:26,225 INFO L256 TraceCheckUtils]: 17: Hoare triple {702#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {702#false} is VALID [2018-11-23 12:34:26,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {702#false} ~cond := #in~cond; {702#false} is VALID [2018-11-23 12:34:26,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {702#false} assume 0 == ~cond; {702#false} is VALID [2018-11-23 12:34:26,226 INFO L273 TraceCheckUtils]: 20: Hoare triple {702#false} assume !false; {702#false} is VALID [2018-11-23 12:34:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:26,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:26,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:26,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:34:26,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:26,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:26,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:26,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:26,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:26,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:26,278 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2018-11-23 12:34:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:26,503 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2018-11-23 12:34:26,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:26,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:34:26,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2018-11-23 12:34:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2018-11-23 12:34:26,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 65 transitions. [2018-11-23 12:34:26,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:26,612 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:34:26,612 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:34:26,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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:34:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:34:26,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-23 12:34:26,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:26,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 30 states. [2018-11-23 12:34:26,656 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 30 states. [2018-11-23 12:34:26,656 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 30 states. [2018-11-23 12:34:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:26,659 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 12:34:26,659 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:34:26,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:26,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:26,661 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 33 states. [2018-11-23 12:34:26,661 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 33 states. [2018-11-23 12:34:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:26,664 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 12:34:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:34:26,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:26,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:26,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:26,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:26,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:34:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:34:26,667 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 21 [2018-11-23 12:34:26,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:26,668 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:34:26,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:34:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:34:26,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:26,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:26,669 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:26,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:26,670 INFO L82 PathProgramCache]: Analyzing trace with hash -727027933, now seen corresponding path program 1 times [2018-11-23 12:34:26,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:26,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:26,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:26,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:26,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:26,677 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:26,678 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:26,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:26,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:26,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:26,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {963#true} call ULTIMATE.init(); {963#true} is VALID [2018-11-23 12:34:26,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {963#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {963#true} is VALID [2018-11-23 12:34:26,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {963#true} assume true; {963#true} is VALID [2018-11-23 12:34:26,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {963#true} {963#true} #99#return; {963#true} is VALID [2018-11-23 12:34:26,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {963#true} call #t~ret2 := main(); {963#true} is VALID [2018-11-23 12:34:26,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {963#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {983#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:26,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {983#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {983#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:26,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {983#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {990#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:26,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {990#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {994#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:26,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {994#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !(~k~0 < ~n~0); {964#false} is VALID [2018-11-23 12:34:26,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {964#false} ~j~0 := 1 + ~j~0; {964#false} is VALID [2018-11-23 12:34:26,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {964#false} assume !(~j~0 < ~n~0); {964#false} is VALID [2018-11-23 12:34:26,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {964#false} ~i~0 := 1 + ~i~0; {964#false} is VALID [2018-11-23 12:34:26,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {964#false} assume !(~i~0 < ~n~0); {964#false} is VALID [2018-11-23 12:34:26,868 INFO L273 TraceCheckUtils]: 14: Hoare triple {964#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {964#false} is VALID [2018-11-23 12:34:26,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {964#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {964#false} is VALID [2018-11-23 12:34:26,869 INFO L273 TraceCheckUtils]: 16: Hoare triple {964#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {964#false} is VALID [2018-11-23 12:34:26,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {964#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {964#false} is VALID [2018-11-23 12:34:26,870 INFO L256 TraceCheckUtils]: 18: Hoare triple {964#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {964#false} is VALID [2018-11-23 12:34:26,870 INFO L273 TraceCheckUtils]: 19: Hoare triple {964#false} ~cond := #in~cond; {964#false} is VALID [2018-11-23 12:34:26,871 INFO L273 TraceCheckUtils]: 20: Hoare triple {964#false} assume 0 == ~cond; {964#false} is VALID [2018-11-23 12:34:26,871 INFO L273 TraceCheckUtils]: 21: Hoare triple {964#false} assume !false; {964#false} is VALID [2018-11-23 12:34:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:26,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:26,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:34:26,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:34:26,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:26,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:26,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:26,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:26,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:26,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:26,991 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 12:34:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:27,251 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2018-11-23 12:34:27,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:27,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:34:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-23 12:34:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-23 12:34:27,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2018-11-23 12:34:27,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:27,349 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:34:27,350 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:34:27,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:34:27,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-11-23 12:34:27,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:27,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2018-11-23 12:34:27,434 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2018-11-23 12:34:27,434 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2018-11-23 12:34:27,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:27,438 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 12:34:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 12:34:27,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:27,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:27,440 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2018-11-23 12:34:27,440 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2018-11-23 12:34:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:27,442 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 12:34:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 12:34:27,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:27,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:27,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:27,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:34:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 12:34:27,446 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 22 [2018-11-23 12:34:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:27,446 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 12:34:27,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:34:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:34:27,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:27,447 INFO L402 BasicCegarLoop]: trace histogram [2, 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:34:27,448 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:27,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:27,448 INFO L82 PathProgramCache]: Analyzing trace with hash -282430451, now seen corresponding path program 2 times [2018-11-23 12:34:27,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:27,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:27,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:27,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:27,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:27,463 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:27,463 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:27,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:27,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:27,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:27,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:27,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:27,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {1255#true} call ULTIMATE.init(); {1255#true} is VALID [2018-11-23 12:34:27,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {1255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1255#true} is VALID [2018-11-23 12:34:27,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {1255#true} assume true; {1255#true} is VALID [2018-11-23 12:34:27,709 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1255#true} {1255#true} #99#return; {1255#true} is VALID [2018-11-23 12:34:27,709 INFO L256 TraceCheckUtils]: 4: Hoare triple {1255#true} call #t~ret2 := main(); {1255#true} is VALID [2018-11-23 12:34:27,710 INFO L273 TraceCheckUtils]: 5: Hoare triple {1255#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {1275#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {1275#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1275#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {1275#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1282#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:27,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {1282#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1286#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:27,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {1286#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1290#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:27,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {1290#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !(~k~0 < ~n~0); {1256#false} is VALID [2018-11-23 12:34:27,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {1256#false} ~j~0 := 1 + ~j~0; {1256#false} is VALID [2018-11-23 12:34:27,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {1256#false} assume !(~j~0 < ~n~0); {1256#false} is VALID [2018-11-23 12:34:27,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {1256#false} ~i~0 := 1 + ~i~0; {1256#false} is VALID [2018-11-23 12:34:27,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {1256#false} assume !(~i~0 < ~n~0); {1256#false} is VALID [2018-11-23 12:34:27,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {1256#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1256#false} is VALID [2018-11-23 12:34:27,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {1256#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1256#false} is VALID [2018-11-23 12:34:27,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {1256#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1256#false} is VALID [2018-11-23 12:34:27,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {1256#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1256#false} is VALID [2018-11-23 12:34:27,722 INFO L256 TraceCheckUtils]: 19: Hoare triple {1256#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {1256#false} is VALID [2018-11-23 12:34:27,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {1256#false} ~cond := #in~cond; {1256#false} is VALID [2018-11-23 12:34:27,723 INFO L273 TraceCheckUtils]: 21: Hoare triple {1256#false} assume 0 == ~cond; {1256#false} is VALID [2018-11-23 12:34:27,723 INFO L273 TraceCheckUtils]: 22: Hoare triple {1256#false} assume !false; {1256#false} is VALID [2018-11-23 12:34:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:27,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:27,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:34:27,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 12:34:27,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:27,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:34:27,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:27,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:34:27,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:34:27,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:27,784 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2018-11-23 12:34:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:28,180 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2018-11-23 12:34:28,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:34:28,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 12:34:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2018-11-23 12:34:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2018-11-23 12:34:28,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2018-11-23 12:34:28,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:28,291 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:34:28,291 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:34:28,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:28,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:34:28,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-11-23 12:34:28,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:28,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2018-11-23 12:34:28,390 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2018-11-23 12:34:28,390 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2018-11-23 12:34:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:28,394 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 12:34:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:34:28,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:28,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:28,395 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2018-11-23 12:34:28,395 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2018-11-23 12:34:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:28,397 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 12:34:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:34:28,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:28,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:28,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:28,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:34:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 12:34:28,401 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 23 [2018-11-23 12:34:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:28,401 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 12:34:28,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:34:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 12:34:28,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:34:28,402 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:28,402 INFO L402 BasicCegarLoop]: trace histogram [3, 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:34:28,402 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:28,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:28,403 INFO L82 PathProgramCache]: Analyzing trace with hash 615189603, now seen corresponding path program 3 times [2018-11-23 12:34:28,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:28,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:28,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:28,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:28,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:28,410 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:28,410 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:28,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:28,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:28,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:34:28,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:28,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:28,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {1580#true} call ULTIMATE.init(); {1580#true} is VALID [2018-11-23 12:34:28,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {1580#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1580#true} is VALID [2018-11-23 12:34:28,683 INFO L273 TraceCheckUtils]: 2: Hoare triple {1580#true} assume true; {1580#true} is VALID [2018-11-23 12:34:28,683 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1580#true} {1580#true} #99#return; {1580#true} is VALID [2018-11-23 12:34:28,683 INFO L256 TraceCheckUtils]: 4: Hoare triple {1580#true} call #t~ret2 := main(); {1580#true} is VALID [2018-11-23 12:34:28,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {1580#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:28,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:28,699 INFO L273 TraceCheckUtils]: 7: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:28,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:28,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:28,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:28,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~k~0 < ~n~0); {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:28,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:28,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:28,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} ~i~0 := 1 + ~i~0; {1628#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:28,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {1628#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} assume !(~i~0 < ~n~0); {1581#false} is VALID [2018-11-23 12:34:28,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {1581#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1581#false} is VALID [2018-11-23 12:34:28,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {1581#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1581#false} is VALID [2018-11-23 12:34:28,716 INFO L273 TraceCheckUtils]: 18: Hoare triple {1581#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1581#false} is VALID [2018-11-23 12:34:28,716 INFO L273 TraceCheckUtils]: 19: Hoare triple {1581#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1581#false} is VALID [2018-11-23 12:34:28,716 INFO L256 TraceCheckUtils]: 20: Hoare triple {1581#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {1581#false} is VALID [2018-11-23 12:34:28,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {1581#false} ~cond := #in~cond; {1581#false} is VALID [2018-11-23 12:34:28,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {1581#false} assume 0 == ~cond; {1581#false} is VALID [2018-11-23 12:34:28,717 INFO L273 TraceCheckUtils]: 23: Hoare triple {1581#false} assume !false; {1581#false} is VALID [2018-11-23 12:34:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:34:28,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:28,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:34:28,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 12:34:28,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:28,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:28,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:28,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:28,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:28,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:28,796 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 4 states. [2018-11-23 12:34:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:29,156 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2018-11-23 12:34:29,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:29,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 12:34:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-23 12:34:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-23 12:34:29,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2018-11-23 12:34:29,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:29,236 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:34:29,236 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:34:29,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:34:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-11-23 12:34:29,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:29,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 47 states. [2018-11-23 12:34:29,305 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 47 states. [2018-11-23 12:34:29,305 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 47 states. [2018-11-23 12:34:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:29,309 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 12:34:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-11-23 12:34:29,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:29,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:29,310 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 55 states. [2018-11-23 12:34:29,311 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 55 states. [2018-11-23 12:34:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:29,313 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 12:34:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-11-23 12:34:29,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:29,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:29,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:29,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:34:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2018-11-23 12:34:29,316 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 24 [2018-11-23 12:34:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:29,317 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-11-23 12:34:29,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-11-23 12:34:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:34:29,318 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:29,318 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:29,318 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:29,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash 550587983, now seen corresponding path program 4 times [2018-11-23 12:34:29,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:29,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:29,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:29,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:29,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:29,326 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:29,326 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:29,326 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:29,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:34:29,371 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:34:29,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:29,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:29,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {1966#true} call ULTIMATE.init(); {1966#true} is VALID [2018-11-23 12:34:29,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {1966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1966#true} is VALID [2018-11-23 12:34:29,651 INFO L273 TraceCheckUtils]: 2: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-23 12:34:29,651 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1966#true} {1966#true} #99#return; {1966#true} is VALID [2018-11-23 12:34:29,651 INFO L256 TraceCheckUtils]: 4: Hoare triple {1966#true} call #t~ret2 := main(); {1966#true} is VALID [2018-11-23 12:34:29,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {1966#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {1966#true} is VALID [2018-11-23 12:34:29,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {1966#true} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1989#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:29,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {1989#(<= main_~j~0 0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1993#(and (<= 0 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:29,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {1993#(and (<= 0 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1997#(and (<= main_~j~0 0) (<= 1 main_~k~0))} is VALID [2018-11-23 12:34:29,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {1997#(and (<= main_~j~0 0) (<= 1 main_~k~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2001#(and (<= 2 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:29,657 INFO L273 TraceCheckUtils]: 10: Hoare triple {2001#(and (<= 2 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2005#(and (<= 3 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:29,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {2005#(and (<= 3 main_~n~0) (<= main_~j~0 0))} assume !(~k~0 < ~n~0); {2005#(and (<= 3 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:29,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {2005#(and (<= 3 main_~n~0) (<= main_~j~0 0))} ~j~0 := 1 + ~j~0; {2012#(and (<= 3 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:29,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {2012#(and (<= 3 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {1967#false} is VALID [2018-11-23 12:34:29,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {1967#false} ~i~0 := 1 + ~i~0; {1967#false} is VALID [2018-11-23 12:34:29,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {1967#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1967#false} is VALID [2018-11-23 12:34:29,659 INFO L273 TraceCheckUtils]: 16: Hoare triple {1967#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1967#false} is VALID [2018-11-23 12:34:29,660 INFO L273 TraceCheckUtils]: 17: Hoare triple {1967#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1967#false} is VALID [2018-11-23 12:34:29,660 INFO L273 TraceCheckUtils]: 18: Hoare triple {1967#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1967#false} is VALID [2018-11-23 12:34:29,660 INFO L273 TraceCheckUtils]: 19: Hoare triple {1967#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1967#false} is VALID [2018-11-23 12:34:29,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {1967#false} assume !(~k~0 < ~n~0); {1967#false} is VALID [2018-11-23 12:34:29,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {1967#false} ~j~0 := 1 + ~j~0; {1967#false} is VALID [2018-11-23 12:34:29,661 INFO L273 TraceCheckUtils]: 22: Hoare triple {1967#false} assume !(~j~0 < ~n~0); {1967#false} is VALID [2018-11-23 12:34:29,661 INFO L273 TraceCheckUtils]: 23: Hoare triple {1967#false} ~i~0 := 1 + ~i~0; {1967#false} is VALID [2018-11-23 12:34:29,662 INFO L273 TraceCheckUtils]: 24: Hoare triple {1967#false} assume !(~i~0 < ~n~0); {1967#false} is VALID [2018-11-23 12:34:29,662 INFO L273 TraceCheckUtils]: 25: Hoare triple {1967#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1967#false} is VALID [2018-11-23 12:34:29,662 INFO L273 TraceCheckUtils]: 26: Hoare triple {1967#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1967#false} is VALID [2018-11-23 12:34:29,662 INFO L273 TraceCheckUtils]: 27: Hoare triple {1967#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1967#false} is VALID [2018-11-23 12:34:29,662 INFO L273 TraceCheckUtils]: 28: Hoare triple {1967#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1967#false} is VALID [2018-11-23 12:34:29,663 INFO L256 TraceCheckUtils]: 29: Hoare triple {1967#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {1967#false} is VALID [2018-11-23 12:34:29,663 INFO L273 TraceCheckUtils]: 30: Hoare triple {1967#false} ~cond := #in~cond; {1967#false} is VALID [2018-11-23 12:34:29,663 INFO L273 TraceCheckUtils]: 31: Hoare triple {1967#false} assume 0 == ~cond; {1967#false} is VALID [2018-11-23 12:34:29,663 INFO L273 TraceCheckUtils]: 32: Hoare triple {1967#false} assume !false; {1967#false} is VALID [2018-11-23 12:34:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:34:29,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:29,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:34:29,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 12:34:29,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:29,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:34:29,780 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:34:29,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:34:29,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:34:29,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:29,781 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 8 states. [2018-11-23 12:34:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:31,031 INFO L93 Difference]: Finished difference Result 126 states and 157 transitions. [2018-11-23 12:34:31,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:34:31,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 12:34:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2018-11-23 12:34:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2018-11-23 12:34:31,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2018-11-23 12:34:31,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:31,201 INFO L225 Difference]: With dead ends: 126 [2018-11-23 12:34:31,201 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 12:34:31,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:34:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 12:34:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2018-11-23 12:34:31,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:31,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 71 states. [2018-11-23 12:34:31,337 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 71 states. [2018-11-23 12:34:31,338 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 71 states. [2018-11-23 12:34:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:31,343 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-23 12:34:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2018-11-23 12:34:31,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:31,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:31,344 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 93 states. [2018-11-23 12:34:31,344 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 93 states. [2018-11-23 12:34:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:31,348 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-23 12:34:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2018-11-23 12:34:31,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:31,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:31,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:31,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:34:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2018-11-23 12:34:31,352 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 33 [2018-11-23 12:34:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:31,353 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2018-11-23 12:34:31,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:34:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2018-11-23 12:34:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:34:31,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:31,354 INFO L402 BasicCegarLoop]: trace histogram [12, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:31,354 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:31,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:31,355 INFO L82 PathProgramCache]: Analyzing trace with hash -98839249, now seen corresponding path program 5 times [2018-11-23 12:34:31,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:31,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:31,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:31,363 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:31,363 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:31,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:31,390 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:34:31,588 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 12:34:31,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:31,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:31,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {2593#true} call ULTIMATE.init(); {2593#true} is VALID [2018-11-23 12:34:31,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {2593#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2593#true} is VALID [2018-11-23 12:34:31,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {2593#true} assume true; {2593#true} is VALID [2018-11-23 12:34:31,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2593#true} {2593#true} #99#return; {2593#true} is VALID [2018-11-23 12:34:31,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {2593#true} call #t~ret2 := main(); {2593#true} is VALID [2018-11-23 12:34:31,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {2593#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {2593#true} is VALID [2018-11-23 12:34:31,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {2593#true} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2616#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:31,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {2616#(<= main_~j~0 0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2616#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:31,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {2616#(<= main_~j~0 0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2616#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:31,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {2616#(<= main_~j~0 0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2616#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:31,885 INFO L273 TraceCheckUtils]: 10: Hoare triple {2616#(<= main_~j~0 0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2616#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:31,886 INFO L273 TraceCheckUtils]: 11: Hoare triple {2616#(<= main_~j~0 0)} assume !(~k~0 < ~n~0); {2616#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:31,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {2616#(<= main_~j~0 0)} ~j~0 := 1 + ~j~0; {2635#(<= main_~j~0 1)} is VALID [2018-11-23 12:34:31,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {2635#(<= main_~j~0 1)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2639#(and (<= main_~j~0 1) (= main_~k~0 0))} is VALID [2018-11-23 12:34:31,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {2639#(and (<= main_~j~0 1) (= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2635#(<= main_~j~0 1)} is VALID [2018-11-23 12:34:31,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {2635#(<= main_~j~0 1)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2635#(<= main_~j~0 1)} is VALID [2018-11-23 12:34:31,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#(<= main_~j~0 1)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2635#(<= main_~j~0 1)} is VALID [2018-11-23 12:34:31,895 INFO L273 TraceCheckUtils]: 17: Hoare triple {2635#(<= main_~j~0 1)} assume !(~k~0 < ~n~0); {2635#(<= main_~j~0 1)} is VALID [2018-11-23 12:34:31,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#(<= main_~j~0 1)} ~j~0 := 1 + ~j~0; {2655#(<= main_~j~0 2)} is VALID [2018-11-23 12:34:31,896 INFO L273 TraceCheckUtils]: 19: Hoare triple {2655#(<= main_~j~0 2)} assume !(~j~0 < ~n~0); {2659#(<= main_~n~0 2)} is VALID [2018-11-23 12:34:31,897 INFO L273 TraceCheckUtils]: 20: Hoare triple {2659#(<= main_~n~0 2)} ~i~0 := 1 + ~i~0; {2659#(<= main_~n~0 2)} is VALID [2018-11-23 12:34:31,898 INFO L273 TraceCheckUtils]: 21: Hoare triple {2659#(<= main_~n~0 2)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2659#(<= main_~n~0 2)} is VALID [2018-11-23 12:34:31,898 INFO L273 TraceCheckUtils]: 22: Hoare triple {2659#(<= main_~n~0 2)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2669#(and (<= 0 main_~k~0) (<= main_~n~0 2))} is VALID [2018-11-23 12:34:31,900 INFO L273 TraceCheckUtils]: 23: Hoare triple {2669#(and (<= 0 main_~k~0) (<= main_~n~0 2))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2673#(and (<= main_~n~0 2) (<= 1 main_~k~0))} is VALID [2018-11-23 12:34:31,901 INFO L273 TraceCheckUtils]: 24: Hoare triple {2673#(and (<= main_~n~0 2) (<= 1 main_~k~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2677#(and (<= 2 main_~k~0) (<= main_~n~0 2))} is VALID [2018-11-23 12:34:31,902 INFO L273 TraceCheckUtils]: 25: Hoare triple {2677#(and (<= 2 main_~k~0) (<= main_~n~0 2))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2594#false} is VALID [2018-11-23 12:34:31,903 INFO L273 TraceCheckUtils]: 26: Hoare triple {2594#false} assume !(~k~0 < ~n~0); {2594#false} is VALID [2018-11-23 12:34:31,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {2594#false} ~j~0 := 1 + ~j~0; {2594#false} is VALID [2018-11-23 12:34:31,903 INFO L273 TraceCheckUtils]: 28: Hoare triple {2594#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2594#false} is VALID [2018-11-23 12:34:31,903 INFO L273 TraceCheckUtils]: 29: Hoare triple {2594#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2594#false} is VALID [2018-11-23 12:34:31,904 INFO L273 TraceCheckUtils]: 30: Hoare triple {2594#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2594#false} is VALID [2018-11-23 12:34:31,904 INFO L273 TraceCheckUtils]: 31: Hoare triple {2594#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2594#false} is VALID [2018-11-23 12:34:31,904 INFO L273 TraceCheckUtils]: 32: Hoare triple {2594#false} assume !(~k~0 < ~n~0); {2594#false} is VALID [2018-11-23 12:34:31,905 INFO L273 TraceCheckUtils]: 33: Hoare triple {2594#false} ~j~0 := 1 + ~j~0; {2594#false} is VALID [2018-11-23 12:34:31,905 INFO L273 TraceCheckUtils]: 34: Hoare triple {2594#false} assume !(~j~0 < ~n~0); {2594#false} is VALID [2018-11-23 12:34:31,905 INFO L273 TraceCheckUtils]: 35: Hoare triple {2594#false} ~i~0 := 1 + ~i~0; {2594#false} is VALID [2018-11-23 12:34:31,906 INFO L273 TraceCheckUtils]: 36: Hoare triple {2594#false} assume !(~i~0 < ~n~0); {2594#false} is VALID [2018-11-23 12:34:31,906 INFO L273 TraceCheckUtils]: 37: Hoare triple {2594#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2594#false} is VALID [2018-11-23 12:34:31,906 INFO L273 TraceCheckUtils]: 38: Hoare triple {2594#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2594#false} is VALID [2018-11-23 12:34:31,907 INFO L273 TraceCheckUtils]: 39: Hoare triple {2594#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2594#false} is VALID [2018-11-23 12:34:31,907 INFO L273 TraceCheckUtils]: 40: Hoare triple {2594#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {2594#false} is VALID [2018-11-23 12:34:31,907 INFO L256 TraceCheckUtils]: 41: Hoare triple {2594#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {2594#false} is VALID [2018-11-23 12:34:31,907 INFO L273 TraceCheckUtils]: 42: Hoare triple {2594#false} ~cond := #in~cond; {2594#false} is VALID [2018-11-23 12:34:31,908 INFO L273 TraceCheckUtils]: 43: Hoare triple {2594#false} assume 0 == ~cond; {2594#false} is VALID [2018-11-23 12:34:31,908 INFO L273 TraceCheckUtils]: 44: Hoare triple {2594#false} assume !false; {2594#false} is VALID [2018-11-23 12:34:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 74 proven. 50 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:34:31,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:31,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 12:34:31,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-23 12:34:31,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:31,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:34:31,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:31,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:34:31,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:34:31,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:34:31,971 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 10 states. [2018-11-23 12:34:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:33,229 INFO L93 Difference]: Finished difference Result 186 states and 231 transitions. [2018-11-23 12:34:33,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:34:33,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-23 12:34:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:34:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2018-11-23 12:34:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:34:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2018-11-23 12:34:33,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 122 transitions. [2018-11-23 12:34:33,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:33,483 INFO L225 Difference]: With dead ends: 186 [2018-11-23 12:34:33,483 INFO L226 Difference]: Without dead ends: 129 [2018-11-23 12:34:33,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:34:33,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-23 12:34:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 106. [2018-11-23 12:34:33,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:33,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 106 states. [2018-11-23 12:34:33,740 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 106 states. [2018-11-23 12:34:33,740 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 106 states. [2018-11-23 12:34:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:33,747 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2018-11-23 12:34:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2018-11-23 12:34:33,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:33,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:33,748 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 129 states. [2018-11-23 12:34:33,748 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 129 states. [2018-11-23 12:34:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:33,754 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2018-11-23 12:34:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2018-11-23 12:34:33,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:33,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:33,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:33,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 12:34:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2018-11-23 12:34:33,759 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 45 [2018-11-23 12:34:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:33,760 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2018-11-23 12:34:33,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:34:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2018-11-23 12:34:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:34:33,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:33,761 INFO L402 BasicCegarLoop]: trace histogram [15, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:33,761 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:33,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:33,762 INFO L82 PathProgramCache]: Analyzing trace with hash 756330270, now seen corresponding path program 6 times [2018-11-23 12:34:33,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:33,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:33,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:33,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:33,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:33,768 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:33,769 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:33,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:33,780 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:34:34,010 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 12:34:34,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:34,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:34,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {3498#true} call ULTIMATE.init(); {3498#true} is VALID [2018-11-23 12:34:34,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {3498#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3498#true} is VALID [2018-11-23 12:34:34,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {3498#true} assume true; {3498#true} is VALID [2018-11-23 12:34:34,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3498#true} {3498#true} #99#return; {3498#true} is VALID [2018-11-23 12:34:34,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {3498#true} call #t~ret2 := main(); {3498#true} is VALID [2018-11-23 12:34:34,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {3498#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {3518#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:34,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {3518#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3518#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:34,200 INFO L273 TraceCheckUtils]: 7: Hoare triple {3518#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3518#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:34,201 INFO L273 TraceCheckUtils]: 8: Hoare triple {3518#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3518#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:34,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {3518#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3518#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:34,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {3518#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3518#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:34,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {3518#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {3518#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:34,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {3518#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {3518#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:34,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {3518#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3543#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:34,204 INFO L273 TraceCheckUtils]: 14: Hoare triple {3543#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3547#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:34,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {3547#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3551#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:34,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {3551#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3555#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:34:34,208 INFO L273 TraceCheckUtils]: 17: Hoare triple {3555#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} assume !(~k~0 < ~n~0); {3499#false} is VALID [2018-11-23 12:34:34,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {3499#false} ~j~0 := 1 + ~j~0; {3499#false} is VALID [2018-11-23 12:34:34,208 INFO L273 TraceCheckUtils]: 19: Hoare triple {3499#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3499#false} is VALID [2018-11-23 12:34:34,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {3499#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3499#false} is VALID [2018-11-23 12:34:34,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {3499#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3499#false} is VALID [2018-11-23 12:34:34,209 INFO L273 TraceCheckUtils]: 22: Hoare triple {3499#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3499#false} is VALID [2018-11-23 12:34:34,209 INFO L273 TraceCheckUtils]: 23: Hoare triple {3499#false} assume !(~k~0 < ~n~0); {3499#false} is VALID [2018-11-23 12:34:34,210 INFO L273 TraceCheckUtils]: 24: Hoare triple {3499#false} ~j~0 := 1 + ~j~0; {3499#false} is VALID [2018-11-23 12:34:34,210 INFO L273 TraceCheckUtils]: 25: Hoare triple {3499#false} assume !(~j~0 < ~n~0); {3499#false} is VALID [2018-11-23 12:34:34,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {3499#false} ~i~0 := 1 + ~i~0; {3499#false} is VALID [2018-11-23 12:34:34,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {3499#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3499#false} is VALID [2018-11-23 12:34:34,211 INFO L273 TraceCheckUtils]: 28: Hoare triple {3499#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3499#false} is VALID [2018-11-23 12:34:34,211 INFO L273 TraceCheckUtils]: 29: Hoare triple {3499#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3499#false} is VALID [2018-11-23 12:34:34,211 INFO L273 TraceCheckUtils]: 30: Hoare triple {3499#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3499#false} is VALID [2018-11-23 12:34:34,211 INFO L273 TraceCheckUtils]: 31: Hoare triple {3499#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3499#false} is VALID [2018-11-23 12:34:34,212 INFO L273 TraceCheckUtils]: 32: Hoare triple {3499#false} assume !(~k~0 < ~n~0); {3499#false} is VALID [2018-11-23 12:34:34,212 INFO L273 TraceCheckUtils]: 33: Hoare triple {3499#false} ~j~0 := 1 + ~j~0; {3499#false} is VALID [2018-11-23 12:34:34,212 INFO L273 TraceCheckUtils]: 34: Hoare triple {3499#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3499#false} is VALID [2018-11-23 12:34:34,213 INFO L273 TraceCheckUtils]: 35: Hoare triple {3499#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3499#false} is VALID [2018-11-23 12:34:34,213 INFO L273 TraceCheckUtils]: 36: Hoare triple {3499#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3499#false} is VALID [2018-11-23 12:34:34,213 INFO L273 TraceCheckUtils]: 37: Hoare triple {3499#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3499#false} is VALID [2018-11-23 12:34:34,213 INFO L273 TraceCheckUtils]: 38: Hoare triple {3499#false} assume !(~k~0 < ~n~0); {3499#false} is VALID [2018-11-23 12:34:34,214 INFO L273 TraceCheckUtils]: 39: Hoare triple {3499#false} ~j~0 := 1 + ~j~0; {3499#false} is VALID [2018-11-23 12:34:34,214 INFO L273 TraceCheckUtils]: 40: Hoare triple {3499#false} assume !(~j~0 < ~n~0); {3499#false} is VALID [2018-11-23 12:34:34,214 INFO L273 TraceCheckUtils]: 41: Hoare triple {3499#false} ~i~0 := 1 + ~i~0; {3499#false} is VALID [2018-11-23 12:34:34,214 INFO L273 TraceCheckUtils]: 42: Hoare triple {3499#false} assume !(~i~0 < ~n~0); {3499#false} is VALID [2018-11-23 12:34:34,214 INFO L273 TraceCheckUtils]: 43: Hoare triple {3499#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3499#false} is VALID [2018-11-23 12:34:34,215 INFO L273 TraceCheckUtils]: 44: Hoare triple {3499#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3499#false} is VALID [2018-11-23 12:34:34,215 INFO L273 TraceCheckUtils]: 45: Hoare triple {3499#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3499#false} is VALID [2018-11-23 12:34:34,215 INFO L273 TraceCheckUtils]: 46: Hoare triple {3499#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {3499#false} is VALID [2018-11-23 12:34:34,215 INFO L256 TraceCheckUtils]: 47: Hoare triple {3499#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {3499#false} is VALID [2018-11-23 12:34:34,216 INFO L273 TraceCheckUtils]: 48: Hoare triple {3499#false} ~cond := #in~cond; {3499#false} is VALID [2018-11-23 12:34:34,216 INFO L273 TraceCheckUtils]: 49: Hoare triple {3499#false} assume 0 == ~cond; {3499#false} is VALID [2018-11-23 12:34:34,216 INFO L273 TraceCheckUtils]: 50: Hoare triple {3499#false} assume !false; {3499#false} is VALID [2018-11-23 12:34:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 128 proven. 6 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-23 12:34:34,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:34,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:34:34,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-23 12:34:34,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:34,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:34:34,287 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:34:34,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:34:34,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:34:34,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:34,288 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand 7 states. [2018-11-23 12:34:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:35,117 INFO L93 Difference]: Finished difference Result 223 states and 285 transitions. [2018-11-23 12:34:35,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:34:35,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-23 12:34:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2018-11-23 12:34:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2018-11-23 12:34:35,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2018-11-23 12:34:35,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:35,236 INFO L225 Difference]: With dead ends: 223 [2018-11-23 12:34:35,236 INFO L226 Difference]: Without dead ends: 129 [2018-11-23 12:34:35,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-23 12:34:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2018-11-23 12:34:35,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:35,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 121 states. [2018-11-23 12:34:35,898 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 121 states. [2018-11-23 12:34:35,899 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 121 states. [2018-11-23 12:34:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:35,904 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2018-11-23 12:34:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2018-11-23 12:34:35,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:35,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:35,905 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 129 states. [2018-11-23 12:34:35,906 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 129 states. [2018-11-23 12:34:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:35,911 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2018-11-23 12:34:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2018-11-23 12:34:35,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:35,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:35,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:35,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 12:34:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2018-11-23 12:34:35,916 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 51 [2018-11-23 12:34:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:35,917 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2018-11-23 12:34:35,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:34:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2018-11-23 12:34:35,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:34:35,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:35,918 INFO L402 BasicCegarLoop]: trace histogram [20, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:35,918 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:35,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:35,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1585754356, now seen corresponding path program 7 times [2018-11-23 12:34:35,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:35,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:35,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:35,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:35,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:35,925 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:35,925 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:35,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:35,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:36,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:36,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {4497#true} call ULTIMATE.init(); {4497#true} is VALID [2018-11-23 12:34:36,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {4497#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4497#true} is VALID [2018-11-23 12:34:36,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {4497#true} assume true; {4497#true} is VALID [2018-11-23 12:34:36,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4497#true} {4497#true} #99#return; {4497#true} is VALID [2018-11-23 12:34:36,212 INFO L256 TraceCheckUtils]: 4: Hoare triple {4497#true} call #t~ret2 := main(); {4497#true} is VALID [2018-11-23 12:34:36,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {4497#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {4517#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:36,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {4517#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {4517#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:36,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {4517#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {4524#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:36,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {4524#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4528#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:36,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {4528#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4532#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:36,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {4532#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4536#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:34:36,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {4536#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4540#(and (<= 1000 main_~n~0) (<= main_~k~0 4))} is VALID [2018-11-23 12:34:36,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {4540#(and (<= 1000 main_~n~0) (<= main_~k~0 4))} assume !(~k~0 < ~n~0); {4498#false} is VALID [2018-11-23 12:34:36,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {4498#false} ~j~0 := 1 + ~j~0; {4498#false} is VALID [2018-11-23 12:34:36,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {4498#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4498#false} is VALID [2018-11-23 12:34:36,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,221 INFO L273 TraceCheckUtils]: 19: Hoare triple {4498#false} assume !(~k~0 < ~n~0); {4498#false} is VALID [2018-11-23 12:34:36,222 INFO L273 TraceCheckUtils]: 20: Hoare triple {4498#false} ~j~0 := 1 + ~j~0; {4498#false} is VALID [2018-11-23 12:34:36,222 INFO L273 TraceCheckUtils]: 21: Hoare triple {4498#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4498#false} is VALID [2018-11-23 12:34:36,222 INFO L273 TraceCheckUtils]: 22: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,223 INFO L273 TraceCheckUtils]: 25: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,223 INFO L273 TraceCheckUtils]: 26: Hoare triple {4498#false} assume !(~k~0 < ~n~0); {4498#false} is VALID [2018-11-23 12:34:36,224 INFO L273 TraceCheckUtils]: 27: Hoare triple {4498#false} ~j~0 := 1 + ~j~0; {4498#false} is VALID [2018-11-23 12:34:36,224 INFO L273 TraceCheckUtils]: 28: Hoare triple {4498#false} assume !(~j~0 < ~n~0); {4498#false} is VALID [2018-11-23 12:34:36,224 INFO L273 TraceCheckUtils]: 29: Hoare triple {4498#false} ~i~0 := 1 + ~i~0; {4498#false} is VALID [2018-11-23 12:34:36,224 INFO L273 TraceCheckUtils]: 30: Hoare triple {4498#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {4498#false} is VALID [2018-11-23 12:34:36,224 INFO L273 TraceCheckUtils]: 31: Hoare triple {4498#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4498#false} is VALID [2018-11-23 12:34:36,225 INFO L273 TraceCheckUtils]: 32: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,225 INFO L273 TraceCheckUtils]: 33: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,225 INFO L273 TraceCheckUtils]: 34: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,226 INFO L273 TraceCheckUtils]: 35: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,226 INFO L273 TraceCheckUtils]: 36: Hoare triple {4498#false} assume !(~k~0 < ~n~0); {4498#false} is VALID [2018-11-23 12:34:36,226 INFO L273 TraceCheckUtils]: 37: Hoare triple {4498#false} ~j~0 := 1 + ~j~0; {4498#false} is VALID [2018-11-23 12:34:36,226 INFO L273 TraceCheckUtils]: 38: Hoare triple {4498#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4498#false} is VALID [2018-11-23 12:34:36,227 INFO L273 TraceCheckUtils]: 39: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,227 INFO L273 TraceCheckUtils]: 40: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,227 INFO L273 TraceCheckUtils]: 41: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,227 INFO L273 TraceCheckUtils]: 42: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4498#false} is VALID [2018-11-23 12:34:36,227 INFO L273 TraceCheckUtils]: 43: Hoare triple {4498#false} assume !(~k~0 < ~n~0); {4498#false} is VALID [2018-11-23 12:34:36,228 INFO L273 TraceCheckUtils]: 44: Hoare triple {4498#false} ~j~0 := 1 + ~j~0; {4498#false} is VALID [2018-11-23 12:34:36,228 INFO L273 TraceCheckUtils]: 45: Hoare triple {4498#false} assume !(~j~0 < ~n~0); {4498#false} is VALID [2018-11-23 12:34:36,228 INFO L273 TraceCheckUtils]: 46: Hoare triple {4498#false} ~i~0 := 1 + ~i~0; {4498#false} is VALID [2018-11-23 12:34:36,228 INFO L273 TraceCheckUtils]: 47: Hoare triple {4498#false} assume !(~i~0 < ~n~0); {4498#false} is VALID [2018-11-23 12:34:36,229 INFO L273 TraceCheckUtils]: 48: Hoare triple {4498#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {4498#false} is VALID [2018-11-23 12:34:36,229 INFO L273 TraceCheckUtils]: 49: Hoare triple {4498#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {4498#false} is VALID [2018-11-23 12:34:36,229 INFO L273 TraceCheckUtils]: 50: Hoare triple {4498#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4498#false} is VALID [2018-11-23 12:34:36,229 INFO L273 TraceCheckUtils]: 51: Hoare triple {4498#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {4498#false} is VALID [2018-11-23 12:34:36,230 INFO L256 TraceCheckUtils]: 52: Hoare triple {4498#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {4498#false} is VALID [2018-11-23 12:34:36,230 INFO L273 TraceCheckUtils]: 53: Hoare triple {4498#false} ~cond := #in~cond; {4498#false} is VALID [2018-11-23 12:34:36,230 INFO L273 TraceCheckUtils]: 54: Hoare triple {4498#false} assume 0 == ~cond; {4498#false} is VALID [2018-11-23 12:34:36,230 INFO L273 TraceCheckUtils]: 55: Hoare triple {4498#false} assume !false; {4498#false} is VALID [2018-11-23 12:34:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-11-23 12:34:36,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:36,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:34:36,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-23 12:34:36,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:36,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:34:36,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:36,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:34:36,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:34:36,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:36,289 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 8 states. [2018-11-23 12:34:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:37,103 INFO L93 Difference]: Finished difference Result 252 states and 320 transitions. [2018-11-23 12:34:37,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:34:37,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-23 12:34:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2018-11-23 12:34:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2018-11-23 12:34:37,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 85 transitions. [2018-11-23 12:34:37,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:37,811 INFO L225 Difference]: With dead ends: 252 [2018-11-23 12:34:37,811 INFO L226 Difference]: Without dead ends: 144 [2018-11-23 12:34:37,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:37,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-23 12:34:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2018-11-23 12:34:38,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:38,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 136 states. [2018-11-23 12:34:38,361 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 136 states. [2018-11-23 12:34:38,361 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 136 states. [2018-11-23 12:34:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:38,366 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2018-11-23 12:34:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2018-11-23 12:34:38,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:38,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:38,367 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 144 states. [2018-11-23 12:34:38,367 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 144 states. [2018-11-23 12:34:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:38,372 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2018-11-23 12:34:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2018-11-23 12:34:38,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:38,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:38,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:38,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 12:34:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 166 transitions. [2018-11-23 12:34:38,378 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 166 transitions. Word has length 56 [2018-11-23 12:34:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:38,378 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 166 transitions. [2018-11-23 12:34:38,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:34:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 166 transitions. [2018-11-23 12:34:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:34:38,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:38,379 INFO L402 BasicCegarLoop]: trace histogram [25, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:38,379 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:38,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1846555298, now seen corresponding path program 8 times [2018-11-23 12:34:38,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:38,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:38,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:38,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:38,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:38,386 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:38,386 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:38,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:38,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:38,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:38,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:38,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:38,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {5621#true} call ULTIMATE.init(); {5621#true} is VALID [2018-11-23 12:34:38,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {5621#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5621#true} is VALID [2018-11-23 12:34:38,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {5621#true} assume true; {5621#true} is VALID [2018-11-23 12:34:38,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5621#true} {5621#true} #99#return; {5621#true} is VALID [2018-11-23 12:34:38,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {5621#true} call #t~ret2 := main(); {5621#true} is VALID [2018-11-23 12:34:38,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {5621#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {5641#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:38,948 INFO L273 TraceCheckUtils]: 6: Hoare triple {5641#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {5641#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:38,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {5641#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {5648#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:38,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {5648#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5652#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:38,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {5652#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5656#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:38,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {5656#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5660#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:34:38,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {5660#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5664#(and (<= 1000 main_~n~0) (<= main_~k~0 4))} is VALID [2018-11-23 12:34:38,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {5664#(and (<= 1000 main_~n~0) (<= main_~k~0 4))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5668#(and (<= main_~k~0 5) (<= 1000 main_~n~0))} is VALID [2018-11-23 12:34:38,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {5668#(and (<= main_~k~0 5) (<= 1000 main_~n~0))} assume !(~k~0 < ~n~0); {5622#false} is VALID [2018-11-23 12:34:38,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {5622#false} ~j~0 := 1 + ~j~0; {5622#false} is VALID [2018-11-23 12:34:38,953 INFO L273 TraceCheckUtils]: 15: Hoare triple {5622#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {5622#false} is VALID [2018-11-23 12:34:38,953 INFO L273 TraceCheckUtils]: 16: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,953 INFO L273 TraceCheckUtils]: 17: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,954 INFO L273 TraceCheckUtils]: 18: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,954 INFO L273 TraceCheckUtils]: 19: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {5622#false} assume !(~k~0 < ~n~0); {5622#false} is VALID [2018-11-23 12:34:38,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {5622#false} ~j~0 := 1 + ~j~0; {5622#false} is VALID [2018-11-23 12:34:38,955 INFO L273 TraceCheckUtils]: 23: Hoare triple {5622#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {5622#false} is VALID [2018-11-23 12:34:38,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,955 INFO L273 TraceCheckUtils]: 25: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,956 INFO L273 TraceCheckUtils]: 26: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,956 INFO L273 TraceCheckUtils]: 27: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,956 INFO L273 TraceCheckUtils]: 28: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,956 INFO L273 TraceCheckUtils]: 29: Hoare triple {5622#false} assume !(~k~0 < ~n~0); {5622#false} is VALID [2018-11-23 12:34:38,956 INFO L273 TraceCheckUtils]: 30: Hoare triple {5622#false} ~j~0 := 1 + ~j~0; {5622#false} is VALID [2018-11-23 12:34:38,956 INFO L273 TraceCheckUtils]: 31: Hoare triple {5622#false} assume !(~j~0 < ~n~0); {5622#false} is VALID [2018-11-23 12:34:38,957 INFO L273 TraceCheckUtils]: 32: Hoare triple {5622#false} ~i~0 := 1 + ~i~0; {5622#false} is VALID [2018-11-23 12:34:38,957 INFO L273 TraceCheckUtils]: 33: Hoare triple {5622#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {5622#false} is VALID [2018-11-23 12:34:38,957 INFO L273 TraceCheckUtils]: 34: Hoare triple {5622#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {5622#false} is VALID [2018-11-23 12:34:38,957 INFO L273 TraceCheckUtils]: 35: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,957 INFO L273 TraceCheckUtils]: 37: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,957 INFO L273 TraceCheckUtils]: 38: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,958 INFO L273 TraceCheckUtils]: 39: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,958 INFO L273 TraceCheckUtils]: 40: Hoare triple {5622#false} assume !(~k~0 < ~n~0); {5622#false} is VALID [2018-11-23 12:34:38,958 INFO L273 TraceCheckUtils]: 41: Hoare triple {5622#false} ~j~0 := 1 + ~j~0; {5622#false} is VALID [2018-11-23 12:34:38,958 INFO L273 TraceCheckUtils]: 42: Hoare triple {5622#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {5622#false} is VALID [2018-11-23 12:34:38,958 INFO L273 TraceCheckUtils]: 43: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,958 INFO L273 TraceCheckUtils]: 44: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,958 INFO L273 TraceCheckUtils]: 45: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,959 INFO L273 TraceCheckUtils]: 46: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,959 INFO L273 TraceCheckUtils]: 47: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5622#false} is VALID [2018-11-23 12:34:38,959 INFO L273 TraceCheckUtils]: 48: Hoare triple {5622#false} assume !(~k~0 < ~n~0); {5622#false} is VALID [2018-11-23 12:34:38,959 INFO L273 TraceCheckUtils]: 49: Hoare triple {5622#false} ~j~0 := 1 + ~j~0; {5622#false} is VALID [2018-11-23 12:34:38,959 INFO L273 TraceCheckUtils]: 50: Hoare triple {5622#false} assume !(~j~0 < ~n~0); {5622#false} is VALID [2018-11-23 12:34:38,959 INFO L273 TraceCheckUtils]: 51: Hoare triple {5622#false} ~i~0 := 1 + ~i~0; {5622#false} is VALID [2018-11-23 12:34:38,959 INFO L273 TraceCheckUtils]: 52: Hoare triple {5622#false} assume !(~i~0 < ~n~0); {5622#false} is VALID [2018-11-23 12:34:38,959 INFO L273 TraceCheckUtils]: 53: Hoare triple {5622#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {5622#false} is VALID [2018-11-23 12:34:38,960 INFO L273 TraceCheckUtils]: 54: Hoare triple {5622#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {5622#false} is VALID [2018-11-23 12:34:38,960 INFO L273 TraceCheckUtils]: 55: Hoare triple {5622#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {5622#false} is VALID [2018-11-23 12:34:38,960 INFO L273 TraceCheckUtils]: 56: Hoare triple {5622#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {5622#false} is VALID [2018-11-23 12:34:38,960 INFO L256 TraceCheckUtils]: 57: Hoare triple {5622#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {5622#false} is VALID [2018-11-23 12:34:38,960 INFO L273 TraceCheckUtils]: 58: Hoare triple {5622#false} ~cond := #in~cond; {5622#false} is VALID [2018-11-23 12:34:38,961 INFO L273 TraceCheckUtils]: 59: Hoare triple {5622#false} assume 0 == ~cond; {5622#false} is VALID [2018-11-23 12:34:38,961 INFO L273 TraceCheckUtils]: 60: Hoare triple {5622#false} assume !false; {5622#false} is VALID [2018-11-23 12:34:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 152 proven. 15 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-11-23 12:34:38,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:38,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:34:38,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-23 12:34:38,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:38,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:34:39,009 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:34:39,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:34:39,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:34:39,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:34:39,010 INFO L87 Difference]: Start difference. First operand 136 states and 166 transitions. Second operand 9 states. [2018-11-23 12:34:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:39,810 INFO L93 Difference]: Finished difference Result 281 states and 355 transitions. [2018-11-23 12:34:39,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:34:39,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-23 12:34:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2018-11-23 12:34:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2018-11-23 12:34:39,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 90 transitions. [2018-11-23 12:34:40,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:40,197 INFO L225 Difference]: With dead ends: 281 [2018-11-23 12:34:40,197 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 12:34:40,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:34:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 12:34:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-11-23 12:34:41,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:41,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 151 states. [2018-11-23 12:34:41,251 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 151 states. [2018-11-23 12:34:41,251 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 151 states. [2018-11-23 12:34:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:41,256 INFO L93 Difference]: Finished difference Result 159 states and 195 transitions. [2018-11-23 12:34:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 195 transitions. [2018-11-23 12:34:41,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:41,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:41,258 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 159 states. [2018-11-23 12:34:41,258 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 159 states. [2018-11-23 12:34:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:41,264 INFO L93 Difference]: Finished difference Result 159 states and 195 transitions. [2018-11-23 12:34:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 195 transitions. [2018-11-23 12:34:41,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:41,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:41,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:41,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-23 12:34:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 184 transitions. [2018-11-23 12:34:41,270 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 184 transitions. Word has length 61 [2018-11-23 12:34:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:41,270 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 184 transitions. [2018-11-23 12:34:41,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:34:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 184 transitions. [2018-11-23 12:34:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:34:41,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:41,271 INFO L402 BasicCegarLoop]: trace histogram [30, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:41,271 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:41,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:41,272 INFO L82 PathProgramCache]: Analyzing trace with hash -820098380, now seen corresponding path program 9 times [2018-11-23 12:34:41,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:41,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:41,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:41,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:41,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:41,278 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:41,278 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:41,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:41,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:41,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:34:41,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:41,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:42,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {6870#true} call ULTIMATE.init(); {6870#true} is VALID [2018-11-23 12:34:42,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {6870#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6870#true} is VALID [2018-11-23 12:34:42,194 INFO L273 TraceCheckUtils]: 2: Hoare triple {6870#true} assume true; {6870#true} is VALID [2018-11-23 12:34:42,194 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6870#true} {6870#true} #99#return; {6870#true} is VALID [2018-11-23 12:34:42,194 INFO L256 TraceCheckUtils]: 4: Hoare triple {6870#true} call #t~ret2 := main(); {6870#true} is VALID [2018-11-23 12:34:42,195 INFO L273 TraceCheckUtils]: 5: Hoare triple {6870#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,195 INFO L273 TraceCheckUtils]: 6: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,197 INFO L273 TraceCheckUtils]: 11: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,197 INFO L273 TraceCheckUtils]: 12: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,198 INFO L273 TraceCheckUtils]: 13: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,198 INFO L273 TraceCheckUtils]: 14: Hoare triple {6890#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,198 INFO L273 TraceCheckUtils]: 15: Hoare triple {6890#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,199 INFO L273 TraceCheckUtils]: 16: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,199 INFO L273 TraceCheckUtils]: 17: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,200 INFO L273 TraceCheckUtils]: 18: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,200 INFO L273 TraceCheckUtils]: 19: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,202 INFO L273 TraceCheckUtils]: 21: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {6890#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,203 INFO L273 TraceCheckUtils]: 24: Hoare triple {6890#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,204 INFO L273 TraceCheckUtils]: 26: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,205 INFO L273 TraceCheckUtils]: 27: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,205 INFO L273 TraceCheckUtils]: 28: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,206 INFO L273 TraceCheckUtils]: 30: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,225 INFO L273 TraceCheckUtils]: 31: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,239 INFO L273 TraceCheckUtils]: 32: Hoare triple {6890#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,245 INFO L273 TraceCheckUtils]: 33: Hoare triple {6890#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,245 INFO L273 TraceCheckUtils]: 34: Hoare triple {6890#(<= 1000 main_~n~0)} assume !(~j~0 < ~n~0); {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,246 INFO L273 TraceCheckUtils]: 35: Hoare triple {6890#(<= 1000 main_~n~0)} ~i~0 := 1 + ~i~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,246 INFO L273 TraceCheckUtils]: 36: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,246 INFO L273 TraceCheckUtils]: 37: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,247 INFO L273 TraceCheckUtils]: 38: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,247 INFO L273 TraceCheckUtils]: 39: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,247 INFO L273 TraceCheckUtils]: 40: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,248 INFO L273 TraceCheckUtils]: 41: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,248 INFO L273 TraceCheckUtils]: 42: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,248 INFO L273 TraceCheckUtils]: 43: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,248 INFO L273 TraceCheckUtils]: 44: Hoare triple {6890#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,249 INFO L273 TraceCheckUtils]: 45: Hoare triple {6890#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {6890#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:42,249 INFO L273 TraceCheckUtils]: 46: Hoare triple {6890#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {7014#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:42,251 INFO L273 TraceCheckUtils]: 47: Hoare triple {7014#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7018#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:42,252 INFO L273 TraceCheckUtils]: 48: Hoare triple {7018#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7022#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:42,253 INFO L273 TraceCheckUtils]: 49: Hoare triple {7022#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7026#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:34:42,254 INFO L273 TraceCheckUtils]: 50: Hoare triple {7026#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7030#(and (<= 1000 main_~n~0) (<= main_~k~0 4))} is VALID [2018-11-23 12:34:42,255 INFO L273 TraceCheckUtils]: 51: Hoare triple {7030#(and (<= 1000 main_~n~0) (<= main_~k~0 4))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7034#(and (<= main_~k~0 5) (<= 1000 main_~n~0))} is VALID [2018-11-23 12:34:42,256 INFO L273 TraceCheckUtils]: 52: Hoare triple {7034#(and (<= main_~k~0 5) (<= 1000 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7038#(and (<= 1000 main_~n~0) (<= main_~k~0 6))} is VALID [2018-11-23 12:34:42,257 INFO L273 TraceCheckUtils]: 53: Hoare triple {7038#(and (<= 1000 main_~n~0) (<= main_~k~0 6))} assume !(~k~0 < ~n~0); {6871#false} is VALID [2018-11-23 12:34:42,257 INFO L273 TraceCheckUtils]: 54: Hoare triple {6871#false} ~j~0 := 1 + ~j~0; {6871#false} is VALID [2018-11-23 12:34:42,258 INFO L273 TraceCheckUtils]: 55: Hoare triple {6871#false} assume !(~j~0 < ~n~0); {6871#false} is VALID [2018-11-23 12:34:42,258 INFO L273 TraceCheckUtils]: 56: Hoare triple {6871#false} ~i~0 := 1 + ~i~0; {6871#false} is VALID [2018-11-23 12:34:42,258 INFO L273 TraceCheckUtils]: 57: Hoare triple {6871#false} assume !(~i~0 < ~n~0); {6871#false} is VALID [2018-11-23 12:34:42,258 INFO L273 TraceCheckUtils]: 58: Hoare triple {6871#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {6871#false} is VALID [2018-11-23 12:34:42,258 INFO L273 TraceCheckUtils]: 59: Hoare triple {6871#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {6871#false} is VALID [2018-11-23 12:34:42,259 INFO L273 TraceCheckUtils]: 60: Hoare triple {6871#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {6871#false} is VALID [2018-11-23 12:34:42,259 INFO L273 TraceCheckUtils]: 61: Hoare triple {6871#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {6871#false} is VALID [2018-11-23 12:34:42,259 INFO L256 TraceCheckUtils]: 62: Hoare triple {6871#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {6871#false} is VALID [2018-11-23 12:34:42,259 INFO L273 TraceCheckUtils]: 63: Hoare triple {6871#false} ~cond := #in~cond; {6871#false} is VALID [2018-11-23 12:34:42,260 INFO L273 TraceCheckUtils]: 64: Hoare triple {6871#false} assume 0 == ~cond; {6871#false} is VALID [2018-11-23 12:34:42,260 INFO L273 TraceCheckUtils]: 65: Hoare triple {6871#false} assume !false; {6871#false} is VALID [2018-11-23 12:34:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 209 proven. 21 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-23 12:34:42,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:42,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 12:34:42,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-11-23 12:34:42,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:42,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:34:42,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:42,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:34:42,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:34:42,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:34:42,315 INFO L87 Difference]: Start difference. First operand 151 states and 184 transitions. Second operand 10 states. [2018-11-23 12:34:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:45,201 INFO L93 Difference]: Finished difference Result 310 states and 390 transitions. [2018-11-23 12:34:45,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:34:45,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-11-23 12:34:45,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:45,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:34:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2018-11-23 12:34:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:34:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2018-11-23 12:34:45,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 95 transitions. [2018-11-23 12:34:46,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:46,423 INFO L225 Difference]: With dead ends: 310 [2018-11-23 12:34:46,423 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 12:34:46,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:34:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 12:34:47,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 166. [2018-11-23 12:34:47,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:47,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 166 states. [2018-11-23 12:34:47,323 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 166 states. [2018-11-23 12:34:47,323 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 166 states. [2018-11-23 12:34:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:47,329 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2018-11-23 12:34:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 213 transitions. [2018-11-23 12:34:47,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:47,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:47,331 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 174 states. [2018-11-23 12:34:47,331 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 174 states. [2018-11-23 12:34:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:47,338 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2018-11-23 12:34:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 213 transitions. [2018-11-23 12:34:47,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:47,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:47,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:47,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-23 12:34:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 202 transitions. [2018-11-23 12:34:47,346 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 202 transitions. Word has length 66 [2018-11-23 12:34:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:47,346 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 202 transitions. [2018-11-23 12:34:47,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:34:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 202 transitions. [2018-11-23 12:34:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:34:47,347 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:47,347 INFO L402 BasicCegarLoop]: trace histogram [35, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:47,348 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:47,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:47,348 INFO L82 PathProgramCache]: Analyzing trace with hash 109034398, now seen corresponding path program 10 times [2018-11-23 12:34:47,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:47,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:47,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:47,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:47,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:47,356 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:47,356 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:47,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:47,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:34:47,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:34:47,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:47,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:48,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {8244#true} call ULTIMATE.init(); {8244#true} is VALID [2018-11-23 12:34:48,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {8244#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8244#true} is VALID [2018-11-23 12:34:48,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {8244#true} assume true; {8244#true} is VALID [2018-11-23 12:34:48,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8244#true} {8244#true} #99#return; {8244#true} is VALID [2018-11-23 12:34:48,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {8244#true} call #t~ret2 := main(); {8244#true} is VALID [2018-11-23 12:34:48,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {8244#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {8244#true} is VALID [2018-11-23 12:34:48,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {8244#true} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {8267#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:48,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {8267#(<= main_~j~0 0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {8271#(and (<= 0 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:48,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {8271#(and (<= 0 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8275#(and (<= main_~j~0 0) (<= 1 main_~k~0))} is VALID [2018-11-23 12:34:48,507 INFO L273 TraceCheckUtils]: 9: Hoare triple {8275#(and (<= main_~j~0 0) (<= 1 main_~k~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8279#(and (<= 2 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:48,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {8279#(and (<= 2 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8283#(and (<= 3 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:48,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {8283#(and (<= 3 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8287#(and (<= main_~j~0 0) (<= 4 main_~k~0))} is VALID [2018-11-23 12:34:48,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {8287#(and (<= main_~j~0 0) (<= 4 main_~k~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8291#(and (<= 5 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:48,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {8291#(and (<= 5 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8295#(and (<= 6 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:48,513 INFO L273 TraceCheckUtils]: 14: Hoare triple {8295#(and (<= 6 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8299#(and (<= main_~j~0 0) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,514 INFO L273 TraceCheckUtils]: 15: Hoare triple {8299#(and (<= main_~j~0 0) (<= 7 main_~n~0))} assume !(~k~0 < ~n~0); {8299#(and (<= main_~j~0 0) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {8299#(and (<= main_~j~0 0) (<= 7 main_~n~0))} ~j~0 := 1 + ~j~0; {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,522 INFO L273 TraceCheckUtils]: 23: Hoare triple {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,523 INFO L273 TraceCheckUtils]: 24: Hoare triple {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,524 INFO L273 TraceCheckUtils]: 25: Hoare triple {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !(~k~0 < ~n~0); {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,525 INFO L273 TraceCheckUtils]: 26: Hoare triple {8306#(and (<= main_~j~0 1) (<= 7 main_~n~0))} ~j~0 := 1 + ~j~0; {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,525 INFO L273 TraceCheckUtils]: 27: Hoare triple {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,526 INFO L273 TraceCheckUtils]: 28: Hoare triple {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,527 INFO L273 TraceCheckUtils]: 29: Hoare triple {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,530 INFO L273 TraceCheckUtils]: 32: Hoare triple {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,531 INFO L273 TraceCheckUtils]: 33: Hoare triple {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,532 INFO L273 TraceCheckUtils]: 34: Hoare triple {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,533 INFO L273 TraceCheckUtils]: 35: Hoare triple {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !(~k~0 < ~n~0); {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,534 INFO L273 TraceCheckUtils]: 36: Hoare triple {8337#(and (<= main_~j~0 2) (<= 7 main_~n~0))} ~j~0 := 1 + ~j~0; {8368#(and (<= main_~j~0 3) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:48,535 INFO L273 TraceCheckUtils]: 37: Hoare triple {8368#(and (<= main_~j~0 3) (<= 7 main_~n~0))} assume !(~j~0 < ~n~0); {8245#false} is VALID [2018-11-23 12:34:48,535 INFO L273 TraceCheckUtils]: 38: Hoare triple {8245#false} ~i~0 := 1 + ~i~0; {8245#false} is VALID [2018-11-23 12:34:48,535 INFO L273 TraceCheckUtils]: 39: Hoare triple {8245#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {8245#false} is VALID [2018-11-23 12:34:48,536 INFO L273 TraceCheckUtils]: 40: Hoare triple {8245#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {8245#false} is VALID [2018-11-23 12:34:48,536 INFO L273 TraceCheckUtils]: 41: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,536 INFO L273 TraceCheckUtils]: 42: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,536 INFO L273 TraceCheckUtils]: 43: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,537 INFO L273 TraceCheckUtils]: 44: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,537 INFO L273 TraceCheckUtils]: 45: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,537 INFO L273 TraceCheckUtils]: 46: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,538 INFO L273 TraceCheckUtils]: 47: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,538 INFO L273 TraceCheckUtils]: 48: Hoare triple {8245#false} assume !(~k~0 < ~n~0); {8245#false} is VALID [2018-11-23 12:34:48,538 INFO L273 TraceCheckUtils]: 49: Hoare triple {8245#false} ~j~0 := 1 + ~j~0; {8245#false} is VALID [2018-11-23 12:34:48,538 INFO L273 TraceCheckUtils]: 50: Hoare triple {8245#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {8245#false} is VALID [2018-11-23 12:34:48,539 INFO L273 TraceCheckUtils]: 51: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,539 INFO L273 TraceCheckUtils]: 52: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,539 INFO L273 TraceCheckUtils]: 53: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,539 INFO L273 TraceCheckUtils]: 54: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,539 INFO L273 TraceCheckUtils]: 55: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,540 INFO L273 TraceCheckUtils]: 56: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,540 INFO L273 TraceCheckUtils]: 57: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call write~int(~i~0 + ~j~0 + ~k~0 + ~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8245#false} is VALID [2018-11-23 12:34:48,540 INFO L273 TraceCheckUtils]: 58: Hoare triple {8245#false} assume !(~k~0 < ~n~0); {8245#false} is VALID [2018-11-23 12:34:48,540 INFO L273 TraceCheckUtils]: 59: Hoare triple {8245#false} ~j~0 := 1 + ~j~0; {8245#false} is VALID [2018-11-23 12:34:48,540 INFO L273 TraceCheckUtils]: 60: Hoare triple {8245#false} assume !(~j~0 < ~n~0); {8245#false} is VALID [2018-11-23 12:34:48,540 INFO L273 TraceCheckUtils]: 61: Hoare triple {8245#false} ~i~0 := 1 + ~i~0; {8245#false} is VALID [2018-11-23 12:34:48,541 INFO L273 TraceCheckUtils]: 62: Hoare triple {8245#false} assume !(~i~0 < ~n~0); {8245#false} is VALID [2018-11-23 12:34:48,541 INFO L273 TraceCheckUtils]: 63: Hoare triple {8245#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {8245#false} is VALID [2018-11-23 12:34:48,541 INFO L273 TraceCheckUtils]: 64: Hoare triple {8245#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {8245#false} is VALID [2018-11-23 12:34:48,541 INFO L273 TraceCheckUtils]: 65: Hoare triple {8245#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {8245#false} is VALID [2018-11-23 12:34:48,542 INFO L273 TraceCheckUtils]: 66: Hoare triple {8245#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {8245#false} is VALID [2018-11-23 12:34:48,542 INFO L256 TraceCheckUtils]: 67: Hoare triple {8245#false} call __VERIFIER_assert((if #t~mem1 % 4294967296 == (~i~0 + ~j~0 + ~k~0 + ~C~0) % 4294967296 then 1 else 0)); {8245#false} is VALID [2018-11-23 12:34:48,542 INFO L273 TraceCheckUtils]: 68: Hoare triple {8245#false} ~cond := #in~cond; {8245#false} is VALID [2018-11-23 12:34:48,542 INFO L273 TraceCheckUtils]: 69: Hoare triple {8245#false} assume 0 == ~cond; {8245#false} is VALID [2018-11-23 12:34:48,543 INFO L273 TraceCheckUtils]: 70: Hoare triple {8245#false} assume !false; {8245#false} is VALID [2018-11-23 12:34:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 425 proven. 208 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-23 12:34:48,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:48,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-23 12:34:48,573 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-23 12:34:48,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:48,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:34:48,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:48,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:34:48,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:34:48,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:34:48,619 INFO L87 Difference]: Start difference. First operand 166 states and 202 transitions. Second operand 14 states. [2018-11-23 12:34:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:50,308 INFO L93 Difference]: Finished difference Result 369 states and 459 transitions. [2018-11-23 12:34:50,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:34:50,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-23 12:34:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:34:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 143 transitions. [2018-11-23 12:34:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:34:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 143 transitions. [2018-11-23 12:34:50,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 143 transitions. [2018-11-23 12:34:50,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:50,851 INFO L225 Difference]: With dead ends: 369 [2018-11-23 12:34:50,851 INFO L226 Difference]: Without dead ends: 241 [2018-11-23 12:34:50,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:34:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-23 12:34:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 199. [2018-11-23 12:34:51,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:51,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 199 states. [2018-11-23 12:34:51,469 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 199 states. [2018-11-23 12:34:51,469 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 199 states. [2018-11-23 12:34:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:51,478 INFO L93 Difference]: Finished difference Result 241 states and 294 transitions. [2018-11-23 12:34:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 294 transitions. [2018-11-23 12:34:51,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:51,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:51,480 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 241 states. [2018-11-23 12:34:51,480 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 241 states. [2018-11-23 12:34:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:51,488 INFO L93 Difference]: Finished difference Result 241 states and 294 transitions. [2018-11-23 12:34:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 294 transitions. [2018-11-23 12:34:51,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:51,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:51,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:51,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-23 12:34:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 242 transitions. [2018-11-23 12:34:51,496 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 242 transitions. Word has length 71 [2018-11-23 12:34:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:51,496 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 242 transitions. [2018-11-23 12:34:51,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:34:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 242 transitions. [2018-11-23 12:34:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 12:34:51,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:51,497 INFO L402 BasicCegarLoop]: trace histogram [56, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:51,498 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:51,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:51,498 INFO L82 PathProgramCache]: Analyzing trace with hash -552358545, now seen corresponding path program 11 times [2018-11-23 12:34:51,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:51,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:51,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:51,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:51,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:51,506 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:51,506 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:51,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:51,530 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1