/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/modnf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:16,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:16,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:16,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:16,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:16,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:16,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:16,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:16,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:16,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:16,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:16,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:16,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:16,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:16,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:16,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:16,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:16,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:16,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:16,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:16,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:16,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:16,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:16,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:16,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:16,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:16,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:16,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:16,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:16,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:16,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:16,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:16,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:16,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:16,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:16,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:16,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:16,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:16,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:16,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:16,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:16,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:49:16,368 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:16,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:16,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:16,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:16,371 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:16,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:16,372 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:16,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:16,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:16,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:16,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:16,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:16,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:16,374 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:16,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:16,375 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:16,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:16,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:16,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:16,375 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:16,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:16,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:16,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:16,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:16,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:16,377 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:16,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:16,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:16,377 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:16,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:16,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:16,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:16,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:16,660 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:16,660 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:16,661 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/modnf.c [2020-07-17 22:49:16,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e162442/443688dd4005469fbe10f053e202e14e/FLAGcb6e72923 [2020-07-17 22:49:17,273 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:17,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/modnf.c [2020-07-17 22:49:17,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e162442/443688dd4005469fbe10f053e202e14e/FLAGcb6e72923 [2020-07-17 22:49:17,618 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e162442/443688dd4005469fbe10f053e202e14e [2020-07-17 22:49:17,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:17,630 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:17,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:17,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:17,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:17,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:17" (1/1) ... [2020-07-17 22:49:17,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69fe8523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:17, skipping insertion in model container [2020-07-17 22:49:17,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:17" (1/1) ... [2020-07-17 22:49:17,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:17,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:17,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:17,869 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:17,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:17,925 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:17,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:17 WrapperNode [2020-07-17 22:49:17,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:17,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:17,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:17,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:18,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:17" (1/1) ... [2020-07-17 22:49:18,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:17" (1/1) ... [2020-07-17 22:49:18,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:17" (1/1) ... [2020-07-17 22:49:18,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:17" (1/1) ... [2020-07-17 22:49:18,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:17" (1/1) ... [2020-07-17 22:49:18,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:17" (1/1) ... [2020-07-17 22:49:18,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:17" (1/1) ... [2020-07-17 22:49:18,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:18,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:18,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:18,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:18,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:18,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:18,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:18,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:18,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:18,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:49:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:18,591 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:18,592 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:49:18,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:18 BoogieIcfgContainer [2020-07-17 22:49:18,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:18,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:18,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:18,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:18,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:17" (1/3) ... [2020-07-17 22:49:18,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7ce83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:18, skipping insertion in model container [2020-07-17 22:49:18,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:17" (2/3) ... [2020-07-17 22:49:18,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7ce83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:18, skipping insertion in model container [2020-07-17 22:49:18,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:18" (3/3) ... [2020-07-17 22:49:18,605 INFO L109 eAbstractionObserver]: Analyzing ICFG modnf.c [2020-07-17 22:49:18,617 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:18,636 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:18,651 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:18,677 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:18,677 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:18,678 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:18,678 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:18,678 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:18,678 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:18,679 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:18,679 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-17 22:49:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:18,707 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:18,708 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:49:18,708 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:18,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:18,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-17 22:49:18,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:18,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272762380] [2020-07-17 22:49:18,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:18,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(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; {37#true} is VALID [2020-07-17 22:49:18,971 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-17 22:49:18,972 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-17 22:49:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:18,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-17 22:49:18,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-17 22:49:18,989 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-17 22:49:18,989 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-17 22:49:18,991 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:18,992 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(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; {37#true} is VALID [2020-07-17 22:49:18,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-17 22:49:18,993 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-17 22:49:18,993 INFO L263 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret8 := main(); {37#true} is VALID [2020-07-17 22:49:18,994 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {37#true} is VALID [2020-07-17 22:49:18,994 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} assume !(~N~0 <= 0); {37#true} is VALID [2020-07-17 22:49:18,995 INFO L263 TraceCheckUtils]: 7: Hoare triple {37#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {37#true} is VALID [2020-07-17 22:49:18,995 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-17 22:49:18,997 INFO L280 TraceCheckUtils]: 9: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-17 22:49:18,997 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-17 22:49:18,998 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-17 22:49:18,998 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4);~i~0 := 0; {38#false} is VALID [2020-07-17 22:49:18,999 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-17 22:49:18,999 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2020-07-17 22:49:19,000 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-17 22:49:19,000 INFO L280 TraceCheckUtils]: 16: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2020-07-17 22:49:19,001 INFO L280 TraceCheckUtils]: 17: Hoare triple {38#false} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {38#false} is VALID [2020-07-17 22:49:19,001 INFO L263 TraceCheckUtils]: 18: Hoare triple {38#false} call __VERIFIER_assert((if 1 == #t~mem7 then 1 else 0)); {38#false} is VALID [2020-07-17 22:49:19,002 INFO L280 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2020-07-17 22:49:19,002 INFO L280 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2020-07-17 22:49:19,003 INFO L280 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-17 22:49:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:19,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272762380] [2020-07-17 22:49:19,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:19,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:19,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312908977] [2020-07-17 22:49:19,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:19,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:19,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:19,076 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:49:19,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:19,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:19,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:19,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:19,090 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-17 22:49:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:19,313 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-17 22:49:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:19,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-17 22:49:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-17 22:49:19,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2020-07-17 22:49:19,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:19,482 INFO L225 Difference]: With dead ends: 58 [2020-07-17 22:49:19,483 INFO L226 Difference]: Without dead ends: 29 [2020-07-17 22:49:19,492 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-17 22:49:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-17 22:49:19,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:19,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:19,574 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:19,574 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:19,579 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:49:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:49:19,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:19,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:19,580 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:19,581 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:19,585 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:49:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:49:19,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:19,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:19,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:19,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:49:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-17 22:49:19,591 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-17 22:49:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:19,592 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-17 22:49:19,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:49:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:19,593 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:19,593 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:49:19,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:19,594 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:19,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-17 22:49:19,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:19,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548732981] [2020-07-17 22:49:19,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:19,741 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#(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; {221#true} is VALID [2020-07-17 22:49:19,741 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:19,742 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {221#true} {221#true} #81#return; {221#true} is VALID [2020-07-17 22:49:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:19,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-17 22:49:19,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-17 22:49:19,752 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:19,753 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #77#return; {226#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:19,755 INFO L263 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:19,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {232#(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; {221#true} is VALID [2020-07-17 22:49:19,755 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:19,756 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #81#return; {221#true} is VALID [2020-07-17 22:49:19,756 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret8 := main(); {221#true} is VALID [2020-07-17 22:49:19,756 INFO L280 TraceCheckUtils]: 5: Hoare triple {221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {221#true} is VALID [2020-07-17 22:49:19,757 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {226#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:19,758 INFO L263 TraceCheckUtils]: 7: Hoare triple {226#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {221#true} is VALID [2020-07-17 22:49:19,758 INFO L280 TraceCheckUtils]: 8: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-17 22:49:19,758 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-17 22:49:19,759 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:19,760 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #77#return; {226#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:19,761 INFO L280 TraceCheckUtils]: 12: Hoare triple {226#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4);~i~0 := 0; {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:49:19,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-17 22:49:19,762 INFO L280 TraceCheckUtils]: 14: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-17 22:49:19,763 INFO L280 TraceCheckUtils]: 15: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-17 22:49:19,763 INFO L280 TraceCheckUtils]: 16: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-17 22:49:19,763 INFO L280 TraceCheckUtils]: 17: Hoare triple {222#false} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {222#false} is VALID [2020-07-17 22:49:19,764 INFO L263 TraceCheckUtils]: 18: Hoare triple {222#false} call __VERIFIER_assert((if 1 == #t~mem7 then 1 else 0)); {222#false} is VALID [2020-07-17 22:49:19,764 INFO L280 TraceCheckUtils]: 19: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2020-07-17 22:49:19,764 INFO L280 TraceCheckUtils]: 20: Hoare triple {222#false} assume 0 == ~cond; {222#false} is VALID [2020-07-17 22:49:19,765 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-17 22:49:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:19,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548732981] [2020-07-17 22:49:19,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:19,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:49:19,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256190697] [2020-07-17 22:49:19,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-17 22:49:19,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:19,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:19,802 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:49:19,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:19,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:19,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:19,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:19,803 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2020-07-17 22:49:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:20,098 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-07-17 22:49:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:49:20,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-17 22:49:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-17 22:49:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-17 22:49:20,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2020-07-17 22:49:20,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:20,183 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:49:20,183 INFO L226 Difference]: Without dead ends: 37 [2020-07-17 22:49:20,184 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:49:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-17 22:49:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-07-17 22:49:20,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:20,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 31 states. [2020-07-17 22:49:20,211 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 31 states. [2020-07-17 22:49:20,211 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 31 states. [2020-07-17 22:49:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:20,216 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-17 22:49:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-17 22:49:20,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:20,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:20,217 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 37 states. [2020-07-17 22:49:20,217 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 37 states. [2020-07-17 22:49:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:20,221 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-17 22:49:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-17 22:49:20,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:20,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:20,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:20,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:49:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-17 22:49:20,225 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2020-07-17 22:49:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:20,225 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-17 22:49:20,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-17 22:49:20,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:49:20,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:20,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:20,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:49:20,227 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:20,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-17 22:49:20,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:20,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501445138] [2020-07-17 22:49:20,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:20,246 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:20,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1472778998] [2020-07-17 22:49:20,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:20,351 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:20,351 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:20,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:49:20,604 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:20,605 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:20,605 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:20,605 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:20,605 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:20,605 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:20,605 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:20,605 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:20,606 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:20,606 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:20,606 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:20,606 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:20,606 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:20,606 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:20,607 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:20,607 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:20,607 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:20,607 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:20,607 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:20,607 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:20,608 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:20,608 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:20,608 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:20,608 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:20,608 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:20,609 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:20,609 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:20,609 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:20,609 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:20,609 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:20,609 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:20,610 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-17 22:49:20,610 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-17 22:49:20,610 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-17 22:49:20,610 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-17 22:49:20,610 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:20,610 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:20,611 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:20,611 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-17 22:49:20,611 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-17 22:49:20,611 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-17 22:49:20,611 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-17 22:49:20,611 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-17 22:49:20,611 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-17 22:49:20,612 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:49:20,612 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:49:20,612 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:20,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:20 BoogieIcfgContainer [2020-07-17 22:49:20,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:20,618 INFO L168 Benchmark]: Toolchain (without parser) took 2989.25 ms. Allocated memory was 137.4 MB in the beginning and 232.8 MB in the end (delta: 95.4 MB). Free memory was 100.4 MB in the beginning and 99.5 MB in the end (delta: 942.3 kB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:20,619 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 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:20,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.18 ms. Allocated memory is still 137.4 MB. Free memory was 100.0 MB in the beginning and 89.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:20,621 INFO L168 Benchmark]: Boogie Preprocessor took 145.69 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 89.2 MB in the beginning and 179.7 MB in the end (delta: -90.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:20,622 INFO L168 Benchmark]: RCFGBuilder took 523.30 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 155.3 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:20,623 INFO L168 Benchmark]: TraceAbstraction took 2017.51 ms. Allocated memory was 202.4 MB in the beginning and 232.8 MB in the end (delta: 30.4 MB). Free memory was 154.7 MB in the beginning and 99.5 MB in the end (delta: 55.2 MB). Peak memory consumption was 85.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:20,628 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.26 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.18 ms. Allocated memory is still 137.4 MB. Free memory was 100.0 MB in the beginning and 89.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 145.69 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 89.2 MB in the beginning and 179.7 MB in the end (delta: -90.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 523.30 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 155.3 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2017.51 ms. Allocated memory was 202.4 MB in the beginning and 232.8 MB in the end (delta: 30.4 MB). Free memory was 154.7 MB in the beginning and 99.5 MB in the end (delta: 55.2 MB). Peak memory consumption was 85.6 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)=5, 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 sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 0 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L30] COND TRUE i