/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/modpf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:28,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:28,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:28,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:28,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:28,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:28,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:28,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:28,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:28,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:28,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:28,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:28,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:28,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:28,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:28,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:28,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:28,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:28,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:28,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:28,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:28,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:28,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:28,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:28,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:28,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:28,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:28,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:28,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:28,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:28,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:28,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:28,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:28,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:28,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:28,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:28,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:28,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:28,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:28,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:28,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:28,685 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:26:28,725 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:28,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:28,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:28,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:28,727 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:28,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:28,729 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:28,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:28,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:28,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:28,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:28,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:28,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:28,730 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:28,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:28,730 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:28,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:28,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:28,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:28,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:28,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:28,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:28,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:28,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:28,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:28,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:28,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:28,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:28,735 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:28,735 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:29,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:29,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:29,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:29,020 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:29,020 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:29,021 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/modpf.c [2020-07-10 15:26:29,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3028c9c6/371cd7c58bd54522b7ccbfbeeba79709/FLAG88ac9d454 [2020-07-10 15:26:29,613 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:29,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/modpf.c [2020-07-10 15:26:29,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3028c9c6/371cd7c58bd54522b7ccbfbeeba79709/FLAG88ac9d454 [2020-07-10 15:26:30,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3028c9c6/371cd7c58bd54522b7ccbfbeeba79709 [2020-07-10 15:26:30,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:30,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:30,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:30,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:30,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:30,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:30" (1/1) ... [2020-07-10 15:26:30,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49eb3495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:30, skipping insertion in model container [2020-07-10 15:26:30,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:30" (1/1) ... [2020-07-10 15:26:30,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:30,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:30,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:30,302 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:30,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:30,341 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:30,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:30 WrapperNode [2020-07-10 15:26:30,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:30,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:30,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:30,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:30,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:30" (1/1) ... [2020-07-10 15:26:30,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:30" (1/1) ... [2020-07-10 15:26:30,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:30" (1/1) ... [2020-07-10 15:26:30,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:30" (1/1) ... [2020-07-10 15:26:30,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:30" (1/1) ... [2020-07-10 15:26:30,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:30" (1/1) ... [2020-07-10 15:26:30,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:30" (1/1) ... [2020-07-10 15:26:30,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:30,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:30,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:30,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:30,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:30,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:30,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:30,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:30,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:30,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:30,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:30,533 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:30,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:30,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:30,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:30,534 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:30,534 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:30,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:30,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:30,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:30,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:30,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:30,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:30,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:30,943 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:30,944 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:26:30,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:30 BoogieIcfgContainer [2020-07-10 15:26:30,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:30,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:30,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:30,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:30,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:30" (1/3) ... [2020-07-10 15:26:30,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493acf91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:30, skipping insertion in model container [2020-07-10 15:26:30,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:30" (2/3) ... [2020-07-10 15:26:30,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493acf91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:30, skipping insertion in model container [2020-07-10 15:26:30,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:30" (3/3) ... [2020-07-10 15:26:30,957 INFO L109 eAbstractionObserver]: Analyzing ICFG modpf.c [2020-07-10 15:26:30,967 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:30,975 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:30,990 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:31,012 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:31,013 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:31,013 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:31,013 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:31,013 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:31,013 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:31,013 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:31,014 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:31,031 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-10 15:26:31,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:26:31,038 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:31,039 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-10 15:26:31,040 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:31,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-10 15:26:31,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:31,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082973752] [2020-07-10 15:26:31,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:31,278 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-10 15:26:31,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-10 15:26:31,279 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-10 15:26:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:31,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-10 15:26:31,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-10 15:26:31,295 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-10 15:26:31,295 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-10 15:26:31,297 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-10 15:26:31,298 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-10 15:26:31,298 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-10 15:26:31,299 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-10 15:26:31,299 INFO L263 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret8 := main(); {37#true} is VALID [2020-07-10 15:26:31,299 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-10 15:26:31,300 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} assume !(~N~0 <= 0); {37#true} is VALID [2020-07-10 15:26:31,300 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-10 15:26:31,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-10 15:26:31,302 INFO L280 TraceCheckUtils]: 9: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-10 15:26:31,302 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-10 15:26:31,303 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-10 15:26:31,303 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-10 15:26:31,304 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-10 15:26:31,304 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2020-07-10 15:26:31,304 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-10 15:26:31,305 INFO L280 TraceCheckUtils]: 16: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2020-07-10 15:26:31,305 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-10 15:26:31,306 INFO L263 TraceCheckUtils]: 18: Hoare triple {38#false} call __VERIFIER_assert((if 1 == (if #t~mem7 < 0 && 0 != #t~mem7 % ~N~0 then (if ~N~0 < 0 then #t~mem7 % ~N~0 + ~N~0 else #t~mem7 % ~N~0 - ~N~0) else #t~mem7 % ~N~0) then 1 else 0)); {38#false} is VALID [2020-07-10 15:26:31,306 INFO L280 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2020-07-10 15:26:31,306 INFO L280 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2020-07-10 15:26:31,307 INFO L280 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-10 15:26:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:31,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082973752] [2020-07-10 15:26:31,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:31,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:31,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24682120] [2020-07-10 15:26:31,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:26:31,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:31,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:31,406 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-10 15:26:31,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:31,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:31,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:31,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:31,420 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-10 15:26:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:31,695 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-10 15:26:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:31,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:26:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-10 15:26:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-10 15:26:31,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2020-07-10 15:26:31,847 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-10 15:26:31,860 INFO L225 Difference]: With dead ends: 58 [2020-07-10 15:26:31,860 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 15:26:31,864 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:31,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 15:26:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-10 15:26:31,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:31,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:31,919 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:31,919 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:31,924 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-10 15:26:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-10 15:26:31,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:31,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:31,925 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:31,926 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:31,930 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-10 15:26:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-10 15:26:31,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:31,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:31,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:31,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:26:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-10 15:26:31,936 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-10 15:26:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:31,937 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-10 15:26:31,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-10 15:26:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:26:31,938 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:31,938 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-10 15:26:31,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:31,939 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:31,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:31,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-10 15:26:31,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:31,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118957885] [2020-07-10 15:26:31,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:31,983 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:31,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957201198] [2020-07-10 15:26:31,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:32,051 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:26:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:32,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:32,164 INFO L263 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {221#true} is VALID [2020-07-10 15:26:32,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {221#true} is VALID [2020-07-10 15:26:32,165 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:32,166 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #81#return; {221#true} is VALID [2020-07-10 15:26:32,166 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret8 := main(); {221#true} is VALID [2020-07-10 15:26:32,167 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-10 15:26:32,167 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {244#(< 0 ~N~0)} is VALID [2020-07-10 15:26:32,168 INFO L263 TraceCheckUtils]: 7: Hoare triple {244#(< 0 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {244#(< 0 ~N~0)} is VALID [2020-07-10 15:26:32,169 INFO L280 TraceCheckUtils]: 8: Hoare triple {244#(< 0 ~N~0)} ~cond := #in~cond; {244#(< 0 ~N~0)} is VALID [2020-07-10 15:26:32,170 INFO L280 TraceCheckUtils]: 9: Hoare triple {244#(< 0 ~N~0)} assume !(0 == ~cond); {244#(< 0 ~N~0)} is VALID [2020-07-10 15:26:32,171 INFO L280 TraceCheckUtils]: 10: Hoare triple {244#(< 0 ~N~0)} assume true; {244#(< 0 ~N~0)} is VALID [2020-07-10 15:26:32,172 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {244#(< 0 ~N~0)} {244#(< 0 ~N~0)} #77#return; {244#(< 0 ~N~0)} is VALID [2020-07-10 15:26:32,173 INFO L280 TraceCheckUtils]: 12: Hoare triple {244#(< 0 ~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; {263#(and (<= main_~i~0 0) (< 0 ~N~0))} is VALID [2020-07-10 15:26:32,174 INFO L280 TraceCheckUtils]: 13: Hoare triple {263#(and (<= main_~i~0 0) (< 0 ~N~0))} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-10 15:26:32,175 INFO L280 TraceCheckUtils]: 14: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-10 15:26:32,175 INFO L280 TraceCheckUtils]: 15: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-10 15:26:32,175 INFO L280 TraceCheckUtils]: 16: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-10 15:26:32,176 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-10 15:26:32,176 INFO L263 TraceCheckUtils]: 18: Hoare triple {222#false} call __VERIFIER_assert((if 1 == (if #t~mem7 < 0 && 0 != #t~mem7 % ~N~0 then (if ~N~0 < 0 then #t~mem7 % ~N~0 + ~N~0 else #t~mem7 % ~N~0 - ~N~0) else #t~mem7 % ~N~0) then 1 else 0)); {222#false} is VALID [2020-07-10 15:26:32,176 INFO L280 TraceCheckUtils]: 19: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2020-07-10 15:26:32,177 INFO L280 TraceCheckUtils]: 20: Hoare triple {222#false} assume 0 == ~cond; {222#false} is VALID [2020-07-10 15:26:32,177 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-10 15:26:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:32,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118957885] [2020-07-10 15:26:32,179 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:32,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957201198] [2020-07-10 15:26:32,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:32,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:26:32,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956323223] [2020-07-10 15:26:32,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 15:26:32,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:32,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:26:32,217 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-10 15:26:32,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:26:32,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:32,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:26:32,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:26:32,219 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 4 states. [2020-07-10 15:26:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:32,384 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-07-10 15:26:32,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:26:32,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 15:26:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2020-07-10 15:26:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2020-07-10 15:26:32,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2020-07-10 15:26:32,472 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-10 15:26:32,475 INFO L225 Difference]: With dead ends: 51 [2020-07-10 15:26:32,475 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 15:26:32,476 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:26:32,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 15:26:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-07-10 15:26:32,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:32,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 31 states. [2020-07-10 15:26:32,505 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 31 states. [2020-07-10 15:26:32,505 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 31 states. [2020-07-10 15:26:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:32,510 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-10 15:26:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-10 15:26:32,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:32,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:32,511 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 37 states. [2020-07-10 15:26:32,511 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 37 states. [2020-07-10 15:26:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:32,515 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-10 15:26:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-10 15:26:32,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:32,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:32,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:32,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 15:26:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-10 15:26:32,519 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2020-07-10 15:26:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:32,519 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-10 15:26:32,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:26:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 15:26:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:26:32,521 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:32,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:32,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:26:32,736 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:32,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-10 15:26:32,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:32,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265076629] [2020-07-10 15:26:32,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:32,761 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:32,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935662798] [2020-07-10 15:26:32,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:32,868 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:32,868 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:33,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:33,132 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:33,132 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:33,132 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:33,132 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:33,132 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:33,133 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:33,133 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:33,133 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:33,133 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:33,133 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:33,133 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:33,134 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:33,134 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:33,134 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:33,134 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:33,134 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:33,134 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:33,135 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:33,135 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:33,135 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:33,135 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:33,135 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:33,135 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:33,136 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:33,136 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:33,136 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:33,136 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:33,136 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:33,136 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:33,137 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:33,137 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:33,137 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-10 15:26:33,137 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:26:33,137 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:26:33,137 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-10 15:26:33,137 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:33,138 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:33,138 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:33,138 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-10 15:26:33,138 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-10 15:26:33,138 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-10 15:26:33,138 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:26:33,139 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:26:33,139 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-10 15:26:33,139 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 15:26:33,139 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 15:26:33,139 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:26:33,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:33 BoogieIcfgContainer [2020-07-10 15:26:33,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:33,146 INFO L168 Benchmark]: Toolchain (without parser) took 3113.76 ms. Allocated memory was 138.9 MB in the beginning and 235.9 MB in the end (delta: 97.0 MB). Free memory was 103.7 MB in the beginning and 108.5 MB in the end (delta: -4.7 MB). Peak memory consumption was 92.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:33,147 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:33,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.15 ms. Allocated memory is still 138.9 MB. Free memory was 103.5 MB in the beginning and 92.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:33,149 INFO L168 Benchmark]: Boogie Preprocessor took 121.68 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.5 MB in the beginning and 180.4 MB in the end (delta: -87.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:33,150 INFO L168 Benchmark]: RCFGBuilder took 483.62 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 155.2 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:33,151 INFO L168 Benchmark]: TraceAbstraction took 2193.44 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 155.2 MB in the beginning and 108.5 MB in the end (delta: 46.7 MB). Peak memory consumption was 79.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:33,155 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 309.15 ms. Allocated memory is still 138.9 MB. Free memory was 103.5 MB in the beginning and 92.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.68 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.5 MB in the beginning and 180.4 MB in the end (delta: -87.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 483.62 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 155.2 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2193.44 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 155.2 MB in the beginning and 108.5 MB in the end (delta: 46.7 MB). Peak memory consumption was 79.8 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)=7, 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