./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 007e384484156a98966ed1421b3dd3e5ea133849 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:35:28,283 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:35:28,285 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:35:28,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:35:28,302 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:35:28,303 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:35:28,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:35:28,307 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:35:28,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:35:28,313 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:35:28,315 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:35:28,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:35:28,318 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:35:28,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:35:28,322 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:35:28,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:35:28,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:35:28,333 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:35:28,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:35:28,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:35:28,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:35:28,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:35:28,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:35:28,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:35:28,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:35:28,352 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:35:28,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:35:28,356 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:35:28,357 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:35:28,358 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:35:28,358 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:35:28,359 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:35:28,359 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:35:28,359 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:35:28,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:35:28,361 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:35:28,361 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:35:28,375 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:35:28,376 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:35:28,377 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:35:28,377 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:35:28,378 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:35:28,378 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:35:28,378 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:35:28,378 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:35:28,378 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:35:28,379 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:35:28,379 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:35:28,379 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:35:28,379 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:35:28,379 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:35:28,379 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:35:28,380 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:35:28,381 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:35:28,381 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:35:28,381 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:35:28,382 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:35:28,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:35:28,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:35:28,383 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:35:28,383 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:35:28,383 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:35:28,383 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:35:28,383 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:35:28,384 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 007e384484156a98966ed1421b3dd3e5ea133849 [2019-01-14 15:35:28,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:35:28,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:35:28,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:35:28,443 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:35:28,444 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:35:28,445 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2019-01-14 15:35:28,497 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1063738e/5ce5808516934e9a98254877f6a168b3/FLAG8f75dcdc7 [2019-01-14 15:35:28,953 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:35:28,954 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2019-01-14 15:35:28,968 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1063738e/5ce5808516934e9a98254877f6a168b3/FLAG8f75dcdc7 [2019-01-14 15:35:29,279 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1063738e/5ce5808516934e9a98254877f6a168b3 [2019-01-14 15:35:29,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:35:29,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:35:29,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:35:29,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:35:29,289 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:35:29,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:35:29" (1/1) ... [2019-01-14 15:35:29,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a077fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:29, skipping insertion in model container [2019-01-14 15:35:29,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:35:29" (1/1) ... [2019-01-14 15:35:29,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:35:29,342 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:35:29,765 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:35:29,781 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:35:29,946 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:35:30,002 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:35:30,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:30 WrapperNode [2019-01-14 15:35:30,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:35:30,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:35:30,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:35:30,004 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:35:30,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:30" (1/1) ... [2019-01-14 15:35:30,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:30" (1/1) ... [2019-01-14 15:35:30,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:35:30,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:35:30,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:35:30,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:35:30,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:30" (1/1) ... [2019-01-14 15:35:30,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:30" (1/1) ... [2019-01-14 15:35:30,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:30" (1/1) ... [2019-01-14 15:35:30,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:30" (1/1) ... [2019-01-14 15:35:30,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:30" (1/1) ... [2019-01-14 15:35:30,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:30" (1/1) ... [2019-01-14 15:35:30,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:30" (1/1) ... [2019-01-14 15:35:30,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:35:30,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:35:30,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:35:30,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:35:30,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:35:30,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:35:30,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:35:30,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:35:30,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:35:30,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:35:30,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 15:35:30,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:35:30,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:35:30,836 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:35:30,836 INFO L286 CfgBuilder]: Removed 27 assue(true) statements. [2019-01-14 15:35:30,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:35:30 BoogieIcfgContainer [2019-01-14 15:35:30,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:35:30,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:35:30,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:35:30,841 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:35:30,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:35:29" (1/3) ... [2019-01-14 15:35:30,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4085a4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:35:30, skipping insertion in model container [2019-01-14 15:35:30,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:30" (2/3) ... [2019-01-14 15:35:30,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4085a4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:35:30, skipping insertion in model container [2019-01-14 15:35:30,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:35:30" (3/3) ... [2019-01-14 15:35:30,844 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-memcleanup.i [2019-01-14 15:35:30,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:35:30,860 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-14 15:35:30,875 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-14 15:35:30,904 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:35:30,905 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:35:30,905 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:35:30,905 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:35:30,906 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:35:30,906 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:35:30,906 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:35:30,906 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:35:30,906 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:35:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-01-14 15:35:30,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 15:35:30,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:30,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:30,928 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:30,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:30,933 INFO L82 PathProgramCache]: Analyzing trace with hash 312817904, now seen corresponding path program 1 times [2019-01-14 15:35:30,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:30,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:30,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:30,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:30,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:31,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:31,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 15:35:31,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 15:35:31,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 15:35:31,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 15:35:31,062 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-01-14 15:35:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:31,083 INFO L93 Difference]: Finished difference Result 88 states and 142 transitions. [2019-01-14 15:35:31,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 15:35:31,084 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-14 15:35:31,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:31,092 INFO L225 Difference]: With dead ends: 88 [2019-01-14 15:35:31,092 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 15:35:31,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 15:35:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 15:35:31,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-14 15:35:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 15:35:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-01-14 15:35:31,125 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 10 [2019-01-14 15:35:31,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:31,126 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-14 15:35:31,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 15:35:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-01-14 15:35:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 15:35:31,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:31,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:31,127 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:31,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:31,128 INFO L82 PathProgramCache]: Analyzing trace with hash -222248370, now seen corresponding path program 1 times [2019-01-14 15:35:31,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:31,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:31,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:31,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:31,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:35:31,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:35:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:35:31,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:35:31,219 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 3 states. [2019-01-14 15:35:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:31,298 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2019-01-14 15:35:31,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:35:31,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 15:35:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:31,301 INFO L225 Difference]: With dead ends: 59 [2019-01-14 15:35:31,301 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 15:35:31,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:35:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 15:35:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-14 15:35:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 15:35:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-01-14 15:35:31,309 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2019-01-14 15:35:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:31,309 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-01-14 15:35:31,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:35:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-01-14 15:35:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 15:35:31,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:31,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:31,311 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:31,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:31,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1552758992, now seen corresponding path program 1 times [2019-01-14 15:35:31,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:31,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:31,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:31,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:31,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:31,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:31,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:35:31,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:35:31,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:35:31,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:35:31,457 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 5 states. [2019-01-14 15:35:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:31,726 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2019-01-14 15:35:31,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:35:31,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-01-14 15:35:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:31,728 INFO L225 Difference]: With dead ends: 75 [2019-01-14 15:35:31,728 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 15:35:31,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:35:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 15:35:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-01-14 15:35:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 15:35:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-01-14 15:35:31,735 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 11 [2019-01-14 15:35:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:31,736 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-14 15:35:31,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:35:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-01-14 15:35:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:35:31,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:31,737 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:31,737 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:31,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1017108571, now seen corresponding path program 1 times [2019-01-14 15:35:31,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:31,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:31,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:31,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:31,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:31,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:35:31,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:35:31,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:35:31,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:35:31,819 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 3 states. [2019-01-14 15:35:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:32,028 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2019-01-14 15:35:32,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:35:32,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 15:35:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:32,031 INFO L225 Difference]: With dead ends: 61 [2019-01-14 15:35:32,031 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 15:35:32,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:35:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 15:35:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-14 15:35:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 15:35:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-01-14 15:35:32,044 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 17 [2019-01-14 15:35:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:32,044 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-01-14 15:35:32,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:35:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-01-14 15:35:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 15:35:32,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:32,046 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:32,046 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1805962768, now seen corresponding path program 1 times [2019-01-14 15:35:32,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:32,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:32,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:32,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:32,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 15:35:32,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:32,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 15:35:32,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:35:32,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:35:32,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:35:32,324 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2019-01-14 15:35:32,675 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 15:35:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:32,883 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-01-14 15:35:32,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 15:35:32,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-01-14 15:35:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:32,885 INFO L225 Difference]: With dead ends: 83 [2019-01-14 15:35:32,885 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 15:35:32,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-14 15:35:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 15:35:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2019-01-14 15:35:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 15:35:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-01-14 15:35:32,892 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 20 [2019-01-14 15:35:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:32,892 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-01-14 15:35:32,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:35:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-01-14 15:35:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 15:35:32,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:32,899 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:32,899 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:32,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:32,902 INFO L82 PathProgramCache]: Analyzing trace with hash 748807405, now seen corresponding path program 1 times [2019-01-14 15:35:32,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:32,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:32,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:32,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:32,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:33,712 WARN L181 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 48 [2019-01-14 15:35:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:33,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:35:33,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:35:33,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:34,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:35:34,043 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 [2019-01-14 15:35:34,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 15:35:34,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:34,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:34,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 15:35:34,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,200 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 15:35:34,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-01-14 15:35:34,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,366 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2019-01-14 15:35:34,583 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-01-14 15:35:34,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 218 [2019-01-14 15:35:34,618 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 25 treesize of output 28 [2019-01-14 15:35:34,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:34,626 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 28 treesize of output 47 [2019-01-14 15:35:34,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 185 [2019-01-14 15:35:34,670 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 149 [2019-01-14 15:35:34,673 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:34,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2019-01-14 15:35:34,702 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,712 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,738 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,746 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,777 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 433 treesize of output 431 [2019-01-14 15:35:34,785 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 431 treesize of output 429 [2019-01-14 15:35:34,786 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,794 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:34,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 446 treesize of output 130 [2019-01-14 15:35:34,874 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 17 treesize of output 20 [2019-01-14 15:35:34,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:34,881 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 31 [2019-01-14 15:35:34,882 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,896 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:34,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2019-01-14 15:35:34,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:34,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:34,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:34,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2019-01-14 15:35:34,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:34,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:34,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:35,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 93 [2019-01-14 15:35:35,023 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2019-01-14 15:35:35,140 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:35:35,202 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:35:35,326 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:35:35,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-01-14 15:35:35,448 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:935, output treesize:191 [2019-01-14 15:35:36,846 WARN L181 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-01-14 15:35:37,120 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 15:35:37,415 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 15:35:37,626 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 15:35:37,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2019-01-14 15:35:37,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:37,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2019-01-14 15:35:37,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:37,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2019-01-14 15:35:37,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:37,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:37,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2019-01-14 15:35:37,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2019-01-14 15:35:37,763 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:37,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:37,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2019-01-14 15:35:37,779 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:37,793 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:37,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2019-01-14 15:35:37,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2019-01-14 15:35:37,861 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:37,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:37,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 29 [2019-01-14 15:35:37,914 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2019-01-14 15:35:37,940 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:35:37,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:37,983 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:158, output treesize:4 [2019-01-14 15:35:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:38,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:35:38,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-01-14 15:35:38,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 15:35:38,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 15:35:38,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-01-14 15:35:38,038 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 18 states. [2019-01-14 15:35:39,076 WARN L181 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 15:35:42,061 WARN L181 SmtUtils]: Spent 2.94 s on a formula simplification that was a NOOP. DAG size: 115 [2019-01-14 15:35:44,581 WARN L181 SmtUtils]: Spent 2.45 s on a formula simplification that was a NOOP. DAG size: 149 [2019-01-14 15:35:48,863 WARN L181 SmtUtils]: Spent 4.22 s on a formula simplification that was a NOOP. DAG size: 152 [2019-01-14 15:35:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:49,011 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2019-01-14 15:35:49,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 15:35:49,013 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-01-14 15:35:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:49,014 INFO L225 Difference]: With dead ends: 85 [2019-01-14 15:35:49,014 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 15:35:49,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-01-14 15:35:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 15:35:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 46. [2019-01-14 15:35:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 15:35:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-01-14 15:35:49,029 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 25 [2019-01-14 15:35:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:49,030 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-01-14 15:35:49,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 15:35:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-01-14 15:35:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 15:35:49,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:49,031 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:49,031 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:49,031 INFO L82 PathProgramCache]: Analyzing trace with hash 748099373, now seen corresponding path program 1 times [2019-01-14 15:35:49,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:49,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:49,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:49,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:49,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:49,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:35:49,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:35:49,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:49,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:35:49,607 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 [2019-01-14 15:35:49,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:49,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:49,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 15:35:49,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:49,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:49,684 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 11 treesize of output 4 [2019-01-14 15:35:49,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:49,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 15:35:49,707 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 8 treesize of output 7 [2019-01-14 15:35:49,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:49,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:49,725 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 15:35:49,728 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 [2019-01-14 15:35:49,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:49,730 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:49,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:49,740 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:22 [2019-01-14 15:35:50,988 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 189 DAG size of output: 71 [2019-01-14 15:35:51,018 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 257 treesize of output 116 [2019-01-14 15:35:51,025 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 76 treesize of output 75 [2019-01-14 15:35:51,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:51,050 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:35:51,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 142 [2019-01-14 15:35:51,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,073 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 102 treesize of output 181 [2019-01-14 15:35:51,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:51,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:51,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:51,207 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 567 treesize of output 397 [2019-01-14 15:35:51,220 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 25 treesize of output 28 [2019-01-14 15:35:51,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,230 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 28 treesize of output 47 [2019-01-14 15:35:51,230 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:51,246 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:51,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,343 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:35:51,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 396 treesize of output 404 [2019-01-14 15:35:51,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 137 [2019-01-14 15:35:51,401 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:51,441 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:51,469 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:51,519 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:51,528 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:51,596 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 965 treesize of output 268 [2019-01-14 15:35:51,817 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-01-14 15:35:51,820 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 25 treesize of output 28 [2019-01-14 15:35:51,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,870 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 28 treesize of output 47 [2019-01-14 15:35:51,871 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:51,921 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:51,960 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 133 [2019-01-14 15:35:51,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 94 [2019-01-14 15:35:51,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:51,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 157 [2019-01-14 15:35:51,995 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,019 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,045 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,071 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,109 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 148 treesize of output 137 [2019-01-14 15:35:52,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:52,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:52,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:52,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 94 [2019-01-14 15:35:52,122 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,156 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,206 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:2667, output treesize:131 [2019-01-14 15:35:52,442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 116 [2019-01-14 15:35:52,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:52,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:52,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:52,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 52 [2019-01-14 15:35:52,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,554 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2019-01-14 15:35:52,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:52,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:35:52,629 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 71 treesize of output 57 [2019-01-14 15:35:52,646 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 53 treesize of output 30 [2019-01-14 15:35:52,646 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-14 15:35:52,715 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,729 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 15 treesize of output 11 [2019-01-14 15:35:52,731 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 [2019-01-14 15:35:52,731 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,733 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:52,738 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:148, output treesize:3 [2019-01-14 15:35:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:52,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:35:52,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-01-14 15:35:52,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 15:35:52,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 15:35:52,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-01-14 15:35:52,762 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 18 states. [2019-01-14 15:35:53,525 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-14 15:35:53,806 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-01-14 15:35:54,201 WARN L181 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 127 [2019-01-14 15:35:54,449 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-01-14 15:35:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:54,543 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-01-14 15:35:54,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 15:35:54,544 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-01-14 15:35:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:54,546 INFO L225 Difference]: With dead ends: 70 [2019-01-14 15:35:54,546 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 15:35:54,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-01-14 15:35:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 15:35:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2019-01-14 15:35:54,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 15:35:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-01-14 15:35:54,558 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 25 [2019-01-14 15:35:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:54,559 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-01-14 15:35:54,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 15:35:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-01-14 15:35:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 15:35:54,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:54,560 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:54,560 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:54,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:54,560 INFO L82 PathProgramCache]: Analyzing trace with hash 49019818, now seen corresponding path program 1 times [2019-01-14 15:35:54,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:54,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:54,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:54,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:54,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:35:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:35:54,636 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:35:54,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:35:54 BoogieIcfgContainer [2019-01-14 15:35:54,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:35:54,684 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:35:54,684 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:35:54,684 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:35:54,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:35:30" (3/4) ... [2019-01-14 15:35:54,689 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 15:35:54,751 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:35:54,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:35:54,755 INFO L168 Benchmark]: Toolchain (without parser) took 25471.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 272.1 MB). Free memory was 952.7 MB in the beginning and 986.9 MB in the end (delta: -34.2 MB). Peak memory consumption was 237.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:35:54,755 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:35:54,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -193.6 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:35:54,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:35:54,756 INFO L168 Benchmark]: Boogie Preprocessor took 40.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:35:54,764 INFO L168 Benchmark]: RCFGBuilder took 734.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:35:54,765 INFO L168 Benchmark]: TraceAbstraction took 23845.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.8 MB). Free memory was 1.1 GB in the beginning and 986.9 MB in the end (delta: 114.6 MB). Peak memory consumption was 218.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:35:54,765 INFO L168 Benchmark]: Witness Printer took 67.48 ms. Allocated memory is still 1.3 GB. Free memory is still 986.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:35:54,773 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 717.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -193.6 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 734.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23845.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.8 MB). Free memory was 1.1 GB in the beginning and 986.9 MB in the end (delta: 114.6 MB). Peak memory consumption was 218.4 MB. Max. memory is 11.5 GB. * Witness Printer took 67.48 ms. Allocated memory is still 1.3 GB. Free memory is still 986.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L574] struct node *nodelast = ((void *)0); [L575] struct node *node = ((void *)0); [L576] COND TRUE __VERIFIER_nondet_int() [L577] node = malloc(sizeof *node) [L578] COND FALSE !(!node) [L580] node->left = ((void *)0) [L581] node->right = nodelast [L582] COND FALSE !(\read(*nodelast)) [L584] int value = __VERIFIER_nondet_int(); [L585] node->value = value [L586] nodelast = node [L576] COND FALSE !(__VERIFIER_nondet_int()) [L588] COND TRUE node != ((void *)0) [L589] node->parent = ((void *)0) [L590] COND TRUE node != ((void *)0) [L591] node->left = malloc(sizeof *node) [L592] COND FALSE !(!node) [L594] EXPR node->left [L594] node->left->left = ((void *)0) [L595] EXPR node->left [L595] node->left->right = ((void *)0) [L596] EXPR node->left [L596] node->left->value = 42 [L597] EXPR node->left [L597] node->left->parent = node [L598] EXPR node->right [L598] node = node->right [L590] COND FALSE !(node != ((void *)0)) [L600] return nodelast; [L621] struct node *data = create_tree(); [L622] COND FALSE !(!data) [L564] COND FALSE !(!(node)) [L565] COND TRUE node != ((void *)0) [L566] node->left [L566] COND TRUE node->left [L567] EXPR node->left [L567] EXPR node->left->value [L567] COND FALSE !(!(node->left->value == 42)) [L568] EXPR node->value [L568] COND TRUE !(node->value) [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 3 error locations. UNSAFE Result, 23.7s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 13.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 212 SDtfs, 451 SDslu, 571 SDs, 0 SdLazy, 553 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 65 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 160 ConstructedInterpolants, 7 QuantifiedInterpolants, 96409 SizeOfPredicates, 32 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 13/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...