/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/condmf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:48:55,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:48:55,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:48:55,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:48:55,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:48:55,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:48:55,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:48:55,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:48:55,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:48:55,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:48:55,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:48:55,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:48:55,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:48:55,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:48:55,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:48:55,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:48:55,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:48:55,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:48:55,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:48:55,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:48:55,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:48:55,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:48:55,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:48:55,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:48:55,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:48:55,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:48:55,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:48:55,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:48:55,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:48:55,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:48:55,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:48:55,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:48:55,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:48:55,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:48:55,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:48:55,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:48:55,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:48:55,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:48:55,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:48:55,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:48:55,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:48:55,447 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:48:55,465 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:48:55,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:48:55,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:48:55,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:48:55,467 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:48:55,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:48:55,468 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:48:55,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:48:55,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:48:55,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:48:55,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:48:55,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:48:55,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:48:55,471 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:48:55,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:48:55,471 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:48:55,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:48:55,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:48:55,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:48:55,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:48:55,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:48:55,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:48:55,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:48:55,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:48:55,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:48:55,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:48:55,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:48:55,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:48:55,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:48:55,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:48:55,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:48:55,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:48:55,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:48:55,882 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:48:55,882 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:48:55,883 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condmf.c [2020-07-17 22:48:55,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b873da1/22a82ba620f84a87af9b7ef6ee5356b7/FLAGb712e8e62 [2020-07-17 22:48:56,433 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:48:56,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condmf.c [2020-07-17 22:48:56,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b873da1/22a82ba620f84a87af9b7ef6ee5356b7/FLAGb712e8e62 [2020-07-17 22:48:56,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b873da1/22a82ba620f84a87af9b7ef6ee5356b7 [2020-07-17 22:48:56,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:48:56,791 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:48:56,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:56,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:48:56,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:48:56,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:56" (1/1) ... [2020-07-17 22:48:56,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5360ace9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:56, skipping insertion in model container [2020-07-17 22:48:56,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:56" (1/1) ... [2020-07-17 22:48:56,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:48:56,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:48:57,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:57,132 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:48:57,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:57,308 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:48:57,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:57 WrapperNode [2020-07-17 22:48:57,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:57,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:48:57,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:48:57,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:48:57,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:57" (1/1) ... [2020-07-17 22:48:57,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:57" (1/1) ... [2020-07-17 22:48:57,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:57" (1/1) ... [2020-07-17 22:48:57,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:57" (1/1) ... [2020-07-17 22:48:57,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:57" (1/1) ... [2020-07-17 22:48:57,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:57" (1/1) ... [2020-07-17 22:48:57,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:57" (1/1) ... [2020-07-17 22:48:57,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:48:57,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:48:57,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:48:57,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:48:57,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:57" (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:48:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:48:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:48:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:48:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:48:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:48:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:48:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:48:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:48:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:48:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:48:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:48:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:48:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:48:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:48:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:48:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:48:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:48:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:48:57,906 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:48:57,907 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:48:57,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:57 BoogieIcfgContainer [2020-07-17 22:48:57,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:48:57,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:48:57,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:48:57,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:48:57,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:48:56" (1/3) ... [2020-07-17 22:48:57,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64323bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:57, skipping insertion in model container [2020-07-17 22:48:57,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:57" (2/3) ... [2020-07-17 22:48:57,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64323bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:57, skipping insertion in model container [2020-07-17 22:48:57,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:57" (3/3) ... [2020-07-17 22:48:57,920 INFO L109 eAbstractionObserver]: Analyzing ICFG condmf.c [2020-07-17 22:48:57,933 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:48:57,942 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:48:57,957 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:48:57,981 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:48:57,982 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:48:57,982 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:48:57,982 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:48:57,982 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:48:57,982 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:48:57,983 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:48:57,983 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:48:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-17 22:48:58,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:48:58,007 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:58,008 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] [2020-07-17 22:48:58,008 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:58,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:58,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1524373234, now seen corresponding path program 1 times [2020-07-17 22:48:58,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:58,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705144666] [2020-07-17 22:48:58,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:58,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#(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; {38#true} is VALID [2020-07-17 22:48:58,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:48:58,263 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-17 22:48:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:58,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-17 22:48:58,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-17 22:48:58,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-17 22:48:58,279 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-17 22:48:58,287 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(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:48:58,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(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; {38#true} is VALID [2020-07-17 22:48:58,288 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:48:58,289 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-17 22:48:58,289 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret8 := main(); {38#true} is VALID [2020-07-17 22:48:58,290 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {38#true} is VALID [2020-07-17 22:48:58,290 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~N~0 <= 0); {38#true} is VALID [2020-07-17 22:48:58,291 INFO L263 TraceCheckUtils]: 7: Hoare triple {38#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {38#true} is VALID [2020-07-17 22:48:58,291 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-17 22:48:58,292 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-17 22:48:58,293 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-17 22:48:58,293 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-17 22:48:58,294 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {39#false} is VALID [2020-07-17 22:48:58,294 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-17 22:48:58,295 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-17 22:48:58,295 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-17 22:48:58,295 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-17 22:48:58,296 INFO L280 TraceCheckUtils]: 17: Hoare triple {39#false} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {39#false} is VALID [2020-07-17 22:48:58,296 INFO L263 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if (if #t~mem7 < 0 && 0 != #t~mem7 % 2 then #t~mem7 % 2 - 2 else #t~mem7 % 2) == (if ~N~0 < 0 && 0 != ~N~0 % 2 then ~N~0 % 2 - 2 else ~N~0 % 2) then 1 else 0)); {39#false} is VALID [2020-07-17 22:48:58,297 INFO L280 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-17 22:48:58,297 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-17 22:48:58,298 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-17 22:48:58,301 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:48:58,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705144666] [2020-07-17 22:48:58,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:58,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:48:58,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309663309] [2020-07-17 22:48:58,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:48:58,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:58,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:48:58,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:58,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:48:58,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:58,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:48:58,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:48:58,383 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-17 22:48:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,597 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2020-07-17 22:48:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:48:58,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:48:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-17 22:48:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-17 22:48:58,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2020-07-17 22:48:58,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:58,845 INFO L225 Difference]: With dead ends: 60 [2020-07-17 22:48:58,845 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:48:58,854 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:48:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:48:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 22:48:58,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:58,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-17 22:48:58,934 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:48:58,934 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:48:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,942 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:48:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:48:58,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:58,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:58,946 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:48:58,946 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:48:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,954 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:48:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:48:58,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:58,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:58,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:58,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:48:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-17 22:48:58,965 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2020-07-17 22:48:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:58,966 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-17 22:48:58,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:48:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:48:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:48:58,972 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:58,972 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] [2020-07-17 22:48:58,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:48:58,975 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2111179248, now seen corresponding path program 1 times [2020-07-17 22:48:58,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:58,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352710240] [2020-07-17 22:48:58,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#(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; {227#true} is VALID [2020-07-17 22:48:59,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-17 22:48:59,197 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #86#return; {227#true} is VALID [2020-07-17 22:48:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-17 22:48:59,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-17 22:48:59,216 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-17 22:48:59,218 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #82#return; {232#(<= 1 ~N~0)} is VALID [2020-07-17 22:48:59,219 INFO L263 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {238#(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:48:59,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {238#(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; {227#true} is VALID [2020-07-17 22:48:59,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-17 22:48:59,221 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #86#return; {227#true} is VALID [2020-07-17 22:48:59,221 INFO L263 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret8 := main(); {227#true} is VALID [2020-07-17 22:48:59,221 INFO L280 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {227#true} is VALID [2020-07-17 22:48:59,225 INFO L280 TraceCheckUtils]: 6: Hoare triple {227#true} assume !(~N~0 <= 0); {232#(<= 1 ~N~0)} is VALID [2020-07-17 22:48:59,226 INFO L263 TraceCheckUtils]: 7: Hoare triple {232#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {227#true} is VALID [2020-07-17 22:48:59,226 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-17 22:48:59,227 INFO L280 TraceCheckUtils]: 9: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-17 22:48:59,227 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-17 22:48:59,229 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #82#return; {232#(<= 1 ~N~0)} is VALID [2020-07-17 22:48:59,231 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#(<= 1 ~N~0)} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:48:59,232 INFO L280 TraceCheckUtils]: 13: Hoare triple {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-17 22:48:59,232 INFO L280 TraceCheckUtils]: 14: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-17 22:48:59,233 INFO L280 TraceCheckUtils]: 15: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-17 22:48:59,233 INFO L280 TraceCheckUtils]: 16: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-17 22:48:59,233 INFO L280 TraceCheckUtils]: 17: Hoare triple {228#false} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {228#false} is VALID [2020-07-17 22:48:59,234 INFO L263 TraceCheckUtils]: 18: Hoare triple {228#false} call __VERIFIER_assert((if (if #t~mem7 < 0 && 0 != #t~mem7 % 2 then #t~mem7 % 2 - 2 else #t~mem7 % 2) == (if ~N~0 < 0 && 0 != ~N~0 % 2 then ~N~0 % 2 - 2 else ~N~0 % 2) then 1 else 0)); {228#false} is VALID [2020-07-17 22:48:59,234 INFO L280 TraceCheckUtils]: 19: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2020-07-17 22:48:59,239 INFO L280 TraceCheckUtils]: 20: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2020-07-17 22:48:59,239 INFO L280 TraceCheckUtils]: 21: Hoare triple {228#false} assume !false; {228#false} is VALID [2020-07-17 22:48:59,241 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:48:59,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352710240] [2020-07-17 22:48:59,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:59,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:48:59,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227732122] [2020-07-17 22:48:59,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-17 22:48:59,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:59,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:48:59,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:59,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:48:59,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:59,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:48:59,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:48:59,283 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2020-07-17 22:48:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:59,649 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-07-17 22:48:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:48:59,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-17 22:48:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:48:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-17 22:48:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:48:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-17 22:48:59,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-17 22:48:59,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:59,765 INFO L225 Difference]: With dead ends: 54 [2020-07-17 22:48:59,766 INFO L226 Difference]: Without dead ends: 39 [2020-07-17 22:48:59,767 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:48:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-17 22:48:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2020-07-17 22:48:59,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:59,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 32 states. [2020-07-17 22:48:59,798 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 32 states. [2020-07-17 22:48:59,798 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 32 states. [2020-07-17 22:48:59,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:59,804 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-17 22:48:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-17 22:48:59,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:59,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:59,805 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 39 states. [2020-07-17 22:48:59,805 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 39 states. [2020-07-17 22:48:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:59,809 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-17 22:48:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-17 22:48:59,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:59,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:59,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:59,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:48:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-17 22:48:59,813 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2020-07-17 22:48:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:59,814 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-17 22:48:59,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:48:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-17 22:48:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:48:59,815 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:59,815 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] [2020-07-17 22:48:59,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:48:59,816 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash 373909448, now seen corresponding path program 1 times [2020-07-17 22:48:59,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:59,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220574130] [2020-07-17 22:48:59,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:00,067 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:00,068 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:00,068 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:49:00,139 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:00,140 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:00,140 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:00,140 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:00,141 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:00,141 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:00,141 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:00,141 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:00,142 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:00,142 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:00,142 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:00,142 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:00,142 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:00,143 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:00,144 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:00,147 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:00,148 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:00,148 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:00,148 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:00,148 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:00,158 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:00,158 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:00,158 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:00,158 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:00,159 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:00,159 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:00,159 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:00,159 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:00,159 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-17 22:49:00,159 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-17 22:49:00,160 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-17 22:49:00,160 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-17 22:49:00,160 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-17 22:49:00,160 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-17 22:49:00,160 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-17 22:49:00,160 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-17 22:49:00,160 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-17 22:49:00,161 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-17 22:49:00,161 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-17 22:49:00,161 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-17 22:49:00,161 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-17 22:49:00,161 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-17 22:49:00,161 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:49:00,162 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:49:00,162 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2020-07-17 22:49:00,162 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:49:00,162 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:49:00,162 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-17 22:49:00,163 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:00,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:00 BoogieIcfgContainer [2020-07-17 22:49:00,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:00,171 INFO L168 Benchmark]: Toolchain (without parser) took 3380.67 ms. Allocated memory was 144.2 MB in the beginning and 232.8 MB in the end (delta: 88.6 MB). Free memory was 102.3 MB in the beginning and 99.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 91.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:00,173 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 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:00,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.35 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 101.9 MB in the beginning and 180.4 MB in the end (delta: -78.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:00,175 INFO L168 Benchmark]: Boogie Preprocessor took 60.34 ms. Allocated memory is still 201.3 MB. Free memory was 180.4 MB in the beginning and 177.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:00,176 INFO L168 Benchmark]: RCFGBuilder took 539.30 ms. Allocated memory is still 201.3 MB. Free memory was 177.8 MB in the beginning and 152.0 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:00,177 INFO L168 Benchmark]: TraceAbstraction took 2254.18 ms. Allocated memory was 201.3 MB in the beginning and 232.8 MB in the end (delta: 31.5 MB). Free memory was 152.0 MB in the beginning and 99.2 MB in the end (delta: 52.9 MB). Peak memory consumption was 84.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:00,181 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.57 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 516.35 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 101.9 MB in the beginning and 180.4 MB in the end (delta: -78.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.34 ms. Allocated memory is still 201.3 MB. Free memory was 180.4 MB in the beginning and 177.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 539.30 ms. Allocated memory is still 201.3 MB. Free memory was 177.8 MB in the beginning and 152.0 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2254.18 ms. Allocated memory was 201.3 MB in the beginning and 232.8 MB in the end (delta: 31.5 MB). Free memory was 152.0 MB in the beginning and 99.2 MB in the end (delta: 52.9 MB). Peak memory consumption was 84.3 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)=6, 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] int *a = malloc(sizeof(int)*N); [L28] i = 0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L28] COND TRUE i < N [L30] a[i] = 0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L28] i++ VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1] [L28] COND FALSE !(i < N) VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1] [L33] i = 0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L33] COND TRUE i < N VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L35] COND TRUE N%2 == 1 [L37] EXPR a[i] [L37] a[i] = a[i] + 2 [L33] i++ VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1] [L33] COND FALSE !(i < N) VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1] [L45] i = 0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L45] COND TRUE i < N [L47] EXPR a[i] VAL [\old(N)=0, a={-1:0}, a[i]=2, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L47] CALL __VERIFIER_assert(a[i] % 2 == N % 2) VAL [\old(cond)=0, \old(N)=0, N=1] [L13] COND TRUE !(cond) VAL [\old(cond)=0, \old(N)=0, cond=0, N=1] [L13] __VERIFIER_error() VAL [\old(cond)=0, \old(N)=0, cond=0, N=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 57 SDtfs, 52 SDslu, 11 SDs, 0 SdLazy, 84 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 1596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...