./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer --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 e55536c26dc3d2371d51cd4bd073d4d19c2d7077 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 10:18:36,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:18:36,321 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:18:36,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:18:36,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:18:36,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:18:36,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:18:36,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:18:36,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:18:36,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:18:36,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:18:36,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:18:36,332 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:18:36,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:18:36,334 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:18:36,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:18:36,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:18:36,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:18:36,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:18:36,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:18:36,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:18:36,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:18:36,340 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:18:36,340 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:18:36,340 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:18:36,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:18:36,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:18:36,342 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:18:36,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:18:36,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:18:36,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:18:36,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:18:36,343 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:18:36,343 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:18:36,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:18:36,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:18:36,345 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 10:18:36,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:18:36,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:18:36,353 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 10:18:36,353 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 10:18:36,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:18:36,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:18:36,354 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:18:36,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:18:36,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:18:36,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:18:36,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:18:36,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:18:36,354 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 10:18:36,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 10:18:36,355 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 10:18:36,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:18:36,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:18:36,355 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:18:36,355 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 10:18:36,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:18:36,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:18:36,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 10:18:36,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 10:18:36,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:18:36,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:18:36,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 10:18:36,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 10:18:36,356 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:18:36,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 10:18:36,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 10:18:36,357 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer 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 -> e55536c26dc3d2371d51cd4bd073d4d19c2d7077 [2018-12-09 10:18:36,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:18:36,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:18:36,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:18:36,384 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:18:36,384 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:18:36,385 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-12-09 10:18:36,420 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/data/121e506fa/a17eebf1a4d64c6a95907cb88ea6f145/FLAG097d05281 [2018-12-09 10:18:36,813 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:18:36,814 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-12-09 10:18:36,819 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/data/121e506fa/a17eebf1a4d64c6a95907cb88ea6f145/FLAG097d05281 [2018-12-09 10:18:36,827 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/data/121e506fa/a17eebf1a4d64c6a95907cb88ea6f145 [2018-12-09 10:18:36,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:18:36,830 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:18:36,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:18:36,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:18:36,832 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:18:36,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:18:36" (1/1) ... [2018-12-09 10:18:36,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd40c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36, skipping insertion in model container [2018-12-09 10:18:36,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:18:36" (1/1) ... [2018-12-09 10:18:36,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:18:36,854 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:18:36,951 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:18:36,954 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:18:36,974 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:18:36,982 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:18:36,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36 WrapperNode [2018-12-09 10:18:36,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:18:36,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:18:36,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:18:36,983 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:18:36,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36" (1/1) ... [2018-12-09 10:18:36,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36" (1/1) ... [2018-12-09 10:18:36,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:18:36,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:18:36,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:18:36,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:18:37,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36" (1/1) ... [2018-12-09 10:18:37,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36" (1/1) ... [2018-12-09 10:18:37,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36" (1/1) ... [2018-12-09 10:18:37,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36" (1/1) ... [2018-12-09 10:18:37,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36" (1/1) ... [2018-12-09 10:18:37,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36" (1/1) ... [2018-12-09 10:18:37,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36" (1/1) ... [2018-12-09 10:18:37,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:18:37,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:18:37,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:18:37,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:18:37,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/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-12-09 10:18:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 10:18:37,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 10:18:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:18:37,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:18:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 10:18:37,079 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 10:18:37,282 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:18:37,282 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 10:18:37,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:18:37 BoogieIcfgContainer [2018-12-09 10:18:37,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:18:37,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 10:18:37,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 10:18:37,286 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 10:18:37,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:18:36" (1/3) ... [2018-12-09 10:18:37,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1964ae07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:18:37, skipping insertion in model container [2018-12-09 10:18:37,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:18:36" (2/3) ... [2018-12-09 10:18:37,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1964ae07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:18:37, skipping insertion in model container [2018-12-09 10:18:37,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:18:37" (3/3) ... [2018-12-09 10:18:37,288 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-12-09 10:18:37,295 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 10:18:37,300 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-12-09 10:18:37,310 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-12-09 10:18:37,332 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:18:37,332 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 10:18:37,332 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 10:18:37,333 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 10:18:37,333 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:18:37,333 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:18:37,333 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 10:18:37,333 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:18:37,333 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 10:18:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-12-09 10:18:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 10:18:37,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:37,352 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-12-09 10:18:37,354 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:37,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:37,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2018-12-09 10:18:37,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:37,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:37,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:37,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:37,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:37,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:37,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:18:37,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:18:37,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:18:37,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:18:37,485 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2018-12-09 10:18:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:37,501 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2018-12-09 10:18:37,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:18:37,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 10:18:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:37,508 INFO L225 Difference]: With dead ends: 93 [2018-12-09 10:18:37,508 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 10:18:37,510 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-12-09 10:18:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 10:18:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-09 10:18:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-09 10:18:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-12-09 10:18:37,533 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2018-12-09 10:18:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:37,533 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-12-09 10:18:37,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:18:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-12-09 10:18:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 10:18:37,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:37,534 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-12-09 10:18:37,534 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:37,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:37,535 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2018-12-09 10:18:37,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:37,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:37,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:37,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:37,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:18:37,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:18:37,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:18:37,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:18:37,594 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2018-12-09 10:18:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:37,656 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-12-09 10:18:37,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:18:37,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 10:18:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:37,657 INFO L225 Difference]: With dead ends: 80 [2018-12-09 10:18:37,657 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 10:18:37,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:18:37,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 10:18:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-09 10:18:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 10:18:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-12-09 10:18:37,662 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2018-12-09 10:18:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:37,662 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-12-09 10:18:37,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:18:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-12-09 10:18:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 10:18:37,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:37,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:18:37,663 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:37,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:37,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2018-12-09 10:18:37,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:37,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:37,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:37,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:37,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:37,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:37,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:18:37,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:18:37,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:18:37,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:18:37,700 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2018-12-09 10:18:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:37,756 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-12-09 10:18:37,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:18:37,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-09 10:18:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:37,757 INFO L225 Difference]: With dead ends: 116 [2018-12-09 10:18:37,757 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 10:18:37,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:18:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 10:18:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 76. [2018-12-09 10:18:37,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 10:18:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-12-09 10:18:37,762 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2018-12-09 10:18:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:37,762 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-12-09 10:18:37,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:18:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-12-09 10:18:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 10:18:37,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:37,763 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] [2018-12-09 10:18:37,763 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:37,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:37,764 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2018-12-09 10:18:37,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:37,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:37,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:37,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:37,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:37,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:37,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:18:37,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:18:37,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:18:37,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:18:37,806 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2018-12-09 10:18:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:37,864 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-09 10:18:37,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:18:37,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-09 10:18:37,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:37,865 INFO L225 Difference]: With dead ends: 76 [2018-12-09 10:18:37,865 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 10:18:37,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:18:37,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 10:18:37,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-09 10:18:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 10:18:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-12-09 10:18:37,869 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2018-12-09 10:18:37,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:37,869 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-12-09 10:18:37,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:18:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-12-09 10:18:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 10:18:37,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:37,870 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] [2018-12-09 10:18:37,870 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:37,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2018-12-09 10:18:37,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:37,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:37,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:37,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:37,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:18:37,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:18:37,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:18:37,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:18:37,900 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-12-09 10:18:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:37,997 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-12-09 10:18:37,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:18:37,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-09 10:18:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:37,998 INFO L225 Difference]: With dead ends: 141 [2018-12-09 10:18:37,999 INFO L226 Difference]: Without dead ends: 139 [2018-12-09 10:18:37,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:18:37,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-09 10:18:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2018-12-09 10:18:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 10:18:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-12-09 10:18:38,006 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2018-12-09 10:18:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:38,007 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-12-09 10:18:38,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:18:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-12-09 10:18:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 10:18:38,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:38,008 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] [2018-12-09 10:18:38,008 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:38,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:38,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2018-12-09 10:18:38,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:38,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:38,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:38,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:38,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:38,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:18:38,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:18:38,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:18:38,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:18:38,058 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-12-09 10:18:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:38,149 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-12-09 10:18:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:18:38,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-09 10:18:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:38,150 INFO L225 Difference]: With dead ends: 108 [2018-12-09 10:18:38,150 INFO L226 Difference]: Without dead ends: 106 [2018-12-09 10:18:38,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:18:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-09 10:18:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2018-12-09 10:18:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 10:18:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-12-09 10:18:38,154 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2018-12-09 10:18:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:38,155 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-12-09 10:18:38,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:18:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-12-09 10:18:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 10:18:38,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:38,155 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-12-09 10:18:38,156 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:38,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:38,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2018-12-09 10:18:38,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:38,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:38,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:38,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:38,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:38,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:18:38,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:18:38,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:18:38,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:18:38,193 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-12-09 10:18:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:38,253 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-12-09 10:18:38,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:18:38,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-09 10:18:38,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:38,254 INFO L225 Difference]: With dead ends: 121 [2018-12-09 10:18:38,254 INFO L226 Difference]: Without dead ends: 119 [2018-12-09 10:18:38,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:18:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-09 10:18:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2018-12-09 10:18:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 10:18:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-12-09 10:18:38,260 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2018-12-09 10:18:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:38,260 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-12-09 10:18:38,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:18:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-12-09 10:18:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 10:18:38,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:38,261 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-12-09 10:18:38,261 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:38,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:38,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2018-12-09 10:18:38,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:38,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:38,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:38,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:38,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:38,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:18:38,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:18:38,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:18:38,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:18:38,299 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-12-09 10:18:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:38,351 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-12-09 10:18:38,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:18:38,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-09 10:18:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:38,351 INFO L225 Difference]: With dead ends: 77 [2018-12-09 10:18:38,351 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 10:18:38,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:18:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 10:18:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-09 10:18:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 10:18:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-12-09 10:18:38,355 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2018-12-09 10:18:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:38,355 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-12-09 10:18:38,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:18:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-12-09 10:18:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 10:18:38,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:38,356 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] [2018-12-09 10:18:38,356 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:38,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:38,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2018-12-09 10:18:38,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:38,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:38,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:38,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:38,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:38,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:18:38,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:18:38,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:18:38,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:18:38,371 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2018-12-09 10:18:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:38,392 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-12-09 10:18:38,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:18:38,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 10:18:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:38,393 INFO L225 Difference]: With dead ends: 115 [2018-12-09 10:18:38,393 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 10:18:38,393 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-12-09 10:18:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 10:18:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-09 10:18:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 10:18:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-12-09 10:18:38,397 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2018-12-09 10:18:38,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:38,397 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-12-09 10:18:38,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:18:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-12-09 10:18:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 10:18:38,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:38,397 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-12-09 10:18:38,398 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:38,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2018-12-09 10:18:38,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:38,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:38,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:38,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:38,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:38,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:18:38,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:18:38,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:18:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:18:38,442 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 7 states. [2018-12-09 10:18:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:38,514 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-09 10:18:38,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:18:38,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-09 10:18:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:38,514 INFO L225 Difference]: With dead ends: 76 [2018-12-09 10:18:38,514 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 10:18:38,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:18:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 10:18:38,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-12-09 10:18:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 10:18:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-12-09 10:18:38,517 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2018-12-09 10:18:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:38,518 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-12-09 10:18:38,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:18:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-12-09 10:18:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 10:18:38,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:38,518 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 10:18:38,518 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:38,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:38,519 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2018-12-09 10:18:38,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:38,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:18:38,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:18:38,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/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-12-09 10:18:38,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:38,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:18:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:18:38,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:18:38,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-12-09 10:18:38,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 10:18:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 10:18:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:18:38,649 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2018-12-09 10:18:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:38,731 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-12-09 10:18:38,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:18:38,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-12-09 10:18:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:38,732 INFO L225 Difference]: With dead ends: 111 [2018-12-09 10:18:38,732 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 10:18:38,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:18:38,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 10:18:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2018-12-09 10:18:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 10:18:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-12-09 10:18:38,735 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2018-12-09 10:18:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:38,736 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-12-09 10:18:38,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 10:18:38,736 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-12-09 10:18:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 10:18:38,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:38,736 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-12-09 10:18:38,737 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:38,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:38,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2018-12-09 10:18:38,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:38,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:38,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:38,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:38,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:18:38,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:18:38,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:18:38,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:18:38,765 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2018-12-09 10:18:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:38,819 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-09 10:18:38,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:18:38,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-09 10:18:38,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:38,820 INFO L225 Difference]: With dead ends: 70 [2018-12-09 10:18:38,820 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 10:18:38,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:18:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 10:18:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-09 10:18:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 10:18:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-12-09 10:18:38,824 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2018-12-09 10:18:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:38,824 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-12-09 10:18:38,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:18:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-12-09 10:18:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 10:18:38,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:38,824 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] [2018-12-09 10:18:38,825 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:38,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:38,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2018-12-09 10:18:38,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:38,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:38,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:38,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:18:38,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:18:38,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/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-12-09 10:18:38,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:38,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:18:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:18:38,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:18:38,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-12-09 10:18:38,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 10:18:38,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 10:18:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:18:38,945 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 9 states. [2018-12-09 10:18:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:38,997 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-12-09 10:18:38,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:18:38,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-12-09 10:18:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:38,998 INFO L225 Difference]: With dead ends: 69 [2018-12-09 10:18:38,998 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 10:18:38,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:18:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 10:18:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-12-09 10:18:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 10:18:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-09 10:18:39,001 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2018-12-09 10:18:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:39,002 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-09 10:18:39,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 10:18:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-09 10:18:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 10:18:39,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:39,002 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] [2018-12-09 10:18:39,003 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:39,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:39,003 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2018-12-09 10:18:39,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:39,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:39,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:39,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:39,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:39,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:18:39,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:18:39,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:18:39,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:18:39,053 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 7 states. [2018-12-09 10:18:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:39,111 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-12-09 10:18:39,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:18:39,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-12-09 10:18:39,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:39,112 INFO L225 Difference]: With dead ends: 63 [2018-12-09 10:18:39,112 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 10:18:39,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:18:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 10:18:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-12-09 10:18:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 10:18:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-09 10:18:39,115 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-12-09 10:18:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:39,115 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-09 10:18:39,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:18:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-09 10:18:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 10:18:39,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:39,115 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] [2018-12-09 10:18:39,116 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:39,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2018-12-09 10:18:39,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:39,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:39,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:39,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:18:39,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:18:39,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:18:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:18:39,151 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2018-12-09 10:18:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:39,209 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-12-09 10:18:39,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:18:39,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-12-09 10:18:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:39,209 INFO L225 Difference]: With dead ends: 71 [2018-12-09 10:18:39,210 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 10:18:39,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:18:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 10:18:39,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-12-09 10:18:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 10:18:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-09 10:18:39,213 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2018-12-09 10:18:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:39,213 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-09 10:18:39,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:18:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-09 10:18:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 10:18:39,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:39,214 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, 1, 1] [2018-12-09 10:18:39,214 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:39,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:39,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2018-12-09 10:18:39,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:39,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:39,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:39,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:39,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:39,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:18:39,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:18:39,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:18:39,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:18:39,244 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2018-12-09 10:18:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:39,313 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-09 10:18:39,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:18:39,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-09 10:18:39,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:39,314 INFO L225 Difference]: With dead ends: 91 [2018-12-09 10:18:39,314 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 10:18:39,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:18:39,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 10:18:39,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2018-12-09 10:18:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 10:18:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-09 10:18:39,317 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2018-12-09 10:18:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:39,317 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-09 10:18:39,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:18:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-09 10:18:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 10:18:39,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:39,318 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, 1, 1, 1] [2018-12-09 10:18:39,318 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:39,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:39,318 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2018-12-09 10:18:39,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:39,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:39,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:39,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:39,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-12-09 10:18:39,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:39,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:18:39,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:18:39,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:18:39,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:18:39,342 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2018-12-09 10:18:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:39,390 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-09 10:18:39,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:18:39,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-12-09 10:18:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:39,390 INFO L225 Difference]: With dead ends: 61 [2018-12-09 10:18:39,390 INFO L226 Difference]: Without dead ends: 59 [2018-12-09 10:18:39,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:18:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-09 10:18:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-09 10:18:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 10:18:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-12-09 10:18:39,393 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2018-12-09 10:18:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:39,393 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-12-09 10:18:39,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:18:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-12-09 10:18:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 10:18:39,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:39,394 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, 1, 1, 1, 1, 1] [2018-12-09 10:18:39,394 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:39,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:39,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2018-12-09 10:18:39,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:39,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:39,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:39,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:39,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:39,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:18:39,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:18:39,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:18:39,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:18:39,420 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2018-12-09 10:18:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:39,452 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-09 10:18:39,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:18:39,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-12-09 10:18:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:39,453 INFO L225 Difference]: With dead ends: 70 [2018-12-09 10:18:39,453 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 10:18:39,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:18:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 10:18:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-12-09 10:18:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 10:18:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-12-09 10:18:39,458 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2018-12-09 10:18:39,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:39,458 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-12-09 10:18:39,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:18:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-12-09 10:18:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 10:18:39,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:39,459 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, 1, 1, 1, 1, 1, 1] [2018-12-09 10:18:39,459 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:39,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:39,459 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2018-12-09 10:18:39,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:39,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:39,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:39,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:39,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:39,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:18:39,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:18:39,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:18:39,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:18:39,489 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2018-12-09 10:18:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:39,522 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-12-09 10:18:39,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:18:39,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-12-09 10:18:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:39,523 INFO L225 Difference]: With dead ends: 66 [2018-12-09 10:18:39,523 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 10:18:39,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:18:39,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 10:18:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-12-09 10:18:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 10:18:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-12-09 10:18:39,526 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2018-12-09 10:18:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:39,526 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-12-09 10:18:39,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:18:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-12-09 10:18:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 10:18:39,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:39,526 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:18:39,527 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:39,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:39,527 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2018-12-09 10:18:39,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:39,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:39,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:39,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:39,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:39,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:18:39,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:18:39,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:18:39,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:18:39,554 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2018-12-09 10:18:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:39,624 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-12-09 10:18:39,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:18:39,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-09 10:18:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:39,624 INFO L225 Difference]: With dead ends: 88 [2018-12-09 10:18:39,624 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 10:18:39,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:18:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 10:18:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-12-09 10:18:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 10:18:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-09 10:18:39,628 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2018-12-09 10:18:39,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:39,628 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-09 10:18:39,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:18:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-09 10:18:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 10:18:39,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:39,628 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:18:39,629 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:39,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:39,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2018-12-09 10:18:39,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:39,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:39,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:39,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:39,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:18:39,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/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-12-09 10:18:39,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:39,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:18:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:39,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:18:39,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-12-09 10:18:39,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 10:18:39,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 10:18:39,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:18:39,763 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 9 states. [2018-12-09 10:18:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:39,815 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-09 10:18:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:18:39,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-12-09 10:18:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:39,816 INFO L225 Difference]: With dead ends: 60 [2018-12-09 10:18:39,816 INFO L226 Difference]: Without dead ends: 58 [2018-12-09 10:18:39,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:18:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-09 10:18:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-09 10:18:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 10:18:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-12-09 10:18:39,821 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2018-12-09 10:18:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:39,822 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-12-09 10:18:39,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 10:18:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-12-09 10:18:39,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 10:18:39,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:39,822 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:18:39,823 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:39,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:39,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2018-12-09 10:18:39,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:39,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:39,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:39,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:39,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:39,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:18:39,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:18:39,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:18:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:18:39,855 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-12-09 10:18:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:39,901 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-09 10:18:39,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:18:39,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-09 10:18:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:39,902 INFO L225 Difference]: With dead ends: 69 [2018-12-09 10:18:39,902 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 10:18:39,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:18:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 10:18:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2018-12-09 10:18:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 10:18:39,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-12-09 10:18:39,905 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2018-12-09 10:18:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:39,905 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-12-09 10:18:39,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:18:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-12-09 10:18:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 10:18:39,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:18:39,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:18:39,906 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:18:39,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:39,906 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2018-12-09 10:18:39,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:18:39,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:18:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:18:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:18:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 10:18:39,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:18:39,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:18:39,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:18:39,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:18:39,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:18:39,932 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-12-09 10:18:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:18:40,008 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-12-09 10:18:40,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:18:40,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-09 10:18:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:18:40,008 INFO L225 Difference]: With dead ends: 75 [2018-12-09 10:18:40,008 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 10:18:40,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:18:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 10:18:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 10:18:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 10:18:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 10:18:40,009 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-12-09 10:18:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:18:40,009 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:18:40,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:18:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 10:18:40,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 10:18:40,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 10:18:40,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 10:18:40,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 10:18:40,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 10:18:40,405 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2018-12-09 10:18:40,638 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2018-12-09 10:18:40,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 10:18:40,711 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-09 10:18:40,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 10:18:40,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 10:18:40,711 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 10:18:40,711 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 10:18:40,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 10:18:40,711 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2018-12-09 10:18:40,711 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-12-09 10:18:40,711 INFO L448 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2018-12-09 10:18:40,711 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2018-12-09 10:18:40,711 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-09 10:18:40,711 INFO L448 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-12-09 10:18:40,712 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L444 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse3 (+ main_~main__cp~0 1))) (let ((.cse1 (= main_~main__c~0 0)) (.cse0 (<= 2 main_~main__cp~0)) (.cse2 (= main_~__VERIFIER_assert__cond~9 1)) (.cse4 (and (not (= 0 main_~__VERIFIER_assert__cond~8)) (and (not (= 0 main_~__VERIFIER_assert__cond~7)) (= main_~__VERIFIER_assert__cond~4 1) (and (= main_~__VERIFIER_assert__cond~3 1) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~5)) (<= .cse3 main_~main__urilen~0) (<= 1 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~0 1) (<= 1 main_~main__scheme~0) (not (= 0 main_~__VERIFIER_assert__cond~6)) (not (= 0 main_~__VERIFIER_assert__cond~1))))))) (or (and .cse0 .cse1 .cse2 (not (= main_~main__urilen~0 .cse3)) (= main_~__VERIFIER_assert__cond~8 1) .cse4) (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse5 (let ((.cse6 (not (= 0 main_~__VERIFIER_assert__cond~10))) (.cse7 (not (= 0 main_~__VERIFIER_assert__cond~11)))) (or (and .cse0 .cse6 .cse2 .cse7 .cse4 (not (= 0 main_~__VERIFIER_assert__cond~12))) (and .cse0 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse6 .cse2 .cse7 .cse4))))) (or (and (<= 1 main_~main__c~0) (not (= 0 main_~__VERIFIER_assert__cond~13)) .cse5) (and .cse5 .cse1))))))) [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: true [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2018-12-09 10:18:40,713 INFO L448 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L444 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (= main_~__VERIFIER_assert__cond~3 1)) (.cse1 (<= 1 main_~main__cp~0)) (.cse2 (<= 1 main_~main__scheme~0)) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and .cse0 (= main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3) (and .cse0 (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse1 (not (= 0 main_~__VERIFIER_assert__cond~17)) (= main_~__VERIFIER_assert__cond~16 1) .cse2 .cse3))) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1)) [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L444 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (<= 1 main_~main__cp~0)) (.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse2 (<= 1 main_~main__scheme~0)) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse0 .cse1 (not (= 0 main_~__VERIFIER_assert__cond~16)) .cse2 .cse3) (and (= main_~__VERIFIER_assert__cond~2 1) .cse0 .cse1 .cse2 .cse3))) (< main_~main__cp~0 main_~main__urilen~0)) [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2018-12-09 10:18:40,714 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L444 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (and (let ((.cse0 (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (and (<= 2 main_~main__cp~0) (not (= 0 main_~__VERIFIER_assert__cond~7)) (= main_~__VERIFIER_assert__cond~3 1) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~5)) (not (= 0 main_~__VERIFIER_assert__cond~8)) (not (= 0 main_~__VERIFIER_assert__cond~9)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__VERIFIER_assert__cond~4 1) (<= 1 main_~main__scheme~0) (not (= 0 main_~__VERIFIER_assert__cond~6)) (not (= 0 main_~__VERIFIER_assert__cond~1)))) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~11)))) (or (and (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3 (not (= 0 main_~__VERIFIER_assert__cond~12))))))) (or (and (<= 1 main_~main__c~0) (not (= 0 main_~__VERIFIER_assert__cond~13)) .cse0) (and (= main_~main__c~0 0) .cse0))) (= main_~__VERIFIER_assert__cond~10 1)) [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L444 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (= main_~__VERIFIER_assert__cond~0 1) [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2018-12-09 10:18:40,715 INFO L448 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2018-12-09 10:18:40,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:18:40 BoogieIcfgContainer [2018-12-09 10:18:40,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 10:18:40,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:18:40,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:18:40,728 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:18:40,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:18:37" (3/4) ... [2018-12-09 10:18:40,731 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 10:18:40,735 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 10:18:40,736 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 10:18:40,740 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-09 10:18:40,740 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 10:18:40,781 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7dc105c0-5101-4a8e-aaf3-c800c6d3b386/bin-2019/uautomizer/witness.graphml [2018-12-09 10:18:40,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:18:40,781 INFO L168 Benchmark]: Toolchain (without parser) took 3951.91 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 962.4 MB in the beginning and 1.2 GB in the end (delta: -193.0 MB). Peak memory consumption was 130.5 MB. Max. memory is 11.5 GB. [2018-12-09 10:18:40,782 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:18:40,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.02 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 945.3 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-12-09 10:18:40,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.01 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:18:40,782 INFO L168 Benchmark]: Boogie Preprocessor took 50.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-09 10:18:40,782 INFO L168 Benchmark]: RCFGBuilder took 236.71 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 10:18:40,782 INFO L168 Benchmark]: TraceAbstraction took 3444.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.4 MB). Peak memory consumption was 375.6 MB. Max. memory is 11.5 GB. [2018-12-09 10:18:40,782 INFO L168 Benchmark]: Witness Printer took 52.78 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-12-09 10:18:40,783 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.02 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 945.3 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.01 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 236.71 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3444.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.4 MB). Peak memory consumption was 375.6 MB. Max. memory is 11.5 GB. * Witness Printer took 52.78 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((2 <= main__cp && main__c == 0) && __VERIFIER_assert__cond == 1) && !(main__urilen == main__cp + 1)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond) && (!(0 == __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && (((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || (__VERIFIER_assert__cond == 1 && (((1 <= main__c && !(0 == __VERIFIER_assert__cond)) && ((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) && (!(0 == __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && (((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) && (!(0 == __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && (((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) || (((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) && (!(0 == __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && (((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) && (!(0 == __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && (((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond))) && main__c == 0))) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) || ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)))) && main__cp < main__urilen - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((1 <= main__c && !(0 == __VERIFIER_assert__cond)) && ((((main__c + 2 <= main__tokenlen && __VERIFIER_assert__cond == 1) && (((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || (((__VERIFIER_assert__cond == 1 && (((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) || (main__c == 0 && ((((main__c + 2 <= main__tokenlen && __VERIFIER_assert__cond == 1) && (((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || (((__VERIFIER_assert__cond == 1 && (((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond))))) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) || ((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond))) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. SAFE Result, 3.3s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1337 SDtfs, 2897 SDslu, 1903 SDs, 0 SdLazy, 1150 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 155 SyntacticMatches, 8 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 311 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 722 HoareAnnotationTreeSize, 9 FomulaSimplifications, 359937 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 56278 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 73495 SizeOfPredicates, 21 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 9/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...