./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/forester-heap/sll-01_false-unreach-call_false-valid-deref.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 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-91b1670 [2018-11-28 18:08:52,381 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:08:52,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:08:52,397 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:08:52,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:08:52,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:08:52,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:08:52,402 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:08:52,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:08:52,405 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:08:52,408 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:08:52,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:08:52,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:08:52,413 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:08:52,417 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:08:52,419 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:08:52,422 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:08:52,428 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:08:52,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:08:52,436 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:08:52,437 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:08:52,441 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:08:52,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:08:52,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:08:52,446 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:08:52,447 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:08:52,451 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:08:52,452 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:08:52,453 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:08:52,455 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:08:52,457 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:08:52,458 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:08:52,460 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:08:52,460 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:08:52,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:08:52,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:08:52,462 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:08:52,480 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:08:52,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:08:52,481 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:08:52,481 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:08:52,482 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:08:52,482 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:08:52,482 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:08:52,482 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:08:52,482 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:08:52,483 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:08:52,483 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:08:52,483 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:08:52,483 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:08:52,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:08:52,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:08:52,484 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:08:52,484 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:08:52,484 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:08:52,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:08:52,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:08:52,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:08:52,485 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:08:52,485 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:08:52,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:08:52,485 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:08:52,485 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:08:52,486 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:08:52,486 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:08:52,486 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:08:52,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:08:52,486 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 -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2018-11-28 18:08:52,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:08:52,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:08:52,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:08:52,580 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:08:52,581 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:08:52,582 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-28 18:08:52,646 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c755cfb2/a2824fdd35b4436cb99e5a222e465e5c/FLAG42f9d2e03 [2018-11-28 18:08:53,250 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:08:53,251 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-28 18:08:53,270 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c755cfb2/a2824fdd35b4436cb99e5a222e465e5c/FLAG42f9d2e03 [2018-11-28 18:08:53,481 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c755cfb2/a2824fdd35b4436cb99e5a222e465e5c [2018-11-28 18:08:53,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:08:53,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:08:53,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:08:53,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:08:53,492 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:08:53,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:08:53" (1/1) ... [2018-11-28 18:08:53,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e8a302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:53, skipping insertion in model container [2018-11-28 18:08:53,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:08:53" (1/1) ... [2018-11-28 18:08:53,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:08:53,556 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:08:53,947 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:08:53,961 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:08:54,137 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:08:54,193 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:08:54,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:54 WrapperNode [2018-11-28 18:08:54,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:08:54,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:08:54,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:08:54,195 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:08:54,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:54" (1/1) ... [2018-11-28 18:08:54,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:54" (1/1) ... [2018-11-28 18:08:54,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:08:54,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:08:54,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:08:54,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:08:54,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:54" (1/1) ... [2018-11-28 18:08:54,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:54" (1/1) ... [2018-11-28 18:08:54,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:54" (1/1) ... [2018-11-28 18:08:54,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:54" (1/1) ... [2018-11-28 18:08:54,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:54" (1/1) ... [2018-11-28 18:08:54,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:54" (1/1) ... [2018-11-28 18:08:54,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:54" (1/1) ... [2018-11-28 18:08:54,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:08:54,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:08:54,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:08:54,303 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:08:54,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:08:54,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:08:54,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:08:54,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:08:54,365 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:08:54,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:08:54,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 18:08:54,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 18:08:54,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:08:54,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:08:54,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:08:55,275 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:08:55,275 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-11-28 18:08:55,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:08:55 BoogieIcfgContainer [2018-11-28 18:08:55,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:08:55,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:08:55,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:08:55,283 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:08:55,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:08:53" (1/3) ... [2018-11-28 18:08:55,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227ca946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:08:55, skipping insertion in model container [2018-11-28 18:08:55,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:54" (2/3) ... [2018-11-28 18:08:55,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227ca946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:08:55, skipping insertion in model container [2018-11-28 18:08:55,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:08:55" (3/3) ... [2018-11-28 18:08:55,289 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-11-28 18:08:55,299 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:08:55,309 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-28 18:08:55,327 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-28 18:08:55,358 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:08:55,359 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:08:55,359 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:08:55,359 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:08:55,359 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:08:55,360 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:08:55,360 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:08:55,360 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:08:55,360 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:08:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-11-28 18:08:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 18:08:55,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:55,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:55,391 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:55,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:55,399 INFO L82 PathProgramCache]: Analyzing trace with hash 11196085, now seen corresponding path program 1 times [2018-11-28 18:08:55,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:55,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:55,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:55,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:55,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:55,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:55,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:55,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:55,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:55,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:55,595 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2018-11-28 18:08:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:55,707 INFO L93 Difference]: Finished difference Result 188 states and 306 transitions. [2018-11-28 18:08:55,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:55,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 18:08:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:55,722 INFO L225 Difference]: With dead ends: 188 [2018-11-28 18:08:55,722 INFO L226 Difference]: Without dead ends: 100 [2018-11-28 18:08:55,727 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 [2018-11-28 18:08:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-28 18:08:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-11-28 18:08:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 18:08:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-11-28 18:08:55,787 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 8 [2018-11-28 18:08:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:55,787 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-11-28 18:08:55,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-11-28 18:08:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:08:55,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:55,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:55,791 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:55,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:55,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1909121887, now seen corresponding path program 1 times [2018-11-28 18:08:55,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:55,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:55,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:55,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:55,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:55,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:55,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:55,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:55,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:55,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:55,943 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 3 states. [2018-11-28 18:08:56,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:56,024 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-28 18:08:56,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:56,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-28 18:08:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:56,030 INFO L225 Difference]: With dead ends: 85 [2018-11-28 18:08:56,030 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 18:08:56,031 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 [2018-11-28 18:08:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 18:08:56,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-28 18:08:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 18:08:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-11-28 18:08:56,058 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-11-28 18:08:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:56,059 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-11-28 18:08:56,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-11-28 18:08:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:08:56,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:56,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:56,061 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:56,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:56,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1909123809, now seen corresponding path program 1 times [2018-11-28 18:08:56,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:56,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:56,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:56,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:56,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:56,306 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 18:08:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:56,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:56,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:08:56,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:08:56,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:08:56,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:56,343 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 4 states. [2018-11-28 18:08:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:56,601 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-11-28 18:08:56,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:08:56,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-28 18:08:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:56,604 INFO L225 Difference]: With dead ends: 84 [2018-11-28 18:08:56,604 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 18:08:56,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 18:08:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-11-28 18:08:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-28 18:08:56,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-28 18:08:56,615 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 14 [2018-11-28 18:08:56,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:56,615 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-28 18:08:56,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:08:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-28 18:08:56,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:08:56,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:56,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:56,618 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:56,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:56,618 INFO L82 PathProgramCache]: Analyzing trace with hash -44725957, now seen corresponding path program 1 times [2018-11-28 18:08:56,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:56,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:56,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:56,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:56,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:56,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:56,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:56,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:56,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:56,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:56,736 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2018-11-28 18:08:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:56,907 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-11-28 18:08:56,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:56,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 18:08:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:56,910 INFO L225 Difference]: With dead ends: 83 [2018-11-28 18:08:56,910 INFO L226 Difference]: Without dead ends: 79 [2018-11-28 18:08:56,911 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 [2018-11-28 18:08:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-28 18:08:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-11-28 18:08:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 18:08:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-11-28 18:08:56,920 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 19 [2018-11-28 18:08:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:56,921 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-11-28 18:08:56,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-11-28 18:08:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:08:56,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:56,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:56,923 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:56,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1386500464, now seen corresponding path program 1 times [2018-11-28 18:08:56,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:56,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:56,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:56,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:56,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:57,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:57,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:08:57,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:08:57,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:08:57,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:57,028 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 4 states. [2018-11-28 18:08:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:57,182 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2018-11-28 18:08:57,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:08:57,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-28 18:08:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:57,186 INFO L225 Difference]: With dead ends: 136 [2018-11-28 18:08:57,186 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 18:08:57,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:08:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 18:08:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2018-11-28 18:08:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 18:08:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-11-28 18:08:57,195 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2018-11-28 18:08:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:57,195 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-28 18:08:57,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:08:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-28 18:08:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 18:08:57,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:57,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:57,197 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:57,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:57,198 INFO L82 PathProgramCache]: Analyzing trace with hash 725856891, now seen corresponding path program 1 times [2018-11-28 18:08:57,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:57,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:57,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:57,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:57,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:57,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:57,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:57,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:57,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:57,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:57,254 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2018-11-28 18:08:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:57,331 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2018-11-28 18:08:57,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:57,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 18:08:57,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:57,333 INFO L225 Difference]: With dead ends: 141 [2018-11-28 18:08:57,333 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 18:08:57,334 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 [2018-11-28 18:08:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 18:08:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2018-11-28 18:08:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 18:08:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-11-28 18:08:57,344 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 24 [2018-11-28 18:08:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:57,345 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-11-28 18:08:57,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-11-28 18:08:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 18:08:57,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:57,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:57,347 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:57,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1026716690, now seen corresponding path program 1 times [2018-11-28 18:08:57,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:57,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:57,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:57,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:57,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:57,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:57,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:57,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:57,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:57,400 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 3 states. [2018-11-28 18:08:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:57,482 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-28 18:08:57,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:57,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 18:08:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:57,484 INFO L225 Difference]: With dead ends: 78 [2018-11-28 18:08:57,484 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 18:08:57,484 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 [2018-11-28 18:08:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 18:08:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-28 18:08:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 18:08:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-11-28 18:08:57,493 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 25 [2018-11-28 18:08:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:57,493 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-11-28 18:08:57,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-28 18:08:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:08:57,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:57,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:57,496 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:57,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:57,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1611661129, now seen corresponding path program 1 times [2018-11-28 18:08:57,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:57,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:57,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:57,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:57,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:57,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:57,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:57,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:57,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:57,575 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 3 states. [2018-11-28 18:08:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:57,624 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-11-28 18:08:57,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:57,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 18:08:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:57,626 INFO L225 Difference]: With dead ends: 79 [2018-11-28 18:08:57,626 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 18:08:57,627 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 [2018-11-28 18:08:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 18:08:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-28 18:08:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 18:08:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2018-11-28 18:08:57,633 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 27 [2018-11-28 18:08:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:57,634 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-11-28 18:08:57,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2018-11-28 18:08:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:08:57,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:57,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:57,636 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:57,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1611663051, now seen corresponding path program 1 times [2018-11-28 18:08:57,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:57,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:57,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:57,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:57,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:57,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:57,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:08:57,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:08:57,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:08:57,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:57,739 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 4 states. [2018-11-28 18:08:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:57,882 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-28 18:08:57,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:08:57,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-28 18:08:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:57,884 INFO L225 Difference]: With dead ends: 78 [2018-11-28 18:08:57,884 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 18:08:57,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 18:08:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-28 18:08:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 18:08:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2018-11-28 18:08:57,890 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 27 [2018-11-28 18:08:57,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:57,891 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2018-11-28 18:08:57,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:08:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-11-28 18:08:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 18:08:57,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:57,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:57,893 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:57,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:57,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1836072976, now seen corresponding path program 1 times [2018-11-28 18:08:57,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:57,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:57,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:57,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:57,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:58,201 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-11-28 18:08:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:58,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:58,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:08:58,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:08:58,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:08:58,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:58,243 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2018-11-28 18:08:58,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:58,409 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-11-28 18:08:58,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:08:58,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-28 18:08:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:58,420 INFO L225 Difference]: With dead ends: 190 [2018-11-28 18:08:58,420 INFO L226 Difference]: Without dead ends: 128 [2018-11-28 18:08:58,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:08:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-28 18:08:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2018-11-28 18:08:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 18:08:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-11-28 18:08:58,428 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 28 [2018-11-28 18:08:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:58,428 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-11-28 18:08:58,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:08:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-28 18:08:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 18:08:58,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:58,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:58,430 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:58,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:58,430 INFO L82 PathProgramCache]: Analyzing trace with hash 870546418, now seen corresponding path program 1 times [2018-11-28 18:08:58,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:58,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:58,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:58,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:58,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:58,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:58,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:08:58,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:08:58,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:08:58,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:08:58,585 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 6 states. [2018-11-28 18:08:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:59,117 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2018-11-28 18:08:59,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:08:59,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-28 18:08:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:59,119 INFO L225 Difference]: With dead ends: 182 [2018-11-28 18:08:59,119 INFO L226 Difference]: Without dead ends: 139 [2018-11-28 18:08:59,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:08:59,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-28 18:08:59,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2018-11-28 18:08:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 18:08:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-11-28 18:08:59,127 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 28 [2018-11-28 18:08:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:59,128 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-11-28 18:08:59,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:08:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-11-28 18:08:59,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 18:08:59,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:59,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:59,130 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:59,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:59,130 INFO L82 PathProgramCache]: Analyzing trace with hash 769950578, now seen corresponding path program 1 times [2018-11-28 18:08:59,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:59,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:59,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:59,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:59,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:59,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:59,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 18:08:59,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:08:59,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:08:59,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:08:59,524 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2018-11-28 18:09:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:00,323 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2018-11-28 18:09:00,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:09:00,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-11-28 18:09:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:00,327 INFO L225 Difference]: With dead ends: 241 [2018-11-28 18:09:00,327 INFO L226 Difference]: Without dead ends: 239 [2018-11-28 18:09:00,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:09:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-28 18:09:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 98. [2018-11-28 18:09:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 18:09:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-11-28 18:09:00,338 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 28 [2018-11-28 18:09:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:00,339 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-11-28 18:09:00,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:09:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-11-28 18:09:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 18:09:00,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:00,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:00,341 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:00,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:00,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1506132002, now seen corresponding path program 1 times [2018-11-28 18:09:00,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:00,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:00,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:09:00,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:09:00,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:09:00,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:09:00,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:09:00,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:09:00,458 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 5 states. [2018-11-28 18:09:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:00,641 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2018-11-28 18:09:00,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:09:00,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-28 18:09:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:00,644 INFO L225 Difference]: With dead ends: 145 [2018-11-28 18:09:00,644 INFO L226 Difference]: Without dead ends: 127 [2018-11-28 18:09:00,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:09:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-28 18:09:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-11-28 18:09:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-28 18:09:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2018-11-28 18:09:00,653 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 30 [2018-11-28 18:09:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:00,653 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2018-11-28 18:09:00,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:09:00,654 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2018-11-28 18:09:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 18:09:00,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:00,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:00,655 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:00,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:00,656 INFO L82 PathProgramCache]: Analyzing trace with hash -677189726, now seen corresponding path program 1 times [2018-11-28 18:09:00,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:00,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:00,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:00,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:09:00,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:09:00,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:09:00,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:09:00,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:09:00,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:09:00,788 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 3 states. [2018-11-28 18:09:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:00,931 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2018-11-28 18:09:00,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:09:00,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 18:09:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:00,933 INFO L225 Difference]: With dead ends: 119 [2018-11-28 18:09:00,933 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 18:09:00,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:09:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 18:09:00,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-28 18:09:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-28 18:09:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2018-11-28 18:09:00,943 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 30 [2018-11-28 18:09:00,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:00,943 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2018-11-28 18:09:00,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:09:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2018-11-28 18:09:00,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 18:09:00,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:00,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:00,945 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:00,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:00,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1818543518, now seen corresponding path program 1 times [2018-11-28 18:09:00,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:00,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:00,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:00,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:00,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:01,302 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2018-11-28 18:09:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:01,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:09:01,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 18:09:01,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:09:01,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:09:01,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:09:01,410 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand 7 states. [2018-11-28 18:09:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:02,062 INFO L93 Difference]: Finished difference Result 277 states and 322 transitions. [2018-11-28 18:09:02,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:09:02,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-28 18:09:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:02,065 INFO L225 Difference]: With dead ends: 277 [2018-11-28 18:09:02,065 INFO L226 Difference]: Without dead ends: 275 [2018-11-28 18:09:02,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:09:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-28 18:09:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 120. [2018-11-28 18:09:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-28 18:09:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2018-11-28 18:09:02,077 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 31 [2018-11-28 18:09:02,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:02,078 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2018-11-28 18:09:02,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:09:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2018-11-28 18:09:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 18:09:02,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:02,079 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, 1, 1, 1, 1, 1] [2018-11-28 18:09:02,079 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:02,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:02,079 INFO L82 PathProgramCache]: Analyzing trace with hash -828341282, now seen corresponding path program 1 times [2018-11-28 18:09:02,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:02,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:02,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:02,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:02,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:02,435 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-28 18:09:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:02,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:09:02,448 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 [2018-11-28 18:09:02,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:02,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:09:02,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:09:02,622 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 [2018-11-28 18:09:02,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:02,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:02,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:09:02,807 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 [2018-11-28 18:09:02,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:02,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:02,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:02,939 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-28 18:09:03,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-28 18:09:03,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:03,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 18:09:03,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-28 18:09:03,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:03,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 18:09:03,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-11-28 18:09:03,766 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 22 treesize of output 16 [2018-11-28 18:09:03,769 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 16 treesize of output 3 [2018-11-28 18:09:03,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,781 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 22 treesize of output 16 [2018-11-28 18:09:03,788 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 16 treesize of output 3 [2018-11-28 18:09:03,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:03,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-28 18:09:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:03,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:09:03,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-28 18:09:03,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:09:03,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:09:03,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:09:03,836 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 8 states. [2018-11-28 18:09:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:04,500 INFO L93 Difference]: Finished difference Result 224 states and 260 transitions. [2018-11-28 18:09:04,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:09:04,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-28 18:09:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:04,504 INFO L225 Difference]: With dead ends: 224 [2018-11-28 18:09:04,504 INFO L226 Difference]: Without dead ends: 162 [2018-11-28 18:09:04,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:09:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-28 18:09:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2018-11-28 18:09:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 18:09:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-11-28 18:09:04,517 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 33 [2018-11-28 18:09:04,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:04,517 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-11-28 18:09:04,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:09:04,517 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-11-28 18:09:04,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 18:09:04,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:04,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:04,518 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:04,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:04,522 INFO L82 PathProgramCache]: Analyzing trace with hash -693545280, now seen corresponding path program 1 times [2018-11-28 18:09:04,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:04,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:04,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:04,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:04,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:05,087 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 24 [2018-11-28 18:09:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:05,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:09:05,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:09:05,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:09:05,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:09:05,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:09:05,097 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 6 states. [2018-11-28 18:09:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:05,402 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2018-11-28 18:09:05,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:09:05,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-28 18:09:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:05,404 INFO L225 Difference]: With dead ends: 165 [2018-11-28 18:09:05,404 INFO L226 Difference]: Without dead ends: 145 [2018-11-28 18:09:05,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:09:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-28 18:09:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 121. [2018-11-28 18:09:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-28 18:09:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2018-11-28 18:09:05,417 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 33 [2018-11-28 18:09:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:05,419 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2018-11-28 18:09:05,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:09:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2018-11-28 18:09:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 18:09:05,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:05,421 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:05,421 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:05,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:05,422 INFO L82 PathProgramCache]: Analyzing trace with hash 928343854, now seen corresponding path program 1 times [2018-11-28 18:09:05,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:05,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:05,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:05,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:05,837 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2018-11-28 18:09:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:06,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:09:06,021 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 [2018-11-28 18:09:06,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:06,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:09:06,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 18:09:06,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 18:09:06,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:06,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:06,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:06,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-28 18:09:06,188 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 15 treesize of output 11 [2018-11-28 18:09:06,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 18:09:06,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:06,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:06,210 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 24 treesize of output 18 [2018-11-28 18:09:06,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:06,216 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 18 treesize of output 10 [2018-11-28 18:09:06,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:06,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:06,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:06,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-11-28 18:09:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:06,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:09:06,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2018-11-28 18:09:06,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:09:06,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:09:06,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:09:06,308 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 10 states. [2018-11-28 18:09:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:06,762 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2018-11-28 18:09:06,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:09:06,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-11-28 18:09:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:06,765 INFO L225 Difference]: With dead ends: 225 [2018-11-28 18:09:06,765 INFO L226 Difference]: Without dead ends: 194 [2018-11-28 18:09:06,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:09:06,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-28 18:09:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 138. [2018-11-28 18:09:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-28 18:09:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2018-11-28 18:09:06,782 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 36 [2018-11-28 18:09:06,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:06,783 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2018-11-28 18:09:06,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:09:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2018-11-28 18:09:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 18:09:06,783 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:06,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:06,784 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:06,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:06,785 INFO L82 PathProgramCache]: Analyzing trace with hash 36989377, now seen corresponding path program 1 times [2018-11-28 18:09:06,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:06,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:06,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:06,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:06,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:06,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:09:06,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:09:06,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:09:06,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:09:06,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:09:06,852 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand 3 states. [2018-11-28 18:09:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:07,039 INFO L93 Difference]: Finished difference Result 297 states and 364 transitions. [2018-11-28 18:09:07,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:09:07,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-28 18:09:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:07,042 INFO L225 Difference]: With dead ends: 297 [2018-11-28 18:09:07,043 INFO L226 Difference]: Without dead ends: 215 [2018-11-28 18:09:07,043 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 [2018-11-28 18:09:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-28 18:09:07,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 175. [2018-11-28 18:09:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-28 18:09:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2018-11-28 18:09:07,080 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 36 [2018-11-28 18:09:07,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:07,080 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2018-11-28 18:09:07,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:09:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2018-11-28 18:09:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:09:07,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:07,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:07,085 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:07,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:07,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1278661403, now seen corresponding path program 1 times [2018-11-28 18:09:07,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:07,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:07,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:07,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:07,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:07,283 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-11-28 18:09:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:07,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:09:07,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:09:07,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:09:07,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:09:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:09:07,291 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand 4 states. [2018-11-28 18:09:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:07,838 INFO L93 Difference]: Finished difference Result 291 states and 353 transitions. [2018-11-28 18:09:07,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:09:07,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-28 18:09:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:07,841 INFO L225 Difference]: With dead ends: 291 [2018-11-28 18:09:07,841 INFO L226 Difference]: Without dead ends: 182 [2018-11-28 18:09:07,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:09:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-28 18:09:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 177. [2018-11-28 18:09:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-28 18:09:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 213 transitions. [2018-11-28 18:09:07,859 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 213 transitions. Word has length 40 [2018-11-28 18:09:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:07,859 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 213 transitions. [2018-11-28 18:09:07,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:09:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 213 transitions. [2018-11-28 18:09:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:09:07,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:07,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:07,860 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:07,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash 257593049, now seen corresponding path program 1 times [2018-11-28 18:09:07,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:07,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:07,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:07,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:07,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:08,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:09:08,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:09:08,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:08,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:09:08,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 18:09:08,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 18:09:08,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 18:09:08,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 18:09:08,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 18:09:08,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 18:09:08,502 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-11-28 18:09:08,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:08,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:08,576 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 [2018-11-28 18:09:08,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-28 18:09:08,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:08,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 23 [2018-11-28 18:09:08,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,653 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 28 treesize of output 29 [2018-11-28 18:09:08,660 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 [2018-11-28 18:09:08,660 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,669 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-28 18:09:08,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:08,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 18:09:08,784 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,802 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 28 treesize of output 33 [2018-11-28 18:09:08,810 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 12 treesize of output 11 [2018-11-28 18:09:08,810 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,819 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,827 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,843 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. [2018-11-28 18:09:08,843 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:86, output treesize:51 [2018-11-28 18:09:08,937 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 82 treesize of output 72 [2018-11-28 18:09:08,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:08,960 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 [2018-11-28 18:09:08,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:08,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:09,011 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 42 treesize of output 37 [2018-11-28 18:09:09,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:09,043 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 [2018-11-28 18:09:09,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:09,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:09,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:09:09,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2018-11-28 18:09:09,369 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 71 treesize of output 54 [2018-11-28 18:09:09,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:09,394 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 [2018-11-28 18:09:09,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:09,454 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-28 18:09:09,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:09:09,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:09:09,500 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 31 treesize of output 27 [2018-11-28 18:09:09,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:09,505 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 [2018-11-28 18:09:09,505 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:09,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 18:09:09,515 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:09,526 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:09,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:09,531 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2018-11-28 18:09:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:09,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:09:09,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-28 18:09:09,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 18:09:09,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 18:09:09,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=211, Unknown=1, NotChecked=0, Total=272 [2018-11-28 18:09:09,577 INFO L87 Difference]: Start difference. First operand 177 states and 213 transitions. Second operand 17 states. [2018-11-28 18:09:09,965 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-11-28 18:09:12,028 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 18:09:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:12,389 INFO L93 Difference]: Finished difference Result 479 states and 565 transitions. [2018-11-28 18:09:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 18:09:12,389 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-28 18:09:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:12,391 INFO L225 Difference]: With dead ends: 479 [2018-11-28 18:09:12,391 INFO L226 Difference]: Without dead ends: 387 [2018-11-28 18:09:12,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=254, Invalid=736, Unknown=2, NotChecked=0, Total=992 [2018-11-28 18:09:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-28 18:09:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 213. [2018-11-28 18:09:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-28 18:09:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 254 transitions. [2018-11-28 18:09:12,414 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 254 transitions. Word has length 40 [2018-11-28 18:09:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:12,414 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 254 transitions. [2018-11-28 18:09:12,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 18:09:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2018-11-28 18:09:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:09:12,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:12,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:12,418 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:12,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:12,419 INFO L82 PathProgramCache]: Analyzing trace with hash -427010471, now seen corresponding path program 1 times [2018-11-28 18:09:12,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:12,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:12,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:12,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:12,779 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 14 [2018-11-28 18:09:13,075 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-11-28 18:09:13,320 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-11-28 18:09:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:13,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:09:13,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:09:13,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:09:13,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:09:13,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 18:09:13,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:13,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:13,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 18:09:13,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:13,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:13,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-11-28 18:09:13,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:13,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 343 treesize of output 233 [2018-11-28 18:09:13,875 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-28 18:09:13,879 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 10 treesize of output 9 [2018-11-28 18:09:13,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:13,959 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 200 treesize of output 196 [2018-11-28 18:09:13,964 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 [2018-11-28 18:09:13,964 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:13,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 184 [2018-11-28 18:09:14,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:14,000 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 50 treesize of output 91 [2018-11-28 18:09:14,001 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:14,024 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:14,039 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:14,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:14,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 89 [2018-11-28 18:09:14,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 18:09:14,129 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:14,143 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 49 treesize of output 51 [2018-11-28 18:09:14,162 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 14 treesize of output 13 [2018-11-28 18:09:14,163 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:14,264 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 46 treesize of output 39 [2018-11-28 18:09:14,269 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 27 [2018-11-28 18:09:14,269 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:14,279 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:14,287 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:14,298 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:14,319 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. [2018-11-28 18:09:14,319 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2018-11-28 18:09:14,737 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-28 18:09:14,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:14,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:14,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:14,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-28 18:09:14,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:14,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:14,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 88 [2018-11-28 18:09:14,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:14,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 100 [2018-11-28 18:09:14,954 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:15,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:15,386 INFO L303 Elim1Store]: Index analysis took 154 ms [2018-11-28 18:09:15,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 97 [2018-11-28 18:09:15,394 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 [2018-11-28 18:09:15,395 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,421 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,452 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:15,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2018-11-28 18:09:15,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:15,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 18:09:15,500 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:15,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 79 [2018-11-28 18:09:15,552 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 12 treesize of output 11 [2018-11-28 18:09:15,553 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,651 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,663 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,693 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:153, output treesize:114 [2018-11-28 18:09:15,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:15,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:15,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:15,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 149 [2018-11-28 18:09:15,823 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 27 treesize of output 35 [2018-11-28 18:09:15,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:15,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:15,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 92 [2018-11-28 18:09:15,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-11-28 18:09:15,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:15,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:154, output treesize:130 [2018-11-28 18:09:16,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:16,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:16,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:16,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:09:16,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 121 [2018-11-28 18:09:16,231 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-11-28 18:09:16,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:16,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2018-11-28 18:09:16,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 18:09:16,313 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 18:09:16,314 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 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-28 18:09:16,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:16,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 18:09:16,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-11-28 18:09:16,372 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 20 treesize of output 5 [2018-11-28 18:09:16,373 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:16,386 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 16 treesize of output 3 [2018-11-28 18:09:16,387 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 18:09:16,390 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:16,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:09:16,398 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:149, output treesize:7 [2018-11-28 18:09:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:09:16,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:09:16,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-28 18:09:16,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 18:09:16,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 18:09:16,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=223, Unknown=1, NotChecked=0, Total=272 [2018-11-28 18:09:16,435 INFO L87 Difference]: Start difference. First operand 213 states and 254 transitions. Second operand 17 states. [2018-11-28 18:09:17,269 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2018-11-28 18:09:17,704 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-11-28 18:09:18,078 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2018-11-28 18:09:18,339 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 87 [2018-11-28 18:09:18,626 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 99 [2018-11-28 18:09:18,792 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2018-11-28 18:09:19,340 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-11-28 18:09:19,492 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2018-11-28 18:09:19,778 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2018-11-28 18:09:20,008 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 91 [2018-11-28 18:09:20,306 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-11-28 18:09:20,662 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2018-11-28 18:09:21,300 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-11-28 18:09:22,195 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2018-11-28 18:09:22,480 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2018-11-28 18:09:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:09:22,835 INFO L93 Difference]: Finished difference Result 778 states and 904 transitions. [2018-11-28 18:09:22,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 18:09:22,840 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-28 18:09:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:09:22,846 INFO L225 Difference]: With dead ends: 778 [2018-11-28 18:09:22,846 INFO L226 Difference]: Without dead ends: 776 [2018-11-28 18:09:22,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=555, Invalid=1700, Unknown=1, NotChecked=0, Total=2256 [2018-11-28 18:09:22,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-11-28 18:09:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 249. [2018-11-28 18:09:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-28 18:09:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 296 transitions. [2018-11-28 18:09:22,879 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 296 transitions. Word has length 40 [2018-11-28 18:09:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:09:22,879 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 296 transitions. [2018-11-28 18:09:22,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 18:09:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 296 transitions. [2018-11-28 18:09:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:09:22,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:09:22,880 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-11-28 18:09:22,884 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:09:22,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:09:22,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1953426060, now seen corresponding path program 1 times [2018-11-28 18:09:22,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:09:22,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:09:22,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:22,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:09:22,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:09:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:09:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:09:22,949 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:09:23,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:09:23 BoogieIcfgContainer [2018-11-28 18:09:23,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:09:23,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:09:23,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:09:23,032 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:09:23,035 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:08:55" (3/4) ... [2018-11-28 18:09:23,038 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:09:23,107 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:09:23,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:09:23,112 INFO L168 Benchmark]: Toolchain (without parser) took 29626.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.7 MB). Free memory was 944.6 MB in the beginning and 1.3 GB in the end (delta: -363.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:09:23,112 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:09:23,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:09:23,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.96 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. [2018-11-28 18:09:23,113 INFO L168 Benchmark]: Boogie Preprocessor took 59.59 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. [2018-11-28 18:09:23,117 INFO L168 Benchmark]: RCFGBuilder took 973.30 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:09:23,119 INFO L168 Benchmark]: TraceAbstraction took 27753.95 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -217.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:09:23,119 INFO L168 Benchmark]: Witness Printer took 78.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:09:23,123 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 706.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.96 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 59.59 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. * RCFGBuilder took 973.30 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27753.95 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -217.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 78.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={12:0}, list->inner={15:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={12:0}, inner={15:0}, len=0, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={15:0}, inner->inner={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={12:0}, inner={15:0}, inner->next={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner VAL [end={12:0}, inner={11:1}, len=1, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={11:1}, inner->inner={13:10}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 89 locations, 13 error locations. UNSAFE Result, 27.6s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 15.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1769 SDtfs, 3581 SDslu, 4347 SDs, 0 SdLazy, 2521 SolverSat, 365 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 171 SyntacticMatches, 14 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=22, 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.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 1362 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 800 NumberOfCodeBlocks, 800 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 734 ConstructedInterpolants, 15 QuantifiedInterpolants, 411074 SizeOfPredicates, 45 NumberOfNonLiveVariables, 513 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 26 InterpolantComputations, 18 PerfectInterpolantSequences, 10/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...