/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/indp3f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:23,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:23,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:23,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:23,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:23,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:23,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:23,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:23,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:23,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:23,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:23,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:23,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:23,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:23,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:23,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:23,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:23,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:23,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:23,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:23,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:23,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:23,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:23,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:23,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:23,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:23,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:23,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:23,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:23,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:23,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:23,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:23,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:23,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:23,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:23,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:23,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:23,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:23,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:23,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:23,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:23,355 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:23,369 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:23,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:23,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:23,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:23,371 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:23,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:23,372 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:23,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:23,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:23,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:23,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:23,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:23,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:23,373 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:23,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:23,373 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:23,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:23,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:23,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:23,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:23,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:23,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:23,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:23,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:23,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:23,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:23,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:23,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:23,376 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:23,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:23,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:23,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:23,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:23,662 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:23,662 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:23,663 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/indp3f.c [2020-07-10 15:26:23,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650ee1f3d/c3ee6f36e6954737ade2667e7541ab0c/FLAG156f16ad9 [2020-07-10 15:26:24,167 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:24,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp3f.c [2020-07-10 15:26:24,174 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650ee1f3d/c3ee6f36e6954737ade2667e7541ab0c/FLAG156f16ad9 [2020-07-10 15:26:24,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650ee1f3d/c3ee6f36e6954737ade2667e7541ab0c [2020-07-10 15:26:24,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:24,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:24,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:24,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:24,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:24,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:24" (1/1) ... [2020-07-10 15:26:24,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dddc299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:24, skipping insertion in model container [2020-07-10 15:26:24,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:24" (1/1) ... [2020-07-10 15:26:24,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:24,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:24,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:24,931 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:24,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:24,971 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:24,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:24 WrapperNode [2020-07-10 15:26:24,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:24,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:24,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:24,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:25,065 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:24" (1/1) ... [2020-07-10 15:26:25,065 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:24" (1/1) ... [2020-07-10 15:26:25,074 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:24" (1/1) ... [2020-07-10 15:26:25,074 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:24" (1/1) ... [2020-07-10 15:26:25,085 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:24" (1/1) ... [2020-07-10 15:26:25,092 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:24" (1/1) ... [2020-07-10 15:26:25,094 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:24" (1/1) ... [2020-07-10 15:26:25,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:25,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:25,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:25,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:25,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:24" (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:25,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:25,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:25,162 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:25,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:25,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:25,588 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:25,588 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-10 15:26:25,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:25 BoogieIcfgContainer [2020-07-10 15:26:25,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:25,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:25,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:25,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:25,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:24" (1/3) ... [2020-07-10 15:26:25,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662686b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:25, skipping insertion in model container [2020-07-10 15:26:25,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:24" (2/3) ... [2020-07-10 15:26:25,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662686b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:25, skipping insertion in model container [2020-07-10 15:26:25,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:25" (3/3) ... [2020-07-10 15:26:25,599 INFO L109 eAbstractionObserver]: Analyzing ICFG indp3f.c [2020-07-10 15:26:25,607 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:25,612 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:25,624 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:25,644 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:25,644 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:25,644 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:25,644 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:25,644 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:25,645 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:25,645 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:25,645 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-10 15:26:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:26:25,666 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:25,666 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:25,667 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:25,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:25,673 INFO L82 PathProgramCache]: Analyzing trace with hash -173101897, now seen corresponding path program 1 times [2020-07-10 15:26:25,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:25,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521501070] [2020-07-10 15:26:25,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:25,903 INFO L280 TraceCheckUtils]: 0: Hoare triple {52#(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; {43#true} is VALID [2020-07-10 15:26:25,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 15:26:25,904 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #109#return; {43#true} is VALID [2020-07-10 15:26:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:25,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-10 15:26:25,914 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-10 15:26:25,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 15:26:25,915 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #105#return; {44#false} is VALID [2020-07-10 15:26:25,918 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {52#(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:25,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {52#(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; {43#true} is VALID [2020-07-10 15:26:25,918 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 15:26:25,919 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #109#return; {43#true} is VALID [2020-07-10 15:26:25,919 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret11 := main(); {43#true} is VALID [2020-07-10 15:26:25,920 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {43#true} is VALID [2020-07-10 15:26:25,920 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#true} assume !(~N~0 <= 0); {43#true} is VALID [2020-07-10 15:26:25,921 INFO L263 TraceCheckUtils]: 7: Hoare triple {43#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {43#true} is VALID [2020-07-10 15:26:25,921 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-10 15:26:25,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-10 15:26:25,923 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 15:26:25,923 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#false} {43#true} #105#return; {44#false} is VALID [2020-07-10 15:26:25,924 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {44#false} is VALID [2020-07-10 15:26:25,924 INFO L280 TraceCheckUtils]: 13: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-10 15:26:25,925 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-10 15:26:25,925 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-10 15:26:25,926 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-10 15:26:25,926 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-10 15:26:25,926 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-10 15:26:25,927 INFO L280 TraceCheckUtils]: 19: Hoare triple {44#false} assume !true; {44#false} is VALID [2020-07-10 15:26:25,927 INFO L280 TraceCheckUtils]: 20: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-10 15:26:25,928 INFO L280 TraceCheckUtils]: 21: Hoare triple {44#false} assume !!(~i~0 < ~N~0);call #t~mem10 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {44#false} is VALID [2020-07-10 15:26:25,928 INFO L263 TraceCheckUtils]: 22: Hoare triple {44#false} call __VERIFIER_assert((if #t~mem10 == 1 + ~i~0 * ~i~0 then 1 else 0)); {44#false} is VALID [2020-07-10 15:26:25,928 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2020-07-10 15:26:25,929 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2020-07-10 15:26:25,929 INFO L280 TraceCheckUtils]: 25: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-10 15:26:25,933 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:25,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521501070] [2020-07-10 15:26:25,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:25,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:25,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859575470] [2020-07-10 15:26:25,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:26:25,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:25,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:26,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:26,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:26,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:26,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:26,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:26,020 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-07-10 15:26:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:26,275 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2020-07-10 15:26:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:26,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:26:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-10 15:26:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-10 15:26:26,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2020-07-10 15:26:26,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:26,491 INFO L225 Difference]: With dead ends: 70 [2020-07-10 15:26:26,491 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:26:26,495 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:26,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:26:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-10 15:26:26,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:26,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-10 15:26:26,556 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 15:26:26,557 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 15:26:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:26,564 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:26:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:26:26,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:26,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:26,567 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 15:26:26,568 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 15:26:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:26,578 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:26:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:26:26,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:26,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:26,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:26,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:26:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-10 15:26:26,591 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2020-07-10 15:26:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:26,591 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-10 15:26:26,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:26:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:26:26,593 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:26,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, 1, 1, 1, 1] [2020-07-10 15:26:26,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:26,594 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:26,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:26,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1503462707, now seen corresponding path program 1 times [2020-07-10 15:26:26,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:26,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783634836] [2020-07-10 15:26:26,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:26,618 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:26,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [13358399] [2020-07-10 15:26:26,619 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:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:26,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:26:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:26,703 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:26,806 INFO L263 TraceCheckUtils]: 0: Hoare triple {263#true} call ULTIMATE.init(); {263#true} is VALID [2020-07-10 15:26:26,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {263#true} is VALID [2020-07-10 15:26:26,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-10 15:26:26,807 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {263#true} {263#true} #109#return; {263#true} is VALID [2020-07-10 15:26:26,807 INFO L263 TraceCheckUtils]: 4: Hoare triple {263#true} call #t~ret11 := main(); {263#true} is VALID [2020-07-10 15:26:26,808 INFO L280 TraceCheckUtils]: 5: Hoare triple {263#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {263#true} is VALID [2020-07-10 15:26:26,810 INFO L280 TraceCheckUtils]: 6: Hoare triple {263#true} assume !(~N~0 <= 0); {286#(< 0 ~N~0)} is VALID [2020-07-10 15:26:26,811 INFO L263 TraceCheckUtils]: 7: Hoare triple {286#(< 0 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {286#(< 0 ~N~0)} is VALID [2020-07-10 15:26:26,812 INFO L280 TraceCheckUtils]: 8: Hoare triple {286#(< 0 ~N~0)} ~cond := #in~cond; {286#(< 0 ~N~0)} is VALID [2020-07-10 15:26:26,813 INFO L280 TraceCheckUtils]: 9: Hoare triple {286#(< 0 ~N~0)} assume !(0 == ~cond); {286#(< 0 ~N~0)} is VALID [2020-07-10 15:26:26,813 INFO L280 TraceCheckUtils]: 10: Hoare triple {286#(< 0 ~N~0)} assume true; {286#(< 0 ~N~0)} is VALID [2020-07-10 15:26:26,814 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {286#(< 0 ~N~0)} {286#(< 0 ~N~0)} #105#return; {286#(< 0 ~N~0)} is VALID [2020-07-10 15:26:26,815 INFO L280 TraceCheckUtils]: 12: Hoare triple {286#(< 0 ~N~0)} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {305#(and (<= main_~i~0 0) (< 0 ~N~0))} is VALID [2020-07-10 15:26:26,816 INFO L280 TraceCheckUtils]: 13: Hoare triple {305#(and (<= main_~i~0 0) (< 0 ~N~0))} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-10 15:26:26,817 INFO L280 TraceCheckUtils]: 14: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-10 15:26:26,817 INFO L280 TraceCheckUtils]: 15: Hoare triple {264#false} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-10 15:26:26,817 INFO L280 TraceCheckUtils]: 16: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-10 15:26:26,817 INFO L280 TraceCheckUtils]: 17: Hoare triple {264#false} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-10 15:26:26,818 INFO L280 TraceCheckUtils]: 18: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-10 15:26:26,818 INFO L280 TraceCheckUtils]: 19: Hoare triple {264#false} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-10 15:26:26,822 INFO L280 TraceCheckUtils]: 20: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-10 15:26:26,823 INFO L280 TraceCheckUtils]: 21: Hoare triple {264#false} assume !!(~i~0 < ~N~0);call #t~mem10 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {264#false} is VALID [2020-07-10 15:26:26,823 INFO L263 TraceCheckUtils]: 22: Hoare triple {264#false} call __VERIFIER_assert((if #t~mem10 == 1 + ~i~0 * ~i~0 then 1 else 0)); {264#false} is VALID [2020-07-10 15:26:26,823 INFO L280 TraceCheckUtils]: 23: Hoare triple {264#false} ~cond := #in~cond; {264#false} is VALID [2020-07-10 15:26:26,823 INFO L280 TraceCheckUtils]: 24: Hoare triple {264#false} assume 0 == ~cond; {264#false} is VALID [2020-07-10 15:26:26,824 INFO L280 TraceCheckUtils]: 25: Hoare triple {264#false} assume !false; {264#false} is VALID [2020-07-10 15:26:26,825 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:26,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783634836] [2020-07-10 15:26:26,826 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:26,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13358399] [2020-07-10 15:26:26,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:26,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:26:26,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537389387] [2020-07-10 15:26:26,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-10 15:26:26,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:26,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:26:26,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:26,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:26:26,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:26,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:26:26,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:26:26,864 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2020-07-10 15:26:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:27,056 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-07-10 15:26:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:26:27,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-10 15:26:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2020-07-10 15:26:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2020-07-10 15:26:27,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2020-07-10 15:26:27,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:27,168 INFO L225 Difference]: With dead ends: 67 [2020-07-10 15:26:27,169 INFO L226 Difference]: Without dead ends: 47 [2020-07-10 15:26:27,170 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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:27,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-10 15:26:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2020-07-10 15:26:27,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:27,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 39 states. [2020-07-10 15:26:27,203 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 39 states. [2020-07-10 15:26:27,203 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 39 states. [2020-07-10 15:26:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:27,208 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-10 15:26:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2020-07-10 15:26:27,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:27,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:27,210 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 47 states. [2020-07-10 15:26:27,210 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 47 states. [2020-07-10 15:26:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:27,216 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-10 15:26:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2020-07-10 15:26:27,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:27,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:27,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:27,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 15:26:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-10 15:26:27,221 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2020-07-10 15:26:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:27,221 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-10 15:26:27,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:26:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-10 15:26:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 15:26:27,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:27,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:27,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:26:27,440 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:27,442 INFO L82 PathProgramCache]: Analyzing trace with hash -260192085, now seen corresponding path program 1 times [2020-07-10 15:26:27,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:27,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516463864] [2020-07-10 15:26:27,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:27,464 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:27,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917811210] [2020-07-10 15:26:27,465 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:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:27,576 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:27,576 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:27,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:27,846 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:27,847 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:27,847 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:27,847 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:27,847 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:27,847 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:27,848 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:27,848 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:27,848 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:27,848 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:27,848 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:27,848 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:27,849 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:27,849 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:27,849 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:27,849 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:27,849 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:27,849 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:27,850 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:27,850 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:27,850 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:27,850 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:27,850 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:27,851 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:27,851 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:27,851 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:27,851 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:27,851 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:27,851 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-10 15:26:27,852 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-10 15:26:27,852 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-10 15:26:27,852 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-10 15:26:27,852 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-10 15:26:27,852 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-10 15:26:27,852 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2020-07-10 15:26:27,853 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-10 15:26:27,853 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-10 15:26:27,853 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-10 15:26:27,853 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-10 15:26:27,853 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-10 15:26:27,853 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-10 15:26:27,854 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-10 15:26:27,854 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-10 15:26:27,854 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2020-07-10 15:26:27,854 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:26:27,854 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:26:27,854 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:27,855 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:27,855 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:27,855 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-10 15:26:27,855 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 15:26:27,855 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-10 15:26:27,855 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-10 15:26:27,855 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-10 15:26:27,856 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2020-07-10 15:26:27,856 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-10 15:26:27,856 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:27,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:27 BoogieIcfgContainer [2020-07-10 15:26:27,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:27,862 INFO L168 Benchmark]: Toolchain (without parser) took 3244.73 ms. Allocated memory was 137.4 MB in the beginning and 231.7 MB in the end (delta: 94.4 MB). Free memory was 101.7 MB in the beginning and 79.9 MB in the end (delta: 21.8 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:27,863 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:27,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.41 ms. Allocated memory is still 137.4 MB. Free memory was 101.5 MB in the beginning and 89.9 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:27,865 INFO L168 Benchmark]: Boogie Preprocessor took 123.50 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 89.9 MB in the beginning and 177.6 MB in the end (delta: -87.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:27,866 INFO L168 Benchmark]: RCFGBuilder took 495.00 ms. Allocated memory is still 200.3 MB. Free memory was 177.6 MB in the beginning and 150.4 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:27,867 INFO L168 Benchmark]: TraceAbstraction took 2266.19 ms. Allocated memory was 200.3 MB in the beginning and 231.7 MB in the end (delta: 31.5 MB). Free memory was 149.7 MB in the beginning and 79.9 MB in the end (delta: 69.8 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:27,871 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.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 354.41 ms. Allocated memory is still 137.4 MB. Free memory was 101.5 MB in the beginning and 89.9 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.50 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 89.9 MB in the beginning and 177.6 MB in the end (delta: -87.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 495.00 ms. Allocated memory is still 200.3 MB. Free memory was 177.6 MB in the beginning and 150.4 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2266.19 ms. Allocated memory was 200.3 MB in the beginning and 231.7 MB in the end (delta: 31.5 MB). Free memory was 149.7 MB in the beginning and 79.9 MB in the end (delta: 69.8 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=4, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L28] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, N=1] [L28] COND TRUE i