/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/res1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:39,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:39,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:39,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:39,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:39,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:39,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:39,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:39,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:39,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:39,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:39,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:39,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:39,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:39,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:39,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:39,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:39,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:39,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:39,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:39,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:39,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:39,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:39,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:39,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:39,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:39,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:39,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:39,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:39,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:39,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:39,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:39,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:39,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:39,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:39,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:39,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:39,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:39,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:39,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:39,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:39,931 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:39,964 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:39,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:39,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:39,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:39,966 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:39,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:39,966 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:39,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:39,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:39,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:39,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:39,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:39,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:39,968 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:39,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:39,968 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:39,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:39,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:39,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:39,969 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:39,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:39,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:39,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:39,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:39,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:39,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:39,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:39,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:39,970 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:39,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:40,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:40,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:40,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:40,244 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:40,244 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:40,245 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/res1f.c [2020-07-10 15:26:40,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19180b58/bf87168bf0c34ada93efb32883083a2f/FLAGe9010818b [2020-07-10 15:26:40,751 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:40,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/res1f.c [2020-07-10 15:26:40,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19180b58/bf87168bf0c34ada93efb32883083a2f/FLAGe9010818b [2020-07-10 15:26:41,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19180b58/bf87168bf0c34ada93efb32883083a2f [2020-07-10 15:26:41,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:41,116 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:41,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:41,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:41,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:41,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:41" (1/1) ... [2020-07-10 15:26:41,130 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 10.07 03:26:41, skipping insertion in model container [2020-07-10 15:26:41,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:41" (1/1) ... [2020-07-10 15:26:41,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:41,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:41,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:41,349 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:41,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:41,391 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:41,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:41 WrapperNode [2020-07-10 15:26:41,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:41,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:41,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:41,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:41,498 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:41" (1/1) ... [2020-07-10 15:26:41,498 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:41" (1/1) ... [2020-07-10 15:26:41,507 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:41" (1/1) ... [2020-07-10 15:26:41,507 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:41" (1/1) ... [2020-07-10 15:26:41,519 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:41" (1/1) ... [2020-07-10 15:26:41,526 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:41" (1/1) ... [2020-07-10 15:26:41,527 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:41" (1/1) ... [2020-07-10 15:26:41,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:41,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:41,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:41,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:41,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:41" (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:41,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:41,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:41,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:41,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:41,595 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:42,041 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:42,042 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 15:26:42,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:42 BoogieIcfgContainer [2020-07-10 15:26:42,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:42,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:42,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:42,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:42,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:41" (1/3) ... [2020-07-10 15:26:42,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a36b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:42, skipping insertion in model container [2020-07-10 15:26:42,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:41" (2/3) ... [2020-07-10 15:26:42,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a36b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:42, skipping insertion in model container [2020-07-10 15:26:42,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:42" (3/3) ... [2020-07-10 15:26:42,052 INFO L109 eAbstractionObserver]: Analyzing ICFG res1f.c [2020-07-10 15:26:42,060 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:42,066 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:42,077 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:42,095 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:42,095 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:42,095 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:42,095 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:42,095 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:42,096 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:42,096 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:42,096 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-10 15:26:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:26:42,117 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:42,118 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] [2020-07-10 15:26:42,118 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:42,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1562148239, now seen corresponding path program 1 times [2020-07-10 15:26:42,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:42,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165640946] [2020-07-10 15:26:42,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:42,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {49#(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; {40#true} is VALID [2020-07-10 15:26:42,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-10 15:26:42,361 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2020-07-10 15:26:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:42,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2020-07-10 15:26:42,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2020-07-10 15:26:42,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-10 15:26:42,374 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID [2020-07-10 15:26:42,376 INFO L263 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(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:42,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(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; {40#true} is VALID [2020-07-10 15:26:42,377 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-10 15:26:42,377 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2020-07-10 15:26:42,378 INFO L263 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret12 := main(); {40#true} is VALID [2020-07-10 15:26:42,378 INFO L280 TraceCheckUtils]: 5: Hoare triple {40#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {40#true} is VALID [2020-07-10 15:26:42,379 INFO L280 TraceCheckUtils]: 6: Hoare triple {40#true} assume !(~N~0 <= 0); {40#true} is VALID [2020-07-10 15:26:42,379 INFO L263 TraceCheckUtils]: 7: Hoare triple {40#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {40#true} is VALID [2020-07-10 15:26:42,379 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2020-07-10 15:26:42,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2020-07-10 15:26:42,381 INFO L280 TraceCheckUtils]: 10: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-10 15:26:42,382 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID [2020-07-10 15:26:42,382 INFO L280 TraceCheckUtils]: 12: Hoare triple {41#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 write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {41#false} is VALID [2020-07-10 15:26:42,383 INFO L280 TraceCheckUtils]: 13: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-10 15:26:42,383 INFO L280 TraceCheckUtils]: 14: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-10 15:26:42,383 INFO L280 TraceCheckUtils]: 15: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-10 15:26:42,384 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-10 15:26:42,384 INFO L280 TraceCheckUtils]: 17: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-10 15:26:42,385 INFO L280 TraceCheckUtils]: 18: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-10 15:26:42,385 INFO L280 TraceCheckUtils]: 19: Hoare triple {41#false} assume !true; {41#false} is VALID [2020-07-10 15:26:42,386 INFO L280 TraceCheckUtils]: 20: Hoare triple {41#false} call #t~mem11 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {41#false} is VALID [2020-07-10 15:26:42,386 INFO L263 TraceCheckUtils]: 21: Hoare triple {41#false} call __VERIFIER_assert((if #t~mem11 <= 2 * ~N~0 then 1 else 0)); {41#false} is VALID [2020-07-10 15:26:42,386 INFO L280 TraceCheckUtils]: 22: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2020-07-10 15:26:42,387 INFO L280 TraceCheckUtils]: 23: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2020-07-10 15:26:42,387 INFO L280 TraceCheckUtils]: 24: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-10 15:26:42,394 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:42,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165640946] [2020-07-10 15:26:42,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:42,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:42,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648346089] [2020-07-10 15:26:42,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:26:42,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:42,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:42,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:42,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:42,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:42,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:42,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:42,520 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-07-10 15:26:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:42,766 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2020-07-10 15:26:42,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:42,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:26:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-10 15:26:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-10 15:26:42,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2020-07-10 15:26:42,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:42,940 INFO L225 Difference]: With dead ends: 64 [2020-07-10 15:26:42,940 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:26:42,944 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:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:26:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-10 15:26:42,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:42,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-10 15:26:42,996 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 15:26:42,996 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 15:26:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:43,001 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:26:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:26:43,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:43,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:43,002 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 15:26:43,002 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 15:26:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:43,006 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:26:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:26:43,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:43,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:43,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:43,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:26:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-10 15:26:43,012 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2020-07-10 15:26:43,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:43,013 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-10 15:26:43,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:26:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:26:43,014 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:43,015 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] [2020-07-10 15:26:43,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:43,015 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:43,016 INFO L82 PathProgramCache]: Analyzing trace with hash 369304979, now seen corresponding path program 1 times [2020-07-10 15:26:43,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:43,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161938105] [2020-07-10 15:26:43,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:43,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#(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; {236#true} is VALID [2020-07-10 15:26:43,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-10 15:26:43,149 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {236#true} {236#true} #95#return; {236#true} is VALID [2020-07-10 15:26:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:43,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {236#true} ~cond := #in~cond; {236#true} is VALID [2020-07-10 15:26:43,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#true} assume !(0 == ~cond); {236#true} is VALID [2020-07-10 15:26:43,159 INFO L280 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-10 15:26:43,160 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {236#true} {241#(<= 1 ~N~0)} #91#return; {241#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:43,161 INFO L263 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {247#(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:43,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {247#(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; {236#true} is VALID [2020-07-10 15:26:43,162 INFO L280 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-10 15:26:43,162 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #95#return; {236#true} is VALID [2020-07-10 15:26:43,163 INFO L263 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret12 := main(); {236#true} is VALID [2020-07-10 15:26:43,163 INFO L280 TraceCheckUtils]: 5: Hoare triple {236#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {236#true} is VALID [2020-07-10 15:26:43,164 INFO L280 TraceCheckUtils]: 6: Hoare triple {236#true} assume !(~N~0 <= 0); {241#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:43,164 INFO L263 TraceCheckUtils]: 7: Hoare triple {241#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {236#true} is VALID [2020-07-10 15:26:43,164 INFO L280 TraceCheckUtils]: 8: Hoare triple {236#true} ~cond := #in~cond; {236#true} is VALID [2020-07-10 15:26:43,165 INFO L280 TraceCheckUtils]: 9: Hoare triple {236#true} assume !(0 == ~cond); {236#true} is VALID [2020-07-10 15:26:43,165 INFO L280 TraceCheckUtils]: 10: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-10 15:26:43,166 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {236#true} {241#(<= 1 ~N~0)} #91#return; {241#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:43,168 INFO L280 TraceCheckUtils]: 12: Hoare triple {241#(<= 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 write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {246#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:26:43,169 INFO L280 TraceCheckUtils]: 13: Hoare triple {246#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-10 15:26:43,169 INFO L280 TraceCheckUtils]: 14: Hoare triple {237#false} ~i~0 := 0; {237#false} is VALID [2020-07-10 15:26:43,169 INFO L280 TraceCheckUtils]: 15: Hoare triple {237#false} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-10 15:26:43,170 INFO L280 TraceCheckUtils]: 16: Hoare triple {237#false} ~i~0 := 0; {237#false} is VALID [2020-07-10 15:26:43,170 INFO L280 TraceCheckUtils]: 17: Hoare triple {237#false} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-10 15:26:43,170 INFO L280 TraceCheckUtils]: 18: Hoare triple {237#false} ~i~0 := 0; {237#false} is VALID [2020-07-10 15:26:43,171 INFO L280 TraceCheckUtils]: 19: Hoare triple {237#false} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-10 15:26:43,171 INFO L280 TraceCheckUtils]: 20: Hoare triple {237#false} call #t~mem11 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {237#false} is VALID [2020-07-10 15:26:43,171 INFO L263 TraceCheckUtils]: 21: Hoare triple {237#false} call __VERIFIER_assert((if #t~mem11 <= 2 * ~N~0 then 1 else 0)); {237#false} is VALID [2020-07-10 15:26:43,171 INFO L280 TraceCheckUtils]: 22: Hoare triple {237#false} ~cond := #in~cond; {237#false} is VALID [2020-07-10 15:26:43,172 INFO L280 TraceCheckUtils]: 23: Hoare triple {237#false} assume 0 == ~cond; {237#false} is VALID [2020-07-10 15:26:43,172 INFO L280 TraceCheckUtils]: 24: Hoare triple {237#false} assume !false; {237#false} is VALID [2020-07-10 15:26:43,175 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:43,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161938105] [2020-07-10 15:26:43,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:43,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:43,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543312496] [2020-07-10 15:26:43,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-10 15:26:43,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:43,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:43,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:43,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:43,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:43,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:43,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:43,214 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2020-07-10 15:26:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:43,486 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2020-07-10 15:26:43,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:43,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-10 15:26:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-10 15:26:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-10 15:26:43,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2020-07-10 15:26:43,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:43,578 INFO L225 Difference]: With dead ends: 53 [2020-07-10 15:26:43,578 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 15:26:43,579 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:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 15:26:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2020-07-10 15:26:43,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:43,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 34 states. [2020-07-10 15:26:43,616 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 34 states. [2020-07-10 15:26:43,616 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 34 states. [2020-07-10 15:26:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:43,620 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-10 15:26:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-07-10 15:26:43,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:43,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:43,621 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 38 states. [2020-07-10 15:26:43,622 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 38 states. [2020-07-10 15:26:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:43,625 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-10 15:26:43,625 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-07-10 15:26:43,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:43,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:43,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:43,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:26:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2020-07-10 15:26:43,630 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2020-07-10 15:26:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:43,630 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-07-10 15:26:43,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-10 15:26:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 15:26:43,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:43,632 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] [2020-07-10 15:26:43,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:43,633 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:43,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:43,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1815337701, now seen corresponding path program 1 times [2020-07-10 15:26:43,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:43,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504455420] [2020-07-10 15:26:43,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:43,852 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:43,852 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:43,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:26:43,899 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:43,899 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:43,899 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:43,900 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:43,900 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:43,900 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:43,900 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:43,900 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:43,901 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:43,901 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:43,901 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:43,901 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:43,901 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:43,901 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:43,902 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:43,902 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:43,902 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:43,902 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:43,902 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:43,903 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:43,903 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:43,903 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:43,903 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:43,903 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:43,903 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:43,904 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:43,904 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:43,904 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:43,904 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:26:43,904 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:26:43,905 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:26:43,905 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-10 15:26:43,905 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:26:43,905 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-10 15:26:43,905 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:26:43,906 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:26:43,906 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:26:43,906 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-10 15:26:43,906 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 15:26:43,906 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:26:43,906 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:26:43,907 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:26:43,907 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2020-07-10 15:26:43,907 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 15:26:43,907 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:26:43,907 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:26:43,907 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:26:43,908 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-10 15:26:43,908 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-10 15:26:43,908 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 15:26:43,908 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 15:26:43,908 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:26:43,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:43 BoogieIcfgContainer [2020-07-10 15:26:43,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:43,915 INFO L168 Benchmark]: Toolchain (without parser) took 2797.90 ms. Allocated memory was 145.8 MB in the beginning and 234.9 MB in the end (delta: 89.1 MB). Free memory was 103.3 MB in the beginning and 93.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 98.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:43,916 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:43,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.95 ms. Allocated memory is still 145.8 MB. Free memory was 102.9 MB in the beginning and 91.8 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:26:43,917 INFO L168 Benchmark]: Boogie Preprocessor took 138.10 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 91.8 MB in the beginning and 180.9 MB in the end (delta: -89.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:43,918 INFO L168 Benchmark]: RCFGBuilder took 514.14 ms. Allocated memory is still 203.4 MB. Free memory was 180.2 MB in the beginning and 151.8 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:43,919 INFO L168 Benchmark]: TraceAbstraction took 1865.56 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 151.8 MB in the beginning and 93.5 MB in the end (delta: 58.3 MB). Peak memory consumption was 89.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:43,923 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.95 ms. Allocated memory is still 145.8 MB. Free memory was 102.9 MB in the beginning and 91.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.10 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 91.8 MB in the beginning and 180.9 MB in the end (delta: -89.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 514.14 ms. Allocated memory is still 203.4 MB. Free memory was 180.2 MB in the beginning and 151.8 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1865.56 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 151.8 MB in the beginning and 93.5 MB in the end (delta: 58.3 MB). Peak memory consumption was 89.7 MB. 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); [L30] sum[0] = 1 [L31] i=0 VAL [\old(N)=0, a={-1:0}, b={5:0}, i=0, malloc(sizeof(int)*N)={5:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={7:0}] [L31] COND TRUE i