java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:09:46,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:09:46,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:09:46,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:09:46,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:09:46,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:09:46,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:09:46,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:09:46,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:09:46,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:09:46,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:09:46,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:09:46,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:09:46,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:09:46,057 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:09:46,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:09:46,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:09:46,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:09:46,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:09:46,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:09:46,072 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:09:46,075 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:09:46,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:09:46,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:09:46,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:09:46,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:09:46,083 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:09:46,087 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:09:46,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:09:46,089 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:09:46,090 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:09:46,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:09:46,090 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:09:46,092 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:09:46,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:09:46,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:09:46,095 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:09:46,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:09:46,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:09:46,135 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:09:46,135 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:09:46,136 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:09:46,136 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:09:46,137 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:09:46,138 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:09:46,138 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:09:46,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:09:46,138 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:09:46,138 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:09:46,139 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:09:46,139 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:09:46,139 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:09:46,139 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:09:46,139 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:09:46,141 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:09:46,141 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:09:46,141 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:09:46,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:09:46,142 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:09:46,142 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:09:46,142 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:09:46,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:09:46,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:09:46,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:09:46,144 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:09:46,144 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:09:46,144 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:09:46,144 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:09:46,144 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:09:46,145 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:09:46,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:09:46,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:09:46,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:09:46,248 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:09:46,248 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:09:46,249 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:09:46,312 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fdb4a928/22085a0c5bd84645a60ba5acab6d8a81/FLAGdb1c36384 [2018-11-23 11:09:46,824 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:09:46,824 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:09:46,840 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fdb4a928/22085a0c5bd84645a60ba5acab6d8a81/FLAGdb1c36384 [2018-11-23 11:09:47,134 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fdb4a928/22085a0c5bd84645a60ba5acab6d8a81 [2018-11-23 11:09:47,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:09:47,146 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:09:47,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:09:47,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:09:47,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:09:47,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:47,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bfb5040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47, skipping insertion in model container [2018-11-23 11:09:47,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:47,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:09:47,225 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:09:47,710 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:09:47,732 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:09:47,812 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:09:47,891 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:09:47,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47 WrapperNode [2018-11-23 11:09:47,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:09:47,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:09:47,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:09:47,893 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:09:47,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:48,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:48,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:09:48,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:09:48,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:09:48,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:09:48,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:48,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:48,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:48,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:48,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:48,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:48,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:48,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:09:48,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:09:48,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:09:48,090 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:09:48,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47" (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 [2018-11-23 11:09:48,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:09:48,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:09:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:09:48,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:09:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:09:48,160 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:09:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:09:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:09:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:09:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:09:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:09:48,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:09:50,192 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:09:50,193 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-23 11:09:50,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:09:50 BoogieIcfgContainer [2018-11-23 11:09:50,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:09:50,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:09:50,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:09:50,198 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:09:50,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:09:47" (1/3) ... [2018-11-23 11:09:50,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388258ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:09:50, skipping insertion in model container [2018-11-23 11:09:50,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47" (2/3) ... [2018-11-23 11:09:50,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388258ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:09:50, skipping insertion in model container [2018-11-23 11:09:50,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:09:50" (3/3) ... [2018-11-23 11:09:50,203 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:09:50,214 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:09:50,223 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 11:09:50,241 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 11:09:50,275 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:09:50,275 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:09:50,275 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:09:50,275 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:09:50,276 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:09:50,276 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:09:50,276 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:09:50,276 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:09:50,276 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:09:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-23 11:09:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:09:50,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:09:50,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:09:50,308 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:09:50,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:09:50,315 INFO L82 PathProgramCache]: Analyzing trace with hash -51787873, now seen corresponding path program 1 times [2018-11-23 11:09:50,320 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:09:50,320 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:09:50,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:09:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:50,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:09:50,576 INFO L256 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {43#true} is VALID [2018-11-23 11:09:50,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {43#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {43#true} is VALID [2018-11-23 11:09:50,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2018-11-23 11:09:50,581 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #148#return; {43#true} is VALID [2018-11-23 11:09:50,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret21 := main(); {43#true} is VALID [2018-11-23 11:09:50,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {43#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {43#true} is VALID [2018-11-23 11:09:50,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {43#true} assume !true; {44#false} is VALID [2018-11-23 11:09:50,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {44#false} is VALID [2018-11-23 11:09:50,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-23 11:09:50,584 INFO L273 TraceCheckUtils]: 9: Hoare triple {44#false} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {44#false} is VALID [2018-11-23 11:09:50,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {44#false} assume !false; {44#false} is VALID [2018-11-23 11:09:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:09:50,587 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:09:50,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:09:50,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:09:50,598 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:09:50,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:09:50,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:09:50,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:50,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:09:50,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:09:50,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:09:50,699 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-23 11:09:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:52,883 INFO L93 Difference]: Finished difference Result 73 states and 113 transitions. [2018-11-23 11:09:52,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:09:52,883 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:09:52,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:09:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:09:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2018-11-23 11:09:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:09:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2018-11-23 11:09:52,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 113 transitions. [2018-11-23 11:09:53,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:53,857 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:09:53,858 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:09:53,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:09:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:09:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:09:54,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:09:54,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 11:09:54,012 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:09:54,013 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:09:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:54,018 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 11:09:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 11:09:54,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:54,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:54,020 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:09:54,020 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:09:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:54,025 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 11:09:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 11:09:54,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:54,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:54,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:09:54,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:09:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:09:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 11:09:54,032 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 11 [2018-11-23 11:09:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:09:54,033 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 11:09:54,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:09:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 11:09:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:09:54,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:09:54,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:09:54,035 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:09:54,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:09:54,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1720743077, now seen corresponding path program 1 times [2018-11-23 11:09:54,036 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:09:54,036 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:09:54,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:09:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:54,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:09:54,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2018-11-23 11:09:54,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {273#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {273#true} is VALID [2018-11-23 11:09:54,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2018-11-23 11:09:54,251 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #148#return; {273#true} is VALID [2018-11-23 11:09:54,251 INFO L256 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret21 := main(); {273#true} is VALID [2018-11-23 11:09:54,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {273#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {293#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-23 11:09:54,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {293#(not (= (_ bv0 32) main_~head~0.base))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {293#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-23 11:09:54,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {293#(not (= (_ bv0 32) main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {300#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-23 11:09:54,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {300#(not (= (_ bv0 32) main_~x~0.base))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {300#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-23 11:09:54,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {300#(not (= (_ bv0 32) main_~x~0.base))} assume !((#t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32) && 0bv32 != #t~nondet6);havoc #t~nondet6;havoc #t~mem5.base, #t~mem5.offset; {300#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-23 11:09:54,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {300#(not (= (_ bv0 32) main_~x~0.base))} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {274#false} is VALID [2018-11-23 11:09:54,263 INFO L273 TraceCheckUtils]: 11: Hoare triple {274#false} assume !false; {274#false} is VALID [2018-11-23 11:09:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:09:54,266 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:09:54,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:09:54,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:09:54,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:09:54,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:09:54,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:09:54,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:54,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:09:54,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:09:54,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:09:54,301 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2018-11-23 11:09:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:56,168 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-23 11:09:56,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:09:56,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:09:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:09:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:09:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 11:09:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:09:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 11:09:56,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2018-11-23 11:09:56,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:56,334 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:09:56,334 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:09:56,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:09:56,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:09:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-23 11:09:56,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:09:56,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 38 states. [2018-11-23 11:09:56,360 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 38 states. [2018-11-23 11:09:56,361 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 38 states. [2018-11-23 11:09:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:56,365 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 11:09:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 11:09:56,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:56,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:56,366 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 44 states. [2018-11-23 11:09:56,366 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 44 states. [2018-11-23 11:09:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:56,370 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 11:09:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 11:09:56,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:56,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:56,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:09:56,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:09:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:09:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 11:09:56,375 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 12 [2018-11-23 11:09:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:09:56,375 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 11:09:56,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:09:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 11:09:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:09:56,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:09:56,376 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:09:56,377 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:09:56,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:09:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash -133294861, now seen corresponding path program 1 times [2018-11-23 11:09:56,378 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:09:56,378 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:09:56,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:09:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:56,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:09:56,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 11:09:56,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 11:09:56,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:56,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:56,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-23 11:09:56,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:09:56,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:56,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:56,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-23 11:09:56,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:09:56,860 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:56,901 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:56,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 11:09:56,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 11:09:56,946 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:56,948 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:56,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:09:56,955 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:47, output treesize:9 [2018-11-23 11:09:56,964 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:09:56,964 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_4, v_prenex_1, v_prenex_2, v_prenex_3, |#memory_$Pointer$.base|, v_main_~x~0.base_33, v_main_~x~0.offset_33, |#memory_$Pointer$.offset|]. (or (let ((.cse0 (select (select v_prenex_3 v_prenex_1) v_prenex_2))) (and (= (select (select v_prenex_4 v_prenex_1) v_prenex_2) main_~x~0.base) (not (= (_ bv0 32) .cse0)) (= main_~x~0.offset .cse0))) (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~x~0.base_33) v_main_~x~0.offset_33))) (and (= .cse1 main_~x~0.base) (not (= (_ bv0 32) .cse1)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_33) v_main_~x~0.offset_33))))) [2018-11-23 11:09:56,964 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base))) [2018-11-23 11:09:57,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {523#true} call ULTIMATE.init(); {523#true} is VALID [2018-11-23 11:09:57,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {523#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {523#true} is VALID [2018-11-23 11:09:57,001 INFO L273 TraceCheckUtils]: 2: Hoare triple {523#true} assume true; {523#true} is VALID [2018-11-23 11:09:57,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {523#true} {523#true} #148#return; {523#true} is VALID [2018-11-23 11:09:57,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {523#true} call #t~ret21 := main(); {523#true} is VALID [2018-11-23 11:09:57,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {523#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {523#true} is VALID [2018-11-23 11:09:57,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {523#true} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {523#true} is VALID [2018-11-23 11:09:57,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {523#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {523#true} is VALID [2018-11-23 11:09:57,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {523#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {552#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 11:09:57,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {552#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !!((#t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32) && 0bv32 != #t~nondet6);havoc #t~nondet6;havoc #t~mem5.base, #t~mem5.offset; {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:09:57,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:09:57,005 INFO L273 TraceCheckUtils]: 11: Hoare triple {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} goto; {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:09:57,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} is VALID [2018-11-23 11:09:57,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} is VALID [2018-11-23 11:09:57,006 INFO L273 TraceCheckUtils]: 14: Hoare triple {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} assume !((#t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32) && 0bv32 != #t~nondet6);havoc #t~nondet6;havoc #t~mem5.base, #t~mem5.offset; {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} is VALID [2018-11-23 11:09:57,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {524#false} is VALID [2018-11-23 11:09:57,007 INFO L273 TraceCheckUtils]: 16: Hoare triple {524#false} assume !false; {524#false} is VALID [2018-11-23 11:09:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:09:57,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:09:57,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {524#false} assume !false; {524#false} is VALID [2018-11-23 11:09:57,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {524#false} is VALID [2018-11-23 11:09:57,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} assume !((#t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32) && 0bv32 != #t~nondet6);havoc #t~nondet6;havoc #t~mem5.base, #t~mem5.offset; {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} is VALID [2018-11-23 11:09:57,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} is VALID [2018-11-23 11:09:57,123 INFO L273 TraceCheckUtils]: 12: Hoare triple {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} is VALID [2018-11-23 11:09:57,124 INFO L273 TraceCheckUtils]: 11: Hoare triple {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} goto; {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:09:57,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:09:57,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {600#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))) (and (= |main_#t~mem5.offset| (_ bv0 32)) (= |main_#t~mem5.base| (_ bv0 32))))} assume !!((#t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32) && 0bv32 != #t~nondet6);havoc #t~nondet6;havoc #t~mem5.base, #t~mem5.offset; {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:09:57,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {523#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {600#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))) (and (= |main_#t~mem5.offset| (_ bv0 32)) (= |main_#t~mem5.base| (_ bv0 32))))} is VALID [2018-11-23 11:09:57,128 INFO L273 TraceCheckUtils]: 7: Hoare triple {523#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {523#true} is VALID [2018-11-23 11:09:57,128 INFO L273 TraceCheckUtils]: 6: Hoare triple {523#true} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {523#true} is VALID [2018-11-23 11:09:57,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {523#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {523#true} is VALID [2018-11-23 11:09:57,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {523#true} call #t~ret21 := main(); {523#true} is VALID [2018-11-23 11:09:57,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {523#true} {523#true} #148#return; {523#true} is VALID [2018-11-23 11:09:57,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {523#true} assume true; {523#true} is VALID [2018-11-23 11:09:57,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {523#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {523#true} is VALID [2018-11-23 11:09:57,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {523#true} call ULTIMATE.init(); {523#true} is VALID [2018-11-23 11:09:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:09:57,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:09:57,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:09:57,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 11:09:57,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:09:57,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:09:57,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:57,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:09:57,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:09:57,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:09:57,306 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 6 states. [2018-11-23 11:10:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:03,159 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 11:10:03,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:10:03,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 11:10:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2018-11-23 11:10:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2018-11-23 11:10:03,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2018-11-23 11:10:03,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:03,268 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:10:03,269 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:10:03,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:10:03,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:10:03,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-11-23 11:10:03,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:03,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2018-11-23 11:10:03,291 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2018-11-23 11:10:03,291 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2018-11-23 11:10:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:03,294 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 11:10:03,295 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 11:10:03,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:03,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:03,296 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2018-11-23 11:10:03,296 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2018-11-23 11:10:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:03,299 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 11:10:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 11:10:03,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:03,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:03,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:03,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:10:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-23 11:10:03,302 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2018-11-23 11:10:03,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:03,303 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-23 11:10:03,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:10:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-23 11:10:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:10:03,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:03,304 INFO L402 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] [2018-11-23 11:10:03,304 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:03,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:03,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2080092492, now seen corresponding path program 1 times [2018-11-23 11:10:03,306 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:10:03,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:03,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:03,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 11:10:03,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:10:03,517 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:03,517 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_18|]. (and (= |#valid| (store |v_#valid_18| main_~head~0.base (_ bv1 1))) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:10:03,517 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| main_~head~0.base) (_ bv1 1)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:10:03,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:10:03,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 11:10:03,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-11-23 11:10:03,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:04,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:04,005 INFO L303 Elim1Store]: Index analysis took 134 ms [2018-11-23 11:10:04,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:10:04,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:04,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:04,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 107 [2018-11-23 11:10:05,118 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2018-11-23 11:10:05,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:10:05,160 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-11-23 11:10:05,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 29 [2018-11-23 11:10:05,466 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,584 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,699 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-11-23 11:10:06,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:06,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-11-23 11:10:06,210 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-11-23 11:10:06,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-23 11:10:06,406 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,433 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,461 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,547 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:06,557 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:06,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 11:10:06,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-23 11:10:06,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:06,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 11:10:06,651 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,669 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,701 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:06,741 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:239, output treesize:28 [2018-11-23 11:10:06,942 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:06,943 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_30|, |main_#t~malloc9.base|, |main_#t~malloc9.offset|, |v_#memory_int_37|, main_~x~0.offset, |v_#memory_int_38|, |v_#valid_19|, |v_#memory_int_36|, |v_#memory_int_41|]. (let ((.cse2 (bvadd |main_#t~malloc9.offset| (_ bv4 32)))) (let ((.cse0 (select (select (let ((.cse4 (store |v_#memory_$Pointer$.base_30| main_~head~0.base (store (select |v_#memory_$Pointer$.base_30| main_~head~0.base) main_~head~0.offset |main_#t~malloc9.base|)))) (store .cse4 |main_#t~malloc9.base| (store (select .cse4 |main_#t~malloc9.base|) .cse2 main_~head~0.base))) main_~head~0.base) main_~head~0.offset))) (let ((.cse1 (select |v_#memory_int_37| .cse0)) (.cse3 (select |v_#memory_int_41| main_~head~0.base))) (and (= (_ bv0 1) (select |v_#valid_19| |main_#t~malloc9.base|)) (= (store |v_#memory_int_38| .cse0 (store (select |v_#memory_int_38| .cse0) main_~x~0.offset (select .cse1 main_~x~0.offset))) |v_#memory_int_37|) (= (_ bv0 1) (bvadd (select |v_#valid_19| main_~head~0.base) (_ bv1 1))) (= (store |v_#memory_int_37| .cse0 (store .cse1 (bvadd main_~x~0.offset (_ bv8 32)) (_ bv2 32))) |#memory_int|) (= (store |v_#memory_int_36| |main_#t~malloc9.base| (store (select |v_#memory_int_36| |main_#t~malloc9.base|) .cse2 (select (select |v_#memory_int_38| |main_#t~malloc9.base|) .cse2))) |v_#memory_int_38|) (= |v_#memory_int_36| (store |v_#memory_int_41| main_~head~0.base (store .cse3 main_~head~0.offset (select (select |v_#memory_int_36| main_~head~0.base) main_~head~0.offset)))) (= (bvadd (select .cse3 (bvadd main_~head~0.offset (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))))) [2018-11-23 11:10:06,943 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc9.base|, main_~x~0.offset]. (and (= (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv2 32)) (= (bvadd (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_#t~malloc9.base| main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:10:07,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-23 11:10:07,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-11-23 11:10:07,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-23 11:10:07,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-11-23 11:10:07,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:07,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:28 [2018-11-23 11:10:07,610 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:07,611 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|, |v_#memory_int_39|, |main_#t~malloc9.base|, v_subst_1]. (let ((.cse0 (select |v_#memory_int_42| main_~prev~0.base)) (.cse1 (select |v_#memory_int_39| main_~prev~0.base))) (and (not (= main_~prev~0.base |main_#t~malloc9.base|)) (= |v_#memory_int_39| (store |v_#memory_int_42| main_~prev~0.base (store .cse0 (_ bv0 32) (select .cse1 (_ bv0 32))))) (= (bvadd (select .cse0 (_ bv8 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (bvadd (select (select |v_#memory_int_42| |main_#t~malloc9.base|) (bvadd v_subst_1 (_ bv8 32))) (_ bv4294967294 32))) (= (_ bv0 32) main_~prev~0.offset) (= (store |v_#memory_int_39| main_~prev~0.base (store .cse1 (_ bv4 32) (select (select |#memory_int| main_~prev~0.base) (_ bv4 32)))) |#memory_int|))) [2018-11-23 11:10:07,611 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc9.base|, v_subst_1]. (and (not (= main_~prev~0.base |main_#t~malloc9.base|)) (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~prev~0.base) (_ bv8 32)) (_ bv4294967295 32))) (= (bvadd (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd v_subst_1 (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) main_~prev~0.offset)) [2018-11-23 11:10:07,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-23 11:10:07,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-23 11:10:07,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:10:07,807 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,821 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-11-23 11:10:07,827 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:07,827 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base, |main_#t~malloc9.base|, v_subst_1]. (let ((.cse0 (select (select |#memory_int| main_~x~0.base) (_ bv8 32)))) (and (= main_~t1~0 .cse0) (= (_ bv1 32) .cse0) (not (= |main_#t~malloc9.base| main_~x~0.base)) (= (bvadd (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd v_subst_1 (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) [2018-11-23 11:10:07,827 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 32) main_~t1~0) [2018-11-23 11:10:07,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {795#true} call ULTIMATE.init(); {795#true} is VALID [2018-11-23 11:10:07,853 INFO L273 TraceCheckUtils]: 1: Hoare triple {795#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {795#true} is VALID [2018-11-23 11:10:07,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {795#true} assume true; {795#true} is VALID [2018-11-23 11:10:07,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {795#true} {795#true} #148#return; {795#true} is VALID [2018-11-23 11:10:07,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {795#true} call #t~ret21 := main(); {795#true} is VALID [2018-11-23 11:10:07,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {795#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {815#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:07,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {815#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {815#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:07,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {815#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:07,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:07,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !((#t~mem5.base != 0bv32 || #t~mem5.offset != 0bv32) && 0bv32 != #t~nondet6);havoc #t~nondet6;havoc #t~mem5.base, #t~mem5.offset; {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:07,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:07,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} goto; {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:07,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {838#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:07,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {838#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume #t~mem8.base == 0bv32 && #t~mem8.offset == 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset), 4bv32);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32);call write~intINTTYPE4(2bv32, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32); {842#(and (exists ((|main_#t~malloc9.base| (_ BitVec 32)) (main_~x~0.offset (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= |main_#t~malloc9.base| main_~head~0.base)))) (= (bvadd (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:07,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {842#(and (exists ((|main_#t~malloc9.base| (_ BitVec 32)) (main_~x~0.offset (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= |main_#t~malloc9.base| main_~head~0.base)))) (= (bvadd (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} ~prev~0.base, ~prev~0.offset := 0bv32, 0bv32;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {846#(and (= main_~x~0.offset (_ bv0 32)) (exists ((|main_#t~malloc9.base| (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (and (not (= |main_#t~malloc9.base| main_~x~0.base)) (= (bvadd (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd v_subst_1 (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:07,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {846#(and (= main_~x~0.offset (_ bv0 32)) (exists ((|main_#t~malloc9.base| (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (and (not (= |main_#t~malloc9.base| main_~x~0.base)) (= (bvadd (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd v_subst_1 (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~next~0.base, ~next~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call write~$Pointer$(~prev~0.base, ~prev~0.offset, ~x~0.base, ~x~0.offset, 4bv32);call write~$Pointer$(~next~0.base, ~next~0.offset, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);~prev~0.base, ~prev~0.offset := ~x~0.base, ~x~0.offset;~x~0.base, ~x~0.offset := ~next~0.base, ~next~0.offset; {850#(and (= (_ bv1 32) (select (select |#memory_int| main_~prev~0.base) (_ bv8 32))) (exists ((|main_#t~malloc9.base| (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (and (not (= main_~prev~0.base |main_#t~malloc9.base|)) (= (bvadd (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd v_subst_1 (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (_ bv0 32) main_~prev~0.offset))} is VALID [2018-11-23 11:10:07,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {850#(and (= (_ bv1 32) (select (select |#memory_int| main_~prev~0.base) (_ bv8 32))) (exists ((|main_#t~malloc9.base| (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (and (not (= main_~prev~0.base |main_#t~malloc9.base|)) (= (bvadd (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd v_subst_1 (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (_ bv0 32) main_~prev~0.offset))} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {850#(and (= (_ bv1 32) (select (select |#memory_int| main_~prev~0.base) (_ bv8 32))) (exists ((|main_#t~malloc9.base| (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (and (not (= main_~prev~0.base |main_#t~malloc9.base|)) (= (bvadd (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd v_subst_1 (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (_ bv0 32) main_~prev~0.offset))} is VALID [2018-11-23 11:10:07,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {850#(and (= (_ bv1 32) (select (select |#memory_int| main_~prev~0.base) (_ bv8 32))) (exists ((|main_#t~malloc9.base| (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (and (not (= main_~prev~0.base |main_#t~malloc9.base|)) (= (bvadd (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd v_subst_1 (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (_ bv0 32) main_~prev~0.offset))} ~head~0.base, ~head~0.offset := ~prev~0.base, ~prev~0.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {846#(and (= main_~x~0.offset (_ bv0 32)) (exists ((|main_#t~malloc9.base| (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (and (not (= |main_#t~malloc9.base| main_~x~0.base)) (= (bvadd (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd v_subst_1 (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:07,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {846#(and (= main_~x~0.offset (_ bv0 32)) (exists ((|main_#t~malloc9.base| (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (and (not (= |main_#t~malloc9.base| main_~x~0.base)) (= (bvadd (select (select |#memory_int| |main_#t~malloc9.base|) (bvadd v_subst_1 (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);~t1~0 := #t~mem14;havoc #t~mem14;~t2~0 := 0bv32; {860#(= (_ bv1 32) main_~t1~0)} is VALID [2018-11-23 11:10:07,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {860#(= (_ bv1 32) main_~t1~0)} assume 2bv32 == ~t1~0;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem16 := read~intINTTYPE4(#t~mem15.base, ~bvadd32(8bv32, #t~mem15.offset), 4bv32);~t2~0 := #t~mem16;havoc #t~mem16;havoc #t~mem15.base, #t~mem15.offset; {796#false} is VALID [2018-11-23 11:10:07,912 INFO L273 TraceCheckUtils]: 20: Hoare triple {796#false} assume !(2bv32 != ~t1~0 || 1bv32 == ~t2~0); {796#false} is VALID [2018-11-23 11:10:07,913 INFO L273 TraceCheckUtils]: 21: Hoare triple {796#false} assume !false; {796#false} is VALID [2018-11-23 11:10:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:10:07,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:10,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:10,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:10,176 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:10,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:10,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:10,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:13 [2018-11-23 11:10:13,010 WARN L180 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-11-23 11:10:13,042 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:13,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:13,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 80 [2018-11-23 11:10:13,544 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2018-11-23 11:10:13,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 11:10:13,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:13,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-23 11:10:13,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 16 [2018-11-23 11:10:13,709 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:13,756 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:13,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:13,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 90 [2018-11-23 11:10:14,153 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2018-11-23 11:10:14,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 11:10:14,175 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:14,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2018-11-23 11:10:14,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2018-11-23 11:10:14,342 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:14,408 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:14,476 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:14,873 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:14,902 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:14,910 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:14,938 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:15,069 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:15,079 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:15,290 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:10:15,291 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.classInvariant(MultiDimensionalSelect.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.isCompatibleSelect(MultiDimensionalStore.java:105) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.(MultiDimensionalStore.java:73) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.(MultiDimensionalSelectOverStore.java:48) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.convert(MultiDimensionalSelectOverStore.java:75) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:57) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) 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) [2018-11-23 11:10:15,296 INFO L168 Benchmark]: Toolchain (without parser) took 28150.47 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -154.8 MB). Peak memory consumption was 553.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:15,297 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:10:15,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:15,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.19 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:15,299 INFO L168 Benchmark]: Boogie Preprocessor took 73.72 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:10:15,299 INFO L168 Benchmark]: RCFGBuilder took 2103.93 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:15,300 INFO L168 Benchmark]: TraceAbstraction took 25099.74 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 550.8 MB). Peak memory consumption was 550.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:15,304 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 745.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 122.19 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.72 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 2103.93 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25099.74 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 550.8 MB). Peak memory consumption was 550.8 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.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...