/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/res2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:30,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:30,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:30,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:30,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:30,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:30,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:30,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:30,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:30,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:30,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:30,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:30,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:30,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:30,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:30,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:30,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:30,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:30,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:30,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:30,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:30,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:30,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:30,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:30,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:30,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:30,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:30,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:30,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:30,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:30,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:30,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:30,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:30,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:30,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:30,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:30,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:30,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:30,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:30,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:30,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:30,871 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-17 22:49:30,895 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:30,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:30,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:30,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:30,898 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:30,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:30,898 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:30,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:30,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:30,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:30,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:30,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:30,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:30,901 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:30,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:30,901 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:30,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:30,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:30,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:30,902 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:30,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:30,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:30,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:30,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:30,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:30,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:30,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:30,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:30,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:30,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:31,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:31,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:31,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:31,231 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:31,232 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:31,233 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/res2f.c [2020-07-17 22:49:31,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3511011/7a4f7830d2b6450fbb030c07fbdb3ff4/FLAG3903faa20 [2020-07-17 22:49:31,766 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:31,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/res2f.c [2020-07-17 22:49:31,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3511011/7a4f7830d2b6450fbb030c07fbdb3ff4/FLAG3903faa20 [2020-07-17 22:49:32,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3511011/7a4f7830d2b6450fbb030c07fbdb3ff4 [2020-07-17 22:49:32,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:32,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:32,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:32,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:32,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:32,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:32" (1/1) ... [2020-07-17 22:49:32,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c0874f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:32, skipping insertion in model container [2020-07-17 22:49:32,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:32" (1/1) ... [2020-07-17 22:49:32,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:32,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:32,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:32,339 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:32,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:32,385 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:32,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:32 WrapperNode [2020-07-17 22:49:32,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:32,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:32,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:32,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:32,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:32" (1/1) ... [2020-07-17 22:49:32,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:32" (1/1) ... [2020-07-17 22:49:32,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:32" (1/1) ... [2020-07-17 22:49:32,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:32" (1/1) ... [2020-07-17 22:49:32,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:32" (1/1) ... [2020-07-17 22:49:32,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:32" (1/1) ... [2020-07-17 22:49:32,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:32" (1/1) ... [2020-07-17 22:49:32,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:32,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:32,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:32,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:32,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:32" (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-17 22:49:32,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:32,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:32,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:32,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:32,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:32,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:32,582 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:32,582 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:32,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:32,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:32,583 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:32,583 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:32,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:49:32,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:32,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:32,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:32,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:32,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:32,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:33,112 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:33,112 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-17 22:49:33,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:33 BoogieIcfgContainer [2020-07-17 22:49:33,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:33,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:33,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:33,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:33,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:32" (1/3) ... [2020-07-17 22:49:33,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235507af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:33, skipping insertion in model container [2020-07-17 22:49:33,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:32" (2/3) ... [2020-07-17 22:49:33,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235507af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:33, skipping insertion in model container [2020-07-17 22:49:33,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:33" (3/3) ... [2020-07-17 22:49:33,125 INFO L109 eAbstractionObserver]: Analyzing ICFG res2f.c [2020-07-17 22:49:33,136 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:33,145 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:33,161 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:33,186 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:33,186 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:33,186 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:33,187 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:33,187 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:33,187 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:33,187 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:33,187 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-07-17 22:49:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:49:33,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:33,215 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, 1, 1, 1] [2020-07-17 22:49:33,215 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:33,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:33,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1797528887, now seen corresponding path program 1 times [2020-07-17 22:49:33,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:33,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125698246] [2020-07-17 22:49:33,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:33,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {55#(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; {46#true} is VALID [2020-07-17 22:49:33,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-17 22:49:33,499 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} #123#return; {46#true} is VALID [2020-07-17 22:49:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:33,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} ~cond := #in~cond; {46#true} is VALID [2020-07-17 22:49:33,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume 0 == ~cond;assume false; {47#false} is VALID [2020-07-17 22:49:33,511 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#false} assume true; {47#false} is VALID [2020-07-17 22:49:33,511 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#false} {46#true} #119#return; {47#false} is VALID [2020-07-17 22:49:33,514 INFO L263 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {55#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:33,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#(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; {46#true} is VALID [2020-07-17 22:49:33,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-17 22:49:33,515 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} #123#return; {46#true} is VALID [2020-07-17 22:49:33,516 INFO L263 TraceCheckUtils]: 4: Hoare triple {46#true} call #t~ret17 := main(); {46#true} is VALID [2020-07-17 22:49:33,516 INFO L280 TraceCheckUtils]: 5: Hoare triple {46#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {46#true} is VALID [2020-07-17 22:49:33,517 INFO L280 TraceCheckUtils]: 6: Hoare triple {46#true} assume !(~N~0 <= 0); {46#true} is VALID [2020-07-17 22:49:33,517 INFO L263 TraceCheckUtils]: 7: Hoare triple {46#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {46#true} is VALID [2020-07-17 22:49:33,518 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#true} ~cond := #in~cond; {46#true} is VALID [2020-07-17 22:49:33,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#true} assume 0 == ~cond;assume false; {47#false} is VALID [2020-07-17 22:49:33,519 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#false} assume true; {47#false} is VALID [2020-07-17 22:49:33,520 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {47#false} {46#true} #119#return; {47#false} is VALID [2020-07-17 22:49:33,521 INFO L280 TraceCheckUtils]: 12: Hoare triple {47#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 #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {47#false} is VALID [2020-07-17 22:49:33,521 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-17 22:49:33,522 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-17 22:49:33,522 INFO L280 TraceCheckUtils]: 15: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-17 22:49:33,522 INFO L280 TraceCheckUtils]: 16: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-17 22:49:33,523 INFO L280 TraceCheckUtils]: 17: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-17 22:49:33,523 INFO L280 TraceCheckUtils]: 18: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-17 22:49:33,524 INFO L280 TraceCheckUtils]: 19: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-17 22:49:33,524 INFO L280 TraceCheckUtils]: 20: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-17 22:49:33,525 INFO L280 TraceCheckUtils]: 21: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-17 22:49:33,525 INFO L280 TraceCheckUtils]: 22: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-17 22:49:33,525 INFO L280 TraceCheckUtils]: 23: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-17 22:49:33,526 INFO L280 TraceCheckUtils]: 24: Hoare triple {47#false} call #t~mem16 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {47#false} is VALID [2020-07-17 22:49:33,526 INFO L263 TraceCheckUtils]: 25: Hoare triple {47#false} call __VERIFIER_assert((if #t~mem16 <= 3 * ~N~0 then 1 else 0)); {47#false} is VALID [2020-07-17 22:49:33,527 INFO L280 TraceCheckUtils]: 26: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2020-07-17 22:49:33,527 INFO L280 TraceCheckUtils]: 27: Hoare triple {47#false} assume 0 == ~cond; {47#false} is VALID [2020-07-17 22:49:33,528 INFO L280 TraceCheckUtils]: 28: Hoare triple {47#false} assume !false; {47#false} is VALID [2020-07-17 22:49:33,532 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-17 22:49:33,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125698246] [2020-07-17 22:49:33,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:33,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:33,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138915591] [2020-07-17 22:49:33,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:49:33,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:33,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:33,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:33,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:33,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:33,617 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-07-17 22:49:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:33,887 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2020-07-17 22:49:33,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:33,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:49:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-17 22:49:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-17 22:49:33,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2020-07-17 22:49:34,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:34,095 INFO L225 Difference]: With dead ends: 76 [2020-07-17 22:49:34,096 INFO L226 Difference]: Without dead ends: 36 [2020-07-17 22:49:34,099 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-17 22:49:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-17 22:49:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-17 22:49:34,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:34,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-17 22:49:34,155 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-17 22:49:34,155 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-17 22:49:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:34,160 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-17 22:49:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-17 22:49:34,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:34,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:34,162 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-17 22:49:34,162 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-17 22:49:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:34,167 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-17 22:49:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-17 22:49:34,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:34,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:34,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:34,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:49:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-17 22:49:34,174 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2020-07-17 22:49:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:34,175 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-17 22:49:34,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-17 22:49:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:49:34,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:34,176 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, 1, 1, 1] [2020-07-17 22:49:34,177 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:34,177 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:34,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:34,178 INFO L82 PathProgramCache]: Analyzing trace with hash 120259143, now seen corresponding path program 1 times [2020-07-17 22:49:34,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:34,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611426567] [2020-07-17 22:49:34,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:34,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {289#(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; {278#true} is VALID [2020-07-17 22:49:34,364 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-17 22:49:34,364 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} #123#return; {278#true} is VALID [2020-07-17 22:49:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:34,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {278#true} ~cond := #in~cond; {278#true} is VALID [2020-07-17 22:49:34,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#true} assume !(0 == ~cond); {278#true} is VALID [2020-07-17 22:49:34,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-17 22:49:34,376 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {278#true} {283#(<= 1 ~N~0)} #119#return; {283#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:34,377 INFO L263 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:34,378 INFO L280 TraceCheckUtils]: 1: Hoare triple {289#(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; {278#true} is VALID [2020-07-17 22:49:34,378 INFO L280 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-17 22:49:34,378 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #123#return; {278#true} is VALID [2020-07-17 22:49:34,379 INFO L263 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret17 := main(); {278#true} is VALID [2020-07-17 22:49:34,379 INFO L280 TraceCheckUtils]: 5: Hoare triple {278#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {278#true} is VALID [2020-07-17 22:49:34,380 INFO L280 TraceCheckUtils]: 6: Hoare triple {278#true} assume !(~N~0 <= 0); {283#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:34,380 INFO L263 TraceCheckUtils]: 7: Hoare triple {283#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {278#true} is VALID [2020-07-17 22:49:34,381 INFO L280 TraceCheckUtils]: 8: Hoare triple {278#true} ~cond := #in~cond; {278#true} is VALID [2020-07-17 22:49:34,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {278#true} assume !(0 == ~cond); {278#true} is VALID [2020-07-17 22:49:34,381 INFO L280 TraceCheckUtils]: 10: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-17 22:49:34,382 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {278#true} {283#(<= 1 ~N~0)} #119#return; {283#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:34,384 INFO L280 TraceCheckUtils]: 12: Hoare triple {283#(<= 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 #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {288#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:49:34,385 INFO L280 TraceCheckUtils]: 13: Hoare triple {288#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-17 22:49:34,385 INFO L280 TraceCheckUtils]: 14: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-17 22:49:34,386 INFO L280 TraceCheckUtils]: 15: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-17 22:49:34,386 INFO L280 TraceCheckUtils]: 16: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-17 22:49:34,386 INFO L280 TraceCheckUtils]: 17: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-17 22:49:34,386 INFO L280 TraceCheckUtils]: 18: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-17 22:49:34,387 INFO L280 TraceCheckUtils]: 19: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-17 22:49:34,387 INFO L280 TraceCheckUtils]: 20: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-17 22:49:34,387 INFO L280 TraceCheckUtils]: 21: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-17 22:49:34,388 INFO L280 TraceCheckUtils]: 22: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-17 22:49:34,388 INFO L280 TraceCheckUtils]: 23: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-17 22:49:34,388 INFO L280 TraceCheckUtils]: 24: Hoare triple {279#false} call #t~mem16 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {279#false} is VALID [2020-07-17 22:49:34,389 INFO L263 TraceCheckUtils]: 25: Hoare triple {279#false} call __VERIFIER_assert((if #t~mem16 <= 3 * ~N~0 then 1 else 0)); {279#false} is VALID [2020-07-17 22:49:34,389 INFO L280 TraceCheckUtils]: 26: Hoare triple {279#false} ~cond := #in~cond; {279#false} is VALID [2020-07-17 22:49:34,389 INFO L280 TraceCheckUtils]: 27: Hoare triple {279#false} assume 0 == ~cond; {279#false} is VALID [2020-07-17 22:49:34,390 INFO L280 TraceCheckUtils]: 28: Hoare triple {279#false} assume !false; {279#false} is VALID [2020-07-17 22:49:34,391 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-17 22:49:34,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611426567] [2020-07-17 22:49:34,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:34,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:49:34,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882947542] [2020-07-17 22:49:34,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-07-17 22:49:34,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:34,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:34,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:34,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:34,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:34,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:34,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:34,429 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2020-07-17 22:49:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:34,854 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2020-07-17 22:49:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:49:34,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-07-17 22:49:34,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2020-07-17 22:49:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2020-07-17 22:49:34,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2020-07-17 22:49:34,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:34,993 INFO L225 Difference]: With dead ends: 69 [2020-07-17 22:49:34,993 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:49:34,994 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-17 22:49:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:49:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-07-17 22:49:35,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:35,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 42 states. [2020-07-17 22:49:35,030 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 42 states. [2020-07-17 22:49:35,030 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 42 states. [2020-07-17 22:49:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:35,034 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-17 22:49:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2020-07-17 22:49:35,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:35,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:35,035 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 48 states. [2020-07-17 22:49:35,036 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 48 states. [2020-07-17 22:49:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:35,040 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-17 22:49:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2020-07-17 22:49:35,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:35,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:35,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:35,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:35,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 22:49:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2020-07-17 22:49:35,054 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 29 [2020-07-17 22:49:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:35,054 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2020-07-17 22:49:35,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-17 22:49:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-17 22:49:35,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:35,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:35,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:49:35,057 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:35,058 INFO L82 PathProgramCache]: Analyzing trace with hash -774790125, now seen corresponding path program 1 times [2020-07-17 22:49:35,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:35,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686912824] [2020-07-17 22:49:35,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:35,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:35,304 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:35,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:49:35,414 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:35,415 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:35,415 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:35,415 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:35,415 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:35,415 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:35,416 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:35,416 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:35,416 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:35,416 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:35,416 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:35,416 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:35,416 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:35,416 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:35,417 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:35,417 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:35,417 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:35,417 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:35,417 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:35,417 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:35,417 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:35,418 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:35,418 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:35,418 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:35,418 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:35,418 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:35,418 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:35,418 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:35,419 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-17 22:49:35,419 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-17 22:49:35,419 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-17 22:49:35,419 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-17 22:49:35,419 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2020-07-17 22:49:35,419 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-17 22:49:35,419 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-17 22:49:35,419 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-17 22:49:35,420 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-17 22:49:35,420 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-17 22:49:35,420 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-17 22:49:35,420 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-17 22:49:35,420 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-17 22:49:35,420 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-17 22:49:35,420 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-17 22:49:35,421 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-17 22:49:35,421 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-17 22:49:35,421 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-17 22:49:35,421 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-17 22:49:35,421 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-17 22:49:35,421 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-17 22:49:35,421 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-17 22:49:35,421 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-17 22:49:35,421 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-17 22:49:35,422 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2020-07-17 22:49:35,422 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-17 22:49:35,422 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-17 22:49:35,422 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-17 22:49:35,422 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-17 22:49:35,422 WARN L170 areAnnotationChecker]: L57-4 has no Hoare annotation [2020-07-17 22:49:35,422 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-17 22:49:35,423 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-17 22:49:35,423 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-17 22:49:35,423 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-17 22:49:35,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:35 BoogieIcfgContainer [2020-07-17 22:49:35,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:35,429 INFO L168 Benchmark]: Toolchain (without parser) took 3318.38 ms. Allocated memory was 136.8 MB in the beginning and 250.6 MB in the end (delta: 113.8 MB). Free memory was 101.9 MB in the beginning and 207.5 MB in the end (delta: -105.6 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:35,430 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:35,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.02 ms. Allocated memory is still 136.8 MB. Free memory was 101.7 MB in the beginning and 89.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:35,432 INFO L168 Benchmark]: Boogie Preprocessor took 130.75 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 89.6 MB in the beginning and 176.9 MB in the end (delta: -87.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:35,433 INFO L168 Benchmark]: RCFGBuilder took 598.99 ms. Allocated memory is still 199.8 MB. Free memory was 176.9 MB in the beginning and 144.6 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:35,434 INFO L168 Benchmark]: TraceAbstraction took 2307.91 ms. Allocated memory was 199.8 MB in the beginning and 250.6 MB in the end (delta: 50.9 MB). Free memory was 143.9 MB in the beginning and 207.5 MB in the end (delta: -63.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:49:35,437 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 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 274.02 ms. Allocated memory is still 136.8 MB. Free memory was 101.7 MB in the beginning and 89.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.75 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 89.6 MB in the beginning and 176.9 MB in the end (delta: -87.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 598.99 ms. Allocated memory is still 199.8 MB. Free memory was 176.9 MB in the beginning and 144.6 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2307.91 ms. Allocated memory was 199.8 MB in the beginning and 250.6 MB in the end (delta: 50.9 MB). Free memory was 143.9 MB in the beginning and 207.5 MB in the end (delta: -63.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=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L28] int *b = malloc(sizeof(int)*N); [L29] int *c = malloc(sizeof(int)*N); [L31] sum[0] = 1 [L32] i=0 VAL [\old(N)=0, a={-2:0}, b={-1:0}, c={5:0}, i=0, malloc(sizeof(int)*N)={-1:0}, malloc(sizeof(int)*N)={-2:0}, malloc(sizeof(int)*N)={5:0}, N=1, sum={7:0}] [L32] COND TRUE i