/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-fpi/s3iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:30,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:30,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:30,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:30,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:30,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:30,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:30,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:30,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:30,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:30,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:30,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:30,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:30,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:30,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:30,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:30,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:30,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:30,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:30,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:30,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:30,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:30,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:30,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:30,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:30,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:30,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:30,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:30,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:30,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:30,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:30,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:30,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:30,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:30,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:30,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:30,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:30,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:30,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:30,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:30,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:30,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:30,623 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:30,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:30,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:30,626 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:30,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:30,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:30,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:30,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:30,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:30,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:30,628 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:30,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:30,628 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:30,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:30,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:30,629 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:30,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:30,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:30,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:30,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:30,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:30,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:30,632 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:30,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:30,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:30,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:30,982 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:30,983 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:30,983 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s3iff.c [2020-07-10 20:21:31,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b94a9b3b/9975f8a3e0ea4aebaa57088119824ab3/FLAGaef7ec534 [2020-07-10 20:21:31,495 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:31,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s3iff.c [2020-07-10 20:21:31,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b94a9b3b/9975f8a3e0ea4aebaa57088119824ab3/FLAGaef7ec534 [2020-07-10 20:21:31,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b94a9b3b/9975f8a3e0ea4aebaa57088119824ab3 [2020-07-10 20:21:31,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:31,530 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:31,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:31,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:31,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:31,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:31" (1/1) ... [2020-07-10 20:21:31,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b2c4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:31, skipping insertion in model container [2020-07-10 20:21:31,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:31" (1/1) ... [2020-07-10 20:21:31,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:31,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:31,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:31,775 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:31,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:31,820 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:31,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:31 WrapperNode [2020-07-10 20:21:31,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:31,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:31,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:31,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:31,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:31" (1/1) ... [2020-07-10 20:21:31,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:31" (1/1) ... [2020-07-10 20:21:31,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:31" (1/1) ... [2020-07-10 20:21:31,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:31" (1/1) ... [2020-07-10 20:21:31,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:31" (1/1) ... [2020-07-10 20:21:31,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:31" (1/1) ... [2020-07-10 20:21:31,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:31" (1/1) ... [2020-07-10 20:21:31,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:31,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:31,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:31,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:31,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:31" (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 20:21:32,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:32,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:32,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:32,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:32,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:32,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:32,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:32,596 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:32,597 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 20:21:32,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:32 BoogieIcfgContainer [2020-07-10 20:21:32,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:32,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:32,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:32,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:32,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:31" (1/3) ... [2020-07-10 20:21:32,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfeb03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:32, skipping insertion in model container [2020-07-10 20:21:32,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:31" (2/3) ... [2020-07-10 20:21:32,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfeb03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:32, skipping insertion in model container [2020-07-10 20:21:32,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:32" (3/3) ... [2020-07-10 20:21:32,616 INFO L109 eAbstractionObserver]: Analyzing ICFG s3iff.c [2020-07-10 20:21:32,628 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:32,634 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:32,645 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:32,665 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:32,665 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:32,666 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:32,666 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:32,666 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:32,666 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:32,666 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:32,666 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-10 20:21:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:21:32,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:32,695 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] [2020-07-10 20:21:32,695 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:32,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:32,702 INFO L82 PathProgramCache]: Analyzing trace with hash 171473808, now seen corresponding path program 1 times [2020-07-10 20:21:32,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:32,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1656930155] [2020-07-10 20:21:32,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:32,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {80#(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; {68#true} is VALID [2020-07-10 20:21:32,990 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-10 20:21:32,990 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-10 20:21:32,991 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} ~N~0 := 0; {68#true} is VALID [2020-07-10 20:21:32,991 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-10 20:21:32,992 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {68#true} {68#true} #105#return; {68#true} is VALID [2020-07-10 20:21:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:33,003 INFO L280 TraceCheckUtils]: 0: Hoare triple {68#true} ~cond := #in~cond; {68#true} is VALID [2020-07-10 20:21:33,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} assume !(0 == ~cond); {68#true} is VALID [2020-07-10 20:21:33,004 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-10 20:21:33,005 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #101#return; {68#true} is VALID [2020-07-10 20:21:33,007 INFO L263 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {80#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:33,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {80#(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; {68#true} is VALID [2020-07-10 20:21:33,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-10 20:21:33,009 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-10 20:21:33,009 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} ~N~0 := 0; {68#true} is VALID [2020-07-10 20:21:33,010 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-10 20:21:33,010 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {68#true} {68#true} #105#return; {68#true} is VALID [2020-07-10 20:21:33,011 INFO L263 TraceCheckUtils]: 7: Hoare triple {68#true} call #t~ret10 := main(); {68#true} is VALID [2020-07-10 20:21:33,011 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {68#true} is VALID [2020-07-10 20:21:33,012 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#true} ~N~0 := #t~nondet0; {68#true} is VALID [2020-07-10 20:21:33,012 INFO L280 TraceCheckUtils]: 10: Hoare triple {68#true} havoc #t~nondet0; {68#true} is VALID [2020-07-10 20:21:33,013 INFO L280 TraceCheckUtils]: 11: Hoare triple {68#true} assume !(~N~0 <= 0); {68#true} is VALID [2020-07-10 20:21:33,013 INFO L263 TraceCheckUtils]: 12: Hoare triple {68#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {68#true} is VALID [2020-07-10 20:21:33,014 INFO L280 TraceCheckUtils]: 13: Hoare triple {68#true} ~cond := #in~cond; {68#true} is VALID [2020-07-10 20:21:33,014 INFO L280 TraceCheckUtils]: 14: Hoare triple {68#true} assume !(0 == ~cond); {68#true} is VALID [2020-07-10 20:21:33,015 INFO L280 TraceCheckUtils]: 15: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-10 20:21:33,015 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {68#true} {68#true} #101#return; {68#true} is VALID [2020-07-10 20:21:33,016 INFO L280 TraceCheckUtils]: 17: Hoare triple {68#true} havoc ~i~0; {68#true} is VALID [2020-07-10 20:21:33,016 INFO L280 TraceCheckUtils]: 18: Hoare triple {68#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {68#true} is VALID [2020-07-10 20:21:33,017 INFO L280 TraceCheckUtils]: 19: Hoare triple {68#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {68#true} is VALID [2020-07-10 20:21:33,017 INFO L280 TraceCheckUtils]: 20: Hoare triple {68#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {68#true} is VALID [2020-07-10 20:21:33,018 INFO L280 TraceCheckUtils]: 21: Hoare triple {68#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {68#true} is VALID [2020-07-10 20:21:33,018 INFO L280 TraceCheckUtils]: 22: Hoare triple {68#true} ~i~0 := 0; {68#true} is VALID [2020-07-10 20:21:33,020 INFO L280 TraceCheckUtils]: 23: Hoare triple {68#true} assume !true; {69#false} is VALID [2020-07-10 20:21:33,020 INFO L280 TraceCheckUtils]: 24: Hoare triple {69#false} ~i~0 := 0; {69#false} is VALID [2020-07-10 20:21:33,021 INFO L280 TraceCheckUtils]: 25: Hoare triple {69#false} assume !true; {69#false} is VALID [2020-07-10 20:21:33,021 INFO L280 TraceCheckUtils]: 26: Hoare triple {69#false} SUMMARY for call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L35-6 {69#false} is VALID [2020-07-10 20:21:33,021 INFO L263 TraceCheckUtils]: 27: Hoare triple {69#false} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {69#false} is VALID [2020-07-10 20:21:33,022 INFO L280 TraceCheckUtils]: 28: Hoare triple {69#false} ~cond := #in~cond; {69#false} is VALID [2020-07-10 20:21:33,022 INFO L280 TraceCheckUtils]: 29: Hoare triple {69#false} assume 0 == ~cond; {69#false} is VALID [2020-07-10 20:21:33,023 INFO L280 TraceCheckUtils]: 30: Hoare triple {69#false} assume !false; {69#false} is VALID [2020-07-10 20:21:33,028 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 20:21:33,029 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:33,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1656930155] [2020-07-10 20:21:33,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:33,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:33,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542928791] [2020-07-10 20:21:33,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-10 20:21:33,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:33,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:33,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:33,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:33,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:33,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:33,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:33,119 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2020-07-10 20:21:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:33,515 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2020-07-10 20:21:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:33,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-10 20:21:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-10 20:21:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-10 20:21:33,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-10 20:21:33,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:33,703 INFO L225 Difference]: With dead ends: 113 [2020-07-10 20:21:33,703 INFO L226 Difference]: Without dead ends: 53 [2020-07-10 20:21:33,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 20:21:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-10 20:21:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-10 20:21:33,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:33,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-10 20:21:33,823 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-10 20:21:33,824 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-10 20:21:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:33,832 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-10 20:21:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-10 20:21:33,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:33,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:33,836 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-10 20:21:33,836 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-10 20:21:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:33,845 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-10 20:21:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-10 20:21:33,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:33,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:33,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:33,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-10 20:21:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-07-10 20:21:33,863 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 31 [2020-07-10 20:21:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:33,870 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-07-10 20:21:33,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:33,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 55 transitions. [2020-07-10 20:21:33,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-10 20:21:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:21:33,955 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:33,955 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] [2020-07-10 20:21:33,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:33,955 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:33,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:33,956 INFO L82 PathProgramCache]: Analyzing trace with hash 921692051, now seen corresponding path program 1 times [2020-07-10 20:21:33,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:33,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2007831953] [2020-07-10 20:21:33,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:34,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {535#(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; {521#true} is VALID [2020-07-10 20:21:34,076 INFO L280 TraceCheckUtils]: 1: Hoare triple {521#true} #valid := #valid[0 := 0]; {521#true} is VALID [2020-07-10 20:21:34,077 INFO L280 TraceCheckUtils]: 2: Hoare triple {521#true} assume 0 < #StackHeapBarrier; {521#true} is VALID [2020-07-10 20:21:34,077 INFO L280 TraceCheckUtils]: 3: Hoare triple {521#true} ~N~0 := 0; {521#true} is VALID [2020-07-10 20:21:34,077 INFO L280 TraceCheckUtils]: 4: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-10 20:21:34,077 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {521#true} {521#true} #105#return; {521#true} is VALID [2020-07-10 20:21:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:34,086 INFO L280 TraceCheckUtils]: 0: Hoare triple {521#true} ~cond := #in~cond; {521#true} is VALID [2020-07-10 20:21:34,087 INFO L280 TraceCheckUtils]: 1: Hoare triple {521#true} assume !(0 == ~cond); {521#true} is VALID [2020-07-10 20:21:34,087 INFO L280 TraceCheckUtils]: 2: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-10 20:21:34,088 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {521#true} {529#(<= 1 ~N~0)} #101#return; {529#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:34,090 INFO L263 TraceCheckUtils]: 0: Hoare triple {521#true} call ULTIMATE.init(); {535#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:34,090 INFO L280 TraceCheckUtils]: 1: Hoare triple {535#(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; {521#true} is VALID [2020-07-10 20:21:34,090 INFO L280 TraceCheckUtils]: 2: Hoare triple {521#true} #valid := #valid[0 := 0]; {521#true} is VALID [2020-07-10 20:21:34,091 INFO L280 TraceCheckUtils]: 3: Hoare triple {521#true} assume 0 < #StackHeapBarrier; {521#true} is VALID [2020-07-10 20:21:34,091 INFO L280 TraceCheckUtils]: 4: Hoare triple {521#true} ~N~0 := 0; {521#true} is VALID [2020-07-10 20:21:34,091 INFO L280 TraceCheckUtils]: 5: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-10 20:21:34,092 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {521#true} {521#true} #105#return; {521#true} is VALID [2020-07-10 20:21:34,092 INFO L263 TraceCheckUtils]: 7: Hoare triple {521#true} call #t~ret10 := main(); {521#true} is VALID [2020-07-10 20:21:34,092 INFO L280 TraceCheckUtils]: 8: Hoare triple {521#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {521#true} is VALID [2020-07-10 20:21:34,092 INFO L280 TraceCheckUtils]: 9: Hoare triple {521#true} ~N~0 := #t~nondet0; {521#true} is VALID [2020-07-10 20:21:34,093 INFO L280 TraceCheckUtils]: 10: Hoare triple {521#true} havoc #t~nondet0; {521#true} is VALID [2020-07-10 20:21:34,094 INFO L280 TraceCheckUtils]: 11: Hoare triple {521#true} assume !(~N~0 <= 0); {529#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:34,094 INFO L263 TraceCheckUtils]: 12: Hoare triple {529#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {521#true} is VALID [2020-07-10 20:21:34,094 INFO L280 TraceCheckUtils]: 13: Hoare triple {521#true} ~cond := #in~cond; {521#true} is VALID [2020-07-10 20:21:34,095 INFO L280 TraceCheckUtils]: 14: Hoare triple {521#true} assume !(0 == ~cond); {521#true} is VALID [2020-07-10 20:21:34,095 INFO L280 TraceCheckUtils]: 15: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-10 20:21:34,096 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {521#true} {529#(<= 1 ~N~0)} #101#return; {529#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:34,097 INFO L280 TraceCheckUtils]: 17: Hoare triple {529#(<= 1 ~N~0)} havoc ~i~0; {529#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:34,098 INFO L280 TraceCheckUtils]: 18: Hoare triple {529#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {529#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:34,098 INFO L280 TraceCheckUtils]: 19: Hoare triple {529#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {529#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:34,099 INFO L280 TraceCheckUtils]: 20: Hoare triple {529#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {529#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:34,100 INFO L280 TraceCheckUtils]: 21: Hoare triple {529#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {529#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:34,101 INFO L280 TraceCheckUtils]: 22: Hoare triple {529#(<= 1 ~N~0)} ~i~0 := 0; {534#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:34,102 INFO L280 TraceCheckUtils]: 23: Hoare triple {534#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {522#false} is VALID [2020-07-10 20:21:34,102 INFO L280 TraceCheckUtils]: 24: Hoare triple {522#false} ~i~0 := 0; {522#false} is VALID [2020-07-10 20:21:34,102 INFO L280 TraceCheckUtils]: 25: Hoare triple {522#false} assume !(~i~0 < ~N~0); {522#false} is VALID [2020-07-10 20:21:34,103 INFO L280 TraceCheckUtils]: 26: Hoare triple {522#false} SUMMARY for call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L35-6 {522#false} is VALID [2020-07-10 20:21:34,103 INFO L263 TraceCheckUtils]: 27: Hoare triple {522#false} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {522#false} is VALID [2020-07-10 20:21:34,103 INFO L280 TraceCheckUtils]: 28: Hoare triple {522#false} ~cond := #in~cond; {522#false} is VALID [2020-07-10 20:21:34,104 INFO L280 TraceCheckUtils]: 29: Hoare triple {522#false} assume 0 == ~cond; {522#false} is VALID [2020-07-10 20:21:34,104 INFO L280 TraceCheckUtils]: 30: Hoare triple {522#false} assume !false; {522#false} is VALID [2020-07-10 20:21:34,105 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 20:21:34,106 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:34,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2007831953] [2020-07-10 20:21:34,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:34,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:34,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859340301] [2020-07-10 20:21:34,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-10 20:21:34,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:34,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:34,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:34,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:34,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:34,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:34,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:34,151 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2020-07-10 20:21:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:34,654 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2020-07-10 20:21:34,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:34,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-10 20:21:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2020-07-10 20:21:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2020-07-10 20:21:34,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2020-07-10 20:21:34,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:34,788 INFO L225 Difference]: With dead ends: 99 [2020-07-10 20:21:34,788 INFO L226 Difference]: Without dead ends: 74 [2020-07-10 20:21:34,790 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:21:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-10 20:21:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2020-07-10 20:21:34,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:34,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 55 states. [2020-07-10 20:21:34,882 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 55 states. [2020-07-10 20:21:34,882 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 55 states. [2020-07-10 20:21:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:34,886 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-10 20:21:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-10 20:21:34,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:34,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:34,888 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 74 states. [2020-07-10 20:21:34,888 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 74 states. [2020-07-10 20:21:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:34,892 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-10 20:21:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-10 20:21:34,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:34,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:34,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:34,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 20:21:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-07-10 20:21:34,897 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 31 [2020-07-10 20:21:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:34,897 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-07-10 20:21:34,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:34,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2020-07-10 20:21:34,979 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 20:21:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-10 20:21:34,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 20:21:34,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:34,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:34,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:34,982 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:34,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:34,982 INFO L82 PathProgramCache]: Analyzing trace with hash -827220298, now seen corresponding path program 1 times [2020-07-10 20:21:34,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:34,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2141833754] [2020-07-10 20:21:34,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:35,020 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:35,021 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 20:21:35,027 INFO L168 Benchmark]: Toolchain (without parser) took 3497.21 ms. Allocated memory was 139.5 MB in the beginning and 243.3 MB in the end (delta: 103.8 MB). Free memory was 103.5 MB in the beginning and 119.6 MB in the end (delta: -16.1 MB). Peak memory consumption was 87.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:35,028 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 139.5 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:35,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.34 ms. Allocated memory is still 139.5 MB. Free memory was 103.3 MB in the beginning and 92.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:35,030 INFO L168 Benchmark]: Boogie Preprocessor took 170.29 ms. Allocated memory was 139.5 MB in the beginning and 206.0 MB in the end (delta: 66.6 MB). Free memory was 92.2 MB in the beginning and 183.6 MB in the end (delta: -91.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:35,031 INFO L168 Benchmark]: RCFGBuilder took 608.97 ms. Allocated memory is still 206.0 MB. Free memory was 182.9 MB in the beginning and 154.5 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:35,032 INFO L168 Benchmark]: TraceAbstraction took 2421.28 ms. Allocated memory was 206.0 MB in the beginning and 243.3 MB in the end (delta: 37.2 MB). Free memory was 153.9 MB in the beginning and 119.6 MB in the end (delta: 34.3 MB). Peak memory consumption was 71.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:35,036 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.15 ms. Allocated memory is still 139.5 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 290.34 ms. Allocated memory is still 139.5 MB. Free memory was 103.3 MB in the beginning and 92.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 170.29 ms. Allocated memory was 139.5 MB in the beginning and 206.0 MB in the end (delta: 66.6 MB). Free memory was 92.2 MB in the beginning and 183.6 MB in the end (delta: -91.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 608.97 ms. Allocated memory is still 206.0 MB. Free memory was 182.9 MB in the beginning and 154.5 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2421.28 ms. Allocated memory was 206.0 MB in the beginning and 243.3 MB in the end (delta: 37.2 MB). Free memory was 153.9 MB in the beginning and 119.6 MB in the end (delta: 34.3 MB). Peak memory consumption was 71.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...