/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/s3iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:51,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:51,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:51,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:51,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:51,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:51,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:51,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:51,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:51,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:51,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:51,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:51,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:51,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:51,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:51,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:51,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:51,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:51,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:51,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:51,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:51,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:51,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:51,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:51,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:51,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:51,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:51,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:51,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:51,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:51,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:51,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:51,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:51,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:51,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:51,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:51,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:51,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:51,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:51,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:51,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:51,479 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:26:51,501 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:51,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:51,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:51,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:51,504 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:51,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:51,505 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:51,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:51,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:51,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:51,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:51,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:51,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:51,506 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:51,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:51,506 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:51,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:51,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:51,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:51,507 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:51,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:51,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:51,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:51,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:51,508 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:51,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:51,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:51,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:51,509 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:51,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:51,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:51,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:51,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:51,883 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:51,884 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:51,884 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s3iff.c [2020-07-10 15:26:51,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df059c743/c981807fdfc049b3b3eb7e3c667b6f17/FLAG0efa25a16 [2020-07-10 15:26:52,495 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:52,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s3iff.c [2020-07-10 15:26:52,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df059c743/c981807fdfc049b3b3eb7e3c667b6f17/FLAG0efa25a16 [2020-07-10 15:26:52,802 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df059c743/c981807fdfc049b3b3eb7e3c667b6f17 [2020-07-10 15:26:52,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:52,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:52,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:52,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:52,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:52,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:52" (1/1) ... [2020-07-10 15:26:52,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a431c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:52, skipping insertion in model container [2020-07-10 15:26:52,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:52" (1/1) ... [2020-07-10 15:26:52,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:52,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:53,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:53,148 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:53,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:53,209 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:53,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53 WrapperNode [2020-07-10 15:26:53,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:53,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:53,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:53,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:53,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:53,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:53,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:53,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:53,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (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 [2020-07-10 15:26:53,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:53,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:53,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:53,418 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:53,418 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:53,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:53,418 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:53,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:53,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:53,894 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:53,895 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:26:53,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:53 BoogieIcfgContainer [2020-07-10 15:26:53,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:53,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:53,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:53,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:53,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:52" (1/3) ... [2020-07-10 15:26:53,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8a0cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:53, skipping insertion in model container [2020-07-10 15:26:53,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (2/3) ... [2020-07-10 15:26:53,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8a0cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:53, skipping insertion in model container [2020-07-10 15:26:53,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:53" (3/3) ... [2020-07-10 15:26:53,910 INFO L109 eAbstractionObserver]: Analyzing ICFG s3iff.c [2020-07-10 15:26:53,923 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:53,933 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:53,950 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:53,976 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:53,976 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:53,977 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:53,977 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:53,977 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:53,978 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:53,978 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:53,978 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-10 15:26:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:26:54,003 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:54,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:54,005 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:54,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:54,010 INFO L82 PathProgramCache]: Analyzing trace with hash -432131487, now seen corresponding path program 1 times [2020-07-10 15:26:54,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:54,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703802584] [2020-07-10 15:26:54,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:54,286 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {35#true} is VALID [2020-07-10 15:26:54,286 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-10 15:26:54,287 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #72#return; {35#true} is VALID [2020-07-10 15:26:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:54,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2020-07-10 15:26:54,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2020-07-10 15:26:54,304 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2020-07-10 15:26:54,305 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #68#return; {36#false} is VALID [2020-07-10 15:26:54,308 INFO L263 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:54,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {35#true} is VALID [2020-07-10 15:26:54,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-10 15:26:54,310 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #72#return; {35#true} is VALID [2020-07-10 15:26:54,310 INFO L263 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret10 := main(); {35#true} is VALID [2020-07-10 15:26:54,310 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {35#true} is VALID [2020-07-10 15:26:54,311 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(~N~0 <= 0); {35#true} is VALID [2020-07-10 15:26:54,311 INFO L263 TraceCheckUtils]: 7: Hoare triple {35#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {35#true} is VALID [2020-07-10 15:26:54,312 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2020-07-10 15:26:54,313 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2020-07-10 15:26:54,314 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2020-07-10 15:26:54,314 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {36#false} {35#true} #68#return; {36#false} is VALID [2020-07-10 15:26:54,315 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {36#false} is VALID [2020-07-10 15:26:54,315 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2020-07-10 15:26:54,316 INFO L280 TraceCheckUtils]: 14: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2020-07-10 15:26:54,316 INFO L280 TraceCheckUtils]: 15: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2020-07-10 15:26:54,317 INFO L280 TraceCheckUtils]: 16: Hoare triple {36#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {36#false} is VALID [2020-07-10 15:26:54,317 INFO L263 TraceCheckUtils]: 17: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {36#false} is VALID [2020-07-10 15:26:54,317 INFO L280 TraceCheckUtils]: 18: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2020-07-10 15:26:54,318 INFO L280 TraceCheckUtils]: 19: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2020-07-10 15:26:54,318 INFO L280 TraceCheckUtils]: 20: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-10 15:26:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:54,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703802584] [2020-07-10 15:26:54,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:54,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:54,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241047644] [2020-07-10 15:26:54,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:26:54,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:54,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:54,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:54,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:54,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:54,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:54,412 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-10 15:26:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:54,699 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2020-07-10 15:26:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:54,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:26:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2020-07-10 15:26:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2020-07-10 15:26:54,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2020-07-10 15:26:54,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:54,875 INFO L225 Difference]: With dead ends: 54 [2020-07-10 15:26:54,875 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 15:26:54,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 15:26:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-10 15:26:54,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:54,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:54,968 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:54,968 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:54,973 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:26:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:26:54,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:54,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:54,974 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:54,975 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:54,979 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:26:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:26:54,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:54,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:54,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:54,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:26:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-10 15:26:54,986 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2020-07-10 15:26:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:54,987 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-10 15:26:54,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:26:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:26:54,988 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:54,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:54,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:54,989 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash -173966049, now seen corresponding path program 1 times [2020-07-10 15:26:54,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:54,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499772469] [2020-07-10 15:26:54,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:55,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {211#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {200#true} is VALID [2020-07-10 15:26:55,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-10 15:26:55,140 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2020-07-10 15:26:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:55,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {200#true} ~cond := #in~cond; {200#true} is VALID [2020-07-10 15:26:55,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#true} assume !(0 == ~cond); {200#true} is VALID [2020-07-10 15:26:55,153 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-10 15:26:55,155 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {200#true} {205#(<= 1 ~N~0)} #68#return; {205#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:55,156 INFO L263 TraceCheckUtils]: 0: Hoare triple {200#true} call ULTIMATE.init(); {211#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:55,157 INFO L280 TraceCheckUtils]: 1: Hoare triple {211#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {200#true} is VALID [2020-07-10 15:26:55,157 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-10 15:26:55,158 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2020-07-10 15:26:55,158 INFO L263 TraceCheckUtils]: 4: Hoare triple {200#true} call #t~ret10 := main(); {200#true} is VALID [2020-07-10 15:26:55,158 INFO L280 TraceCheckUtils]: 5: Hoare triple {200#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {200#true} is VALID [2020-07-10 15:26:55,160 INFO L280 TraceCheckUtils]: 6: Hoare triple {200#true} assume !(~N~0 <= 0); {205#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:55,160 INFO L263 TraceCheckUtils]: 7: Hoare triple {205#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {200#true} is VALID [2020-07-10 15:26:55,161 INFO L280 TraceCheckUtils]: 8: Hoare triple {200#true} ~cond := #in~cond; {200#true} is VALID [2020-07-10 15:26:55,161 INFO L280 TraceCheckUtils]: 9: Hoare triple {200#true} assume !(0 == ~cond); {200#true} is VALID [2020-07-10 15:26:55,161 INFO L280 TraceCheckUtils]: 10: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-10 15:26:55,162 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {200#true} {205#(<= 1 ~N~0)} #68#return; {205#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:55,164 INFO L280 TraceCheckUtils]: 12: Hoare triple {205#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {210#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:26:55,166 INFO L280 TraceCheckUtils]: 13: Hoare triple {210#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {201#false} is VALID [2020-07-10 15:26:55,166 INFO L280 TraceCheckUtils]: 14: Hoare triple {201#false} ~i~0 := 0; {201#false} is VALID [2020-07-10 15:26:55,167 INFO L280 TraceCheckUtils]: 15: Hoare triple {201#false} assume !(~i~0 < ~N~0); {201#false} is VALID [2020-07-10 15:26:55,167 INFO L280 TraceCheckUtils]: 16: Hoare triple {201#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {201#false} is VALID [2020-07-10 15:26:55,168 INFO L263 TraceCheckUtils]: 17: Hoare triple {201#false} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {201#false} is VALID [2020-07-10 15:26:55,168 INFO L280 TraceCheckUtils]: 18: Hoare triple {201#false} ~cond := #in~cond; {201#false} is VALID [2020-07-10 15:26:55,168 INFO L280 TraceCheckUtils]: 19: Hoare triple {201#false} assume 0 == ~cond; {201#false} is VALID [2020-07-10 15:26:55,169 INFO L280 TraceCheckUtils]: 20: Hoare triple {201#false} assume !false; {201#false} is VALID [2020-07-10 15:26:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:55,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499772469] [2020-07-10 15:26:55,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:55,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:55,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77310501] [2020-07-10 15:26:55,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:26:55,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:55,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:55,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:55,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:55,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:55,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:55,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:55,214 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2020-07-10 15:26:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:55,538 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-10 15:26:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:55,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:26:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-10 15:26:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-10 15:26:55,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2020-07-10 15:26:55,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:55,636 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:26:55,637 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:26:55,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:26:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:26:55,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-07-10 15:26:55,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:55,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2020-07-10 15:26:55,681 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2020-07-10 15:26:55,681 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2020-07-10 15:26:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:55,689 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:26:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:26:55,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:55,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:55,694 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2020-07-10 15:26:55,694 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2020-07-10 15:26:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:55,700 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:26:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:26:55,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:55,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:55,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:55,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:26:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-10 15:26:55,714 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2020-07-10 15:26:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:55,715 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-10 15:26:55,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-10 15:26:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:26:55,721 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:55,722 INFO L422 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, 1, 1, 1, 1] [2020-07-10 15:26:55,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:55,723 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:55,724 INFO L82 PathProgramCache]: Analyzing trace with hash -445719797, now seen corresponding path program 1 times [2020-07-10 15:26:55,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:55,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380280195] [2020-07-10 15:26:55,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:56,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {389#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {371#true} is VALID [2020-07-10 15:26:56,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-10 15:26:56,349 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2020-07-10 15:26:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:56,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {371#true} ~cond := #in~cond; {371#true} is VALID [2020-07-10 15:26:56,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} assume !(0 == ~cond); {371#true} is VALID [2020-07-10 15:26:56,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-10 15:26:56,377 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {371#true} {376#(<= 1 ~N~0)} #68#return; {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:56,380 INFO L263 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {389#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:56,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {389#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {371#true} is VALID [2020-07-10 15:26:56,381 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-10 15:26:56,381 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2020-07-10 15:26:56,382 INFO L263 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret10 := main(); {371#true} is VALID [2020-07-10 15:26:56,382 INFO L280 TraceCheckUtils]: 5: Hoare triple {371#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {371#true} is VALID [2020-07-10 15:26:56,383 INFO L280 TraceCheckUtils]: 6: Hoare triple {371#true} assume !(~N~0 <= 0); {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:56,383 INFO L263 TraceCheckUtils]: 7: Hoare triple {376#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {371#true} is VALID [2020-07-10 15:26:56,384 INFO L280 TraceCheckUtils]: 8: Hoare triple {371#true} ~cond := #in~cond; {371#true} is VALID [2020-07-10 15:26:56,384 INFO L280 TraceCheckUtils]: 9: Hoare triple {371#true} assume !(0 == ~cond); {371#true} is VALID [2020-07-10 15:26:56,384 INFO L280 TraceCheckUtils]: 10: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-10 15:26:56,386 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {371#true} {376#(<= 1 ~N~0)} #68#return; {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:56,395 INFO L280 TraceCheckUtils]: 12: Hoare triple {376#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {381#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-10 15:26:56,397 INFO L280 TraceCheckUtils]: 13: Hoare triple {381#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume !!(~i~0 < ~N~0);call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {381#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-10 15:26:56,399 INFO L280 TraceCheckUtils]: 14: Hoare triple {381#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {382#(and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-10 15:26:56,402 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#(and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume !(~i~0 < ~N~0); {383#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-10 15:26:56,411 INFO L280 TraceCheckUtils]: 16: Hoare triple {383#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} ~i~0 := 0; {383#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-10 15:26:56,413 INFO L280 TraceCheckUtils]: 17: Hoare triple {383#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {384#(and (or (not (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (= (* 4 ~N~0) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)))) (not (= main_~a~0.base |main_~#sum~0.base|)) (or (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-10 15:26:56,416 INFO L280 TraceCheckUtils]: 18: Hoare triple {384#(and (or (not (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (= (* 4 ~N~0) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)))) (not (= main_~a~0.base |main_~#sum~0.base|)) (or (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume 3 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem6;havoc #t~mem5; {385#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} is VALID [2020-07-10 15:26:56,418 INFO L280 TraceCheckUtils]: 19: Hoare triple {385#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {385#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} is VALID [2020-07-10 15:26:56,419 INFO L280 TraceCheckUtils]: 20: Hoare triple {385#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} assume !(~i~0 < ~N~0); {385#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} is VALID [2020-07-10 15:26:56,420 INFO L280 TraceCheckUtils]: 21: Hoare triple {385#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {386#(= (* 4 ~N~0) |main_#t~mem9|)} is VALID [2020-07-10 15:26:56,422 INFO L263 TraceCheckUtils]: 22: Hoare triple {386#(= (* 4 ~N~0) |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {387#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:26:56,424 INFO L280 TraceCheckUtils]: 23: Hoare triple {387#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {388#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:26:56,425 INFO L280 TraceCheckUtils]: 24: Hoare triple {388#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {372#false} is VALID [2020-07-10 15:26:56,425 INFO L280 TraceCheckUtils]: 25: Hoare triple {372#false} assume !false; {372#false} is VALID [2020-07-10 15:26:56,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:56,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380280195] [2020-07-10 15:26:56,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51490255] [2020-07-10 15:26:56,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:56,508 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-10 15:26:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:56,529 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:56,669 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-10 15:26:56,670 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:56,682 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:56,683 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:56,683 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-07-10 15:26:56,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:56,755 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-10 15:26:56,757 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:56,770 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:56,771 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:56,771 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-10 15:26:57,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:57,290 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:57,291 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2020-07-10 15:26:57,296 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:57,338 INFO L624 ElimStorePlain]: treesize reduction 24, result has 65.7 percent of original size [2020-07-10 15:26:57,363 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-10 15:26:57,363 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:46 [2020-07-10 15:26:57,375 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:57,376 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, main_~a~0.base, main_~i~0, main_~a~0.offset, v_main_~i~0_15]. (let ((.cse0 (select |v_#memory_int_15| main_~a~0.base)) (.cse3 (select |v_#memory_int_15| |main_~#sum~0.base|))) (let ((.cse2 (select .cse3 |main_~#sum~0.offset|)) (.cse1 (select .cse0 (+ (* main_~i~0 4) main_~a~0.offset)))) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 3 (select .cse0 (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (= 3 .cse1) (<= v_main_~i~0_15 0) (<= 1 ~N~0) (= 1 .cse2) (= (store |v_#memory_int_15| |main_~#sum~0.base| (store .cse3 |main_~#sum~0.offset| (+ .cse2 .cse1))) |#memory_int|) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|)))) [2020-07-10 15:26:57,376 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~a~0.base, main_~i~0, main_~a~0.offset, v_main_~i~0_15]. (let ((.cse0 (select |#memory_int| main_~a~0.base))) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select .cse0 (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (= 3 (select .cse0 (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) [2020-07-10 15:26:57,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:57,673 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:57,674 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2020-07-10 15:26:57,676 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:57,687 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:57,694 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:57,695 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:53, output treesize:10 [2020-07-10 15:26:57,699 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:57,699 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~a~0.base, main_~i~0, main_~a~0.offset, v_main_~i~0_15, |main_~#sum~0.base|, |main_~#sum~0.offset|]. (let ((.cse0 (select |#memory_int| main_~a~0.base)) (.cse1 (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select .cse0 (+ (* main_~i~0 4) main_~a~0.offset))) (= .cse1 |main_#t~mem9|) (<= 1 ~N~0) (= 3 (select .cse0 (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (= .cse1 4) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) [2020-07-10 15:26:57,700 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ~N~0 1) (<= 1 ~N~0) (= 4 |main_#t~mem9|)) [2020-07-10 15:26:57,757 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:26:57,833 INFO L263 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {371#true} is VALID [2020-07-10 15:26:57,834 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {371#true} is VALID [2020-07-10 15:26:57,834 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-10 15:26:57,834 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2020-07-10 15:26:57,834 INFO L263 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret10 := main(); {371#true} is VALID [2020-07-10 15:26:57,835 INFO L280 TraceCheckUtils]: 5: Hoare triple {371#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {371#true} is VALID [2020-07-10 15:26:57,837 INFO L280 TraceCheckUtils]: 6: Hoare triple {371#true} assume !(~N~0 <= 0); {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:57,839 INFO L263 TraceCheckUtils]: 7: Hoare triple {376#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:57,840 INFO L280 TraceCheckUtils]: 8: Hoare triple {376#(<= 1 ~N~0)} ~cond := #in~cond; {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:57,841 INFO L280 TraceCheckUtils]: 9: Hoare triple {376#(<= 1 ~N~0)} assume !(0 == ~cond); {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:57,842 INFO L280 TraceCheckUtils]: 10: Hoare triple {376#(<= 1 ~N~0)} assume true; {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:57,843 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {376#(<= 1 ~N~0)} {376#(<= 1 ~N~0)} #68#return; {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:57,846 INFO L280 TraceCheckUtils]: 12: Hoare triple {376#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {429#(and (<= main_~i~0 0) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:57,848 INFO L280 TraceCheckUtils]: 13: Hoare triple {429#(and (<= main_~i~0 0) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0);call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {433#(and (<= main_~i~0 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:57,856 INFO L280 TraceCheckUtils]: 14: Hoare triple {433#(and (<= main_~i~0 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {437#(and (exists ((v_main_~i~0_15 Int)) (and (<= main_~i~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:57,859 INFO L280 TraceCheckUtils]: 15: Hoare triple {437#(and (exists ((v_main_~i~0_15 Int)) (and (<= main_~i~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !(~i~0 < ~N~0); {441#(and (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:57,860 INFO L280 TraceCheckUtils]: 16: Hoare triple {441#(and (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} ~i~0 := 0; {441#(and (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:57,862 INFO L280 TraceCheckUtils]: 17: Hoare triple {441#(and (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {448#(and (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:57,870 INFO L280 TraceCheckUtils]: 18: Hoare triple {448#(and (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume 3 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem6;havoc #t~mem5; {452#(and (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))} is VALID [2020-07-10 15:26:57,872 INFO L280 TraceCheckUtils]: 19: Hoare triple {452#(and (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {452#(and (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))} is VALID [2020-07-10 15:26:57,874 INFO L280 TraceCheckUtils]: 20: Hoare triple {452#(and (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))} assume !(~i~0 < ~N~0); {452#(and (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))} is VALID [2020-07-10 15:26:57,876 INFO L280 TraceCheckUtils]: 21: Hoare triple {452#(and (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {462#(and (<= ~N~0 1) (<= 1 ~N~0) (= 4 |main_#t~mem9|))} is VALID [2020-07-10 15:26:57,877 INFO L263 TraceCheckUtils]: 22: Hoare triple {462#(and (<= ~N~0 1) (<= 1 ~N~0) (= 4 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:26:57,879 INFO L280 TraceCheckUtils]: 23: Hoare triple {466#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:26:57,880 INFO L280 TraceCheckUtils]: 24: Hoare triple {470#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {372#false} is VALID [2020-07-10 15:26:57,880 INFO L280 TraceCheckUtils]: 25: Hoare triple {372#false} assume !false; {372#false} is VALID [2020-07-10 15:26:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:57,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:57,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-07-10 15:26:57,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224648672] [2020-07-10 15:26:57,890 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2020-07-10 15:26:57,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:57,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-10 15:27:00,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:00,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-10 15:27:00,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-10 15:27:00,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2020-07-10 15:27:00,042 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 21 states. [2020-07-10 15:27:03,504 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-07-10 15:27:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:03,937 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2020-07-10 15:27:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 15:27:03,937 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2020-07-10 15:27:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:27:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2020-07-10 15:27:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:27:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2020-07-10 15:27:03,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 55 transitions. [2020-07-10 15:27:08,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 53 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:08,358 INFO L225 Difference]: With dead ends: 49 [2020-07-10 15:27:08,358 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 15:27:08,359 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2020-07-10 15:27:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 15:27:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2020-07-10 15:27:08,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:08,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2020-07-10 15:27:08,394 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2020-07-10 15:27:08,394 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2020-07-10 15:27:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:08,396 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-10 15:27:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-10 15:27:08,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:08,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:08,397 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2020-07-10 15:27:08,398 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2020-07-10 15:27:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:08,400 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-10 15:27:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-10 15:27:08,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:08,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:08,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:08,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 15:27:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-07-10 15:27:08,403 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 26 [2020-07-10 15:27:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:08,403 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-07-10 15:27:08,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-10 15:27:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-10 15:27:08,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:08,405 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:08,405 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:08,611 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:27:08,612 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:08,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:08,613 INFO L82 PathProgramCache]: Analyzing trace with hash 531279049, now seen corresponding path program 2 times [2020-07-10 15:27:08,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:08,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469586609] [2020-07-10 15:27:08,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,788 INFO L280 TraceCheckUtils]: 0: Hoare triple {697#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {683#true} is VALID [2020-07-10 15:27:08,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 15:27:08,789 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {683#true} {683#true} #72#return; {683#true} is VALID [2020-07-10 15:27:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,796 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2020-07-10 15:27:08,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2020-07-10 15:27:08,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 15:27:08,797 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #68#return; {683#true} is VALID [2020-07-10 15:27:08,812 INFO L263 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {697#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:08,812 INFO L280 TraceCheckUtils]: 1: Hoare triple {697#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {683#true} is VALID [2020-07-10 15:27:08,813 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 15:27:08,813 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #72#return; {683#true} is VALID [2020-07-10 15:27:08,813 INFO L263 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret10 := main(); {683#true} is VALID [2020-07-10 15:27:08,813 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {683#true} is VALID [2020-07-10 15:27:08,814 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} assume !(~N~0 <= 0); {683#true} is VALID [2020-07-10 15:27:08,814 INFO L263 TraceCheckUtils]: 7: Hoare triple {683#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {683#true} is VALID [2020-07-10 15:27:08,814 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2020-07-10 15:27:08,815 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2020-07-10 15:27:08,815 INFO L280 TraceCheckUtils]: 10: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 15:27:08,815 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {683#true} {683#true} #68#return; {683#true} is VALID [2020-07-10 15:27:08,817 INFO L280 TraceCheckUtils]: 12: Hoare triple {683#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {692#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:08,818 INFO L280 TraceCheckUtils]: 13: Hoare triple {692#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {692#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:08,818 INFO L280 TraceCheckUtils]: 14: Hoare triple {692#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {693#(<= 1 main_~i~0)} is VALID [2020-07-10 15:27:08,820 INFO L280 TraceCheckUtils]: 15: Hoare triple {693#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {694#(<= 2 ~N~0)} is VALID [2020-07-10 15:27:08,821 INFO L280 TraceCheckUtils]: 16: Hoare triple {694#(<= 2 ~N~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {694#(<= 2 ~N~0)} is VALID [2020-07-10 15:27:08,821 INFO L280 TraceCheckUtils]: 17: Hoare triple {694#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {694#(<= 2 ~N~0)} is VALID [2020-07-10 15:27:08,822 INFO L280 TraceCheckUtils]: 18: Hoare triple {694#(<= 2 ~N~0)} ~i~0 := 0; {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-10 15:27:08,823 INFO L280 TraceCheckUtils]: 19: Hoare triple {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-10 15:27:08,824 INFO L280 TraceCheckUtils]: 20: Hoare triple {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} assume 3 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem6;havoc #t~mem5; {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-10 15:27:08,824 INFO L280 TraceCheckUtils]: 21: Hoare triple {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {696#(<= (+ main_~i~0 1) ~N~0)} is VALID [2020-07-10 15:27:08,825 INFO L280 TraceCheckUtils]: 22: Hoare triple {696#(<= (+ main_~i~0 1) ~N~0)} assume !(~i~0 < ~N~0); {684#false} is VALID [2020-07-10 15:27:08,826 INFO L280 TraceCheckUtils]: 23: Hoare triple {684#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {684#false} is VALID [2020-07-10 15:27:08,826 INFO L263 TraceCheckUtils]: 24: Hoare triple {684#false} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {684#false} is VALID [2020-07-10 15:27:08,826 INFO L280 TraceCheckUtils]: 25: Hoare triple {684#false} ~cond := #in~cond; {684#false} is VALID [2020-07-10 15:27:08,826 INFO L280 TraceCheckUtils]: 26: Hoare triple {684#false} assume 0 == ~cond; {684#false} is VALID [2020-07-10 15:27:08,827 INFO L280 TraceCheckUtils]: 27: Hoare triple {684#false} assume !false; {684#false} is VALID [2020-07-10 15:27:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:08,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469586609] [2020-07-10 15:27:08,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81172195] [2020-07-10 15:27:08,829 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-07-10 15:27:08,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:08,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:08,880 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:09,009 INFO L263 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2020-07-10 15:27:09,010 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {683#true} is VALID [2020-07-10 15:27:09,010 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 15:27:09,010 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #72#return; {683#true} is VALID [2020-07-10 15:27:09,010 INFO L263 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret10 := main(); {683#true} is VALID [2020-07-10 15:27:09,010 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {683#true} is VALID [2020-07-10 15:27:09,010 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} assume !(~N~0 <= 0); {683#true} is VALID [2020-07-10 15:27:09,011 INFO L263 TraceCheckUtils]: 7: Hoare triple {683#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {683#true} is VALID [2020-07-10 15:27:09,011 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2020-07-10 15:27:09,011 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2020-07-10 15:27:09,011 INFO L280 TraceCheckUtils]: 10: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 15:27:09,011 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {683#true} {683#true} #68#return; {683#true} is VALID [2020-07-10 15:27:09,012 INFO L280 TraceCheckUtils]: 12: Hoare triple {683#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {737#(<= 0 main_~i~0)} is VALID [2020-07-10 15:27:09,013 INFO L280 TraceCheckUtils]: 13: Hoare triple {737#(<= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {737#(<= 0 main_~i~0)} is VALID [2020-07-10 15:27:09,014 INFO L280 TraceCheckUtils]: 14: Hoare triple {737#(<= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {693#(<= 1 main_~i~0)} is VALID [2020-07-10 15:27:09,015 INFO L280 TraceCheckUtils]: 15: Hoare triple {693#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {694#(<= 2 ~N~0)} is VALID [2020-07-10 15:27:09,016 INFO L280 TraceCheckUtils]: 16: Hoare triple {694#(<= 2 ~N~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {694#(<= 2 ~N~0)} is VALID [2020-07-10 15:27:09,017 INFO L280 TraceCheckUtils]: 17: Hoare triple {694#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {694#(<= 2 ~N~0)} is VALID [2020-07-10 15:27:09,018 INFO L280 TraceCheckUtils]: 18: Hoare triple {694#(<= 2 ~N~0)} ~i~0 := 0; {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-10 15:27:09,019 INFO L280 TraceCheckUtils]: 19: Hoare triple {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-10 15:27:09,020 INFO L280 TraceCheckUtils]: 20: Hoare triple {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} assume 3 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem6;havoc #t~mem5; {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-10 15:27:09,021 INFO L280 TraceCheckUtils]: 21: Hoare triple {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {766#(and (<= 2 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:27:09,021 INFO L280 TraceCheckUtils]: 22: Hoare triple {766#(and (<= 2 ~N~0) (<= main_~i~0 1))} assume !(~i~0 < ~N~0); {684#false} is VALID [2020-07-10 15:27:09,022 INFO L280 TraceCheckUtils]: 23: Hoare triple {684#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {684#false} is VALID [2020-07-10 15:27:09,022 INFO L263 TraceCheckUtils]: 24: Hoare triple {684#false} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {684#false} is VALID [2020-07-10 15:27:09,022 INFO L280 TraceCheckUtils]: 25: Hoare triple {684#false} ~cond := #in~cond; {684#false} is VALID [2020-07-10 15:27:09,022 INFO L280 TraceCheckUtils]: 26: Hoare triple {684#false} assume 0 == ~cond; {684#false} is VALID [2020-07-10 15:27:09,022 INFO L280 TraceCheckUtils]: 27: Hoare triple {684#false} assume !false; {684#false} is VALID [2020-07-10 15:27:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:09,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:09,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-10 15:27:09,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900478567] [2020-07-10 15:27:09,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:09,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:09,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:27:09,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:09,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:27:09,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:09,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:27:09,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:09,083 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 11 states. [2020-07-10 15:27:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:09,811 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-10 15:27:09,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:27:09,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-10 15:27:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-10 15:27:09,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2020-07-10 15:27:09,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:09,898 INFO L225 Difference]: With dead ends: 45 [2020-07-10 15:27:09,898 INFO L226 Difference]: Without dead ends: 39 [2020-07-10 15:27:09,899 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:27:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-10 15:27:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-07-10 15:27:09,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:09,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 35 states. [2020-07-10 15:27:09,940 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 35 states. [2020-07-10 15:27:09,941 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 35 states. [2020-07-10 15:27:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:09,943 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-10 15:27:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-10 15:27:09,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:09,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:09,944 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 39 states. [2020-07-10 15:27:09,944 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 39 states. [2020-07-10 15:27:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:09,947 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-10 15:27:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-10 15:27:09,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:09,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:09,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:09,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:27:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-10 15:27:09,950 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2020-07-10 15:27:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:09,950 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-10 15:27:09,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:27:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:27:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:27:09,952 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:09,952 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:10,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:10,166 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:10,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:10,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1018004383, now seen corresponding path program 3 times [2020-07-10 15:27:10,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:10,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662617542] [2020-07-10 15:27:10,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:10,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {985#true} is VALID [2020-07-10 15:27:10,273 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:27:10,273 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {985#true} {985#true} #72#return; {985#true} is VALID [2020-07-10 15:27:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:10,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-10 15:27:10,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-10 15:27:10,281 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:27:10,281 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #68#return; {985#true} is VALID [2020-07-10 15:27:10,282 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:10,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {985#true} is VALID [2020-07-10 15:27:10,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:27:10,283 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #72#return; {985#true} is VALID [2020-07-10 15:27:10,283 INFO L263 TraceCheckUtils]: 4: Hoare triple {985#true} call #t~ret10 := main(); {985#true} is VALID [2020-07-10 15:27:10,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {985#true} is VALID [2020-07-10 15:27:10,283 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#true} assume !(~N~0 <= 0); {985#true} is VALID [2020-07-10 15:27:10,283 INFO L263 TraceCheckUtils]: 7: Hoare triple {985#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {985#true} is VALID [2020-07-10 15:27:10,284 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-10 15:27:10,284 INFO L280 TraceCheckUtils]: 9: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-10 15:27:10,284 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:27:10,284 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {985#true} {985#true} #68#return; {985#true} is VALID [2020-07-10 15:27:10,286 INFO L280 TraceCheckUtils]: 12: Hoare triple {985#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {994#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:10,287 INFO L280 TraceCheckUtils]: 13: Hoare triple {994#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {994#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:10,288 INFO L280 TraceCheckUtils]: 14: Hoare triple {994#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {995#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:10,288 INFO L280 TraceCheckUtils]: 15: Hoare triple {995#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {996#(<= ~N~0 1)} is VALID [2020-07-10 15:27:10,289 INFO L280 TraceCheckUtils]: 16: Hoare triple {996#(<= ~N~0 1)} ~i~0 := 0; {997#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:27:10,290 INFO L280 TraceCheckUtils]: 17: Hoare triple {997#(and (<= ~N~0 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {997#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:27:10,291 INFO L280 TraceCheckUtils]: 18: Hoare triple {997#(and (<= ~N~0 1) (= 0 main_~i~0))} assume 3 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem6;havoc #t~mem5; {997#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:27:10,292 INFO L280 TraceCheckUtils]: 19: Hoare triple {997#(and (<= ~N~0 1) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {998#(<= ~N~0 main_~i~0)} is VALID [2020-07-10 15:27:10,293 INFO L280 TraceCheckUtils]: 20: Hoare triple {998#(<= ~N~0 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {986#false} is VALID [2020-07-10 15:27:10,293 INFO L280 TraceCheckUtils]: 21: Hoare triple {986#false} assume 3 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem6;havoc #t~mem5; {986#false} is VALID [2020-07-10 15:27:10,294 INFO L280 TraceCheckUtils]: 22: Hoare triple {986#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {986#false} is VALID [2020-07-10 15:27:10,294 INFO L280 TraceCheckUtils]: 23: Hoare triple {986#false} assume !(~i~0 < ~N~0); {986#false} is VALID [2020-07-10 15:27:10,294 INFO L280 TraceCheckUtils]: 24: Hoare triple {986#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {986#false} is VALID [2020-07-10 15:27:10,294 INFO L263 TraceCheckUtils]: 25: Hoare triple {986#false} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {986#false} is VALID [2020-07-10 15:27:10,295 INFO L280 TraceCheckUtils]: 26: Hoare triple {986#false} ~cond := #in~cond; {986#false} is VALID [2020-07-10 15:27:10,295 INFO L280 TraceCheckUtils]: 27: Hoare triple {986#false} assume 0 == ~cond; {986#false} is VALID [2020-07-10 15:27:10,295 INFO L280 TraceCheckUtils]: 28: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-10 15:27:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:10,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662617542] [2020-07-10 15:27:10,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207384156] [2020-07-10 15:27:10,297 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-07-10 15:27:10,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:27:10,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:10,340 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:10,352 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:10,456 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2020-07-10 15:27:10,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {985#true} is VALID [2020-07-10 15:27:10,457 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:27:10,457 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #72#return; {985#true} is VALID [2020-07-10 15:27:10,457 INFO L263 TraceCheckUtils]: 4: Hoare triple {985#true} call #t~ret10 := main(); {985#true} is VALID [2020-07-10 15:27:10,457 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {985#true} is VALID [2020-07-10 15:27:10,457 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#true} assume !(~N~0 <= 0); {985#true} is VALID [2020-07-10 15:27:10,458 INFO L263 TraceCheckUtils]: 7: Hoare triple {985#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {985#true} is VALID [2020-07-10 15:27:10,458 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-10 15:27:10,458 INFO L280 TraceCheckUtils]: 9: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-10 15:27:10,458 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:27:10,459 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {985#true} {985#true} #68#return; {985#true} is VALID [2020-07-10 15:27:10,460 INFO L280 TraceCheckUtils]: 12: Hoare triple {985#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {1039#(<= main_~i~0 0)} is VALID [2020-07-10 15:27:10,461 INFO L280 TraceCheckUtils]: 13: Hoare triple {1039#(<= main_~i~0 0)} assume !!(~i~0 < ~N~0);call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {1039#(<= main_~i~0 0)} is VALID [2020-07-10 15:27:10,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {1039#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {995#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:10,463 INFO L280 TraceCheckUtils]: 15: Hoare triple {995#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {996#(<= ~N~0 1)} is VALID [2020-07-10 15:27:10,463 INFO L280 TraceCheckUtils]: 16: Hoare triple {996#(<= ~N~0 1)} ~i~0 := 0; {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:10,464 INFO L280 TraceCheckUtils]: 17: Hoare triple {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:10,465 INFO L280 TraceCheckUtils]: 18: Hoare triple {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume 3 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem6;havoc #t~mem5; {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:10,466 INFO L280 TraceCheckUtils]: 19: Hoare triple {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1062#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-10 15:27:10,467 INFO L280 TraceCheckUtils]: 20: Hoare triple {1062#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {986#false} is VALID [2020-07-10 15:27:10,467 INFO L280 TraceCheckUtils]: 21: Hoare triple {986#false} assume 3 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem6;havoc #t~mem5; {986#false} is VALID [2020-07-10 15:27:10,467 INFO L280 TraceCheckUtils]: 22: Hoare triple {986#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {986#false} is VALID [2020-07-10 15:27:10,467 INFO L280 TraceCheckUtils]: 23: Hoare triple {986#false} assume !(~i~0 < ~N~0); {986#false} is VALID [2020-07-10 15:27:10,468 INFO L280 TraceCheckUtils]: 24: Hoare triple {986#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {986#false} is VALID [2020-07-10 15:27:10,468 INFO L263 TraceCheckUtils]: 25: Hoare triple {986#false} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {986#false} is VALID [2020-07-10 15:27:10,468 INFO L280 TraceCheckUtils]: 26: Hoare triple {986#false} ~cond := #in~cond; {986#false} is VALID [2020-07-10 15:27:10,468 INFO L280 TraceCheckUtils]: 27: Hoare triple {986#false} assume 0 == ~cond; {986#false} is VALID [2020-07-10 15:27:10,468 INFO L280 TraceCheckUtils]: 28: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-10 15:27:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:10,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:10,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-10 15:27:10,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329020783] [2020-07-10 15:27:10,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-10 15:27:10,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:10,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:27:10,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:10,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:27:10,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:10,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:27:10,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:10,518 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 11 states. [2020-07-10 15:27:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:11,059 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-10 15:27:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:27:11,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-10 15:27:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-10 15:27:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-10 15:27:11,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2020-07-10 15:27:11,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:11,173 INFO L225 Difference]: With dead ends: 49 [2020-07-10 15:27:11,173 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:27:11,174 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:27:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:27:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-10 15:27:11,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:11,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2020-07-10 15:27:11,253 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2020-07-10 15:27:11,254 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2020-07-10 15:27:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:11,259 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:27:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:27:11,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:11,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:11,260 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2020-07-10 15:27:11,260 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2020-07-10 15:27:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:11,269 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:27:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:27:11,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:11,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:11,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:11,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:27:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-10 15:27:11,276 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2020-07-10 15:27:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:11,276 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-10 15:27:11,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:27:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:27:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:27:11,278 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:11,281 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:11,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:11,488 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:11,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:11,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2056219107, now seen corresponding path program 4 times [2020-07-10 15:27:11,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:11,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247628119] [2020-07-10 15:27:11,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:11,598 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:11,598 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:11,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:27:11,663 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:27:11,664 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:11,664 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:11,664 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:27:11,664 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:11,664 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:11,664 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:11,664 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:11,665 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:11,665 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:11,665 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:11,665 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:11,665 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:11,665 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:11,665 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:11,665 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:11,665 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:11,666 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:27:11,666 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:11,666 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:11,666 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:11,666 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:11,666 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:11,666 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:11,666 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:27:11,667 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:11,667 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:27:11,667 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:11,667 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:11,667 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:11,667 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:11,667 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-10 15:27:11,667 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:27:11,668 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:27:11,668 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:11,668 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:11,668 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:11,668 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:27:11,668 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:27:11,668 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:27:11,668 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:27:11,668 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:27:11,669 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:27:11,669 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:27:11,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:11 BoogieIcfgContainer [2020-07-10 15:27:11,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:11,675 INFO L168 Benchmark]: Toolchain (without parser) took 18857.40 ms. Allocated memory was 144.7 MB in the beginning and 299.4 MB in the end (delta: 154.7 MB). Free memory was 102.9 MB in the beginning and 256.0 MB in the end (delta: -153.1 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,676 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.22 ms. Allocated memory is still 144.7 MB. Free memory was 102.7 MB in the beginning and 91.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,677 INFO L168 Benchmark]: Boogie Preprocessor took 135.92 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 91.6 MB in the beginning and 179.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,678 INFO L168 Benchmark]: RCFGBuilder took 553.60 ms. Allocated memory is still 201.9 MB. Free memory was 179.5 MB in the beginning and 155.1 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,679 INFO L168 Benchmark]: TraceAbstraction took 17770.98 ms. Allocated memory was 201.9 MB in the beginning and 299.4 MB in the end (delta: 97.5 MB). Free memory was 154.4 MB in the beginning and 256.0 MB in the end (delta: -101.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:27:11,683 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 388.22 ms. Allocated memory is still 144.7 MB. Free memory was 102.7 MB in the beginning and 91.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.92 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 91.6 MB in the beginning and 179.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 553.60 ms. Allocated memory is still 201.9 MB. Free memory was 179.5 MB in the beginning and 155.1 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17770.98 ms. Allocated memory was 201.9 MB in the beginning and 299.4 MB in the end (delta: 97.5 MB). Free memory was 154.4 MB in the beginning and 256.0 MB in the end (delta: -101.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 1 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=2, sum={2:0}] [L30] COND TRUE i