./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/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 5107685577f81a5867811396b2c0a05eb5630c95 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:34:47,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:34:47,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:34:47,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:34:47,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:34:47,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:34:47,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:34:47,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:34:47,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:34:47,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:34:47,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:34:47,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:34:47,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:34:47,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:34:47,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:34:47,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:34:47,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:34:47,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:34:47,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:34:47,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:34:47,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:34:47,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:34:47,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:34:47,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:34:47,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:34:47,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:34:47,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:34:47,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:34:47,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:34:47,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:34:47,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:34:47,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:34:47,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:34:47,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:34:47,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:34:47,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:34:47,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:34:47,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:34:47,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:34:47,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:34:47,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:34:47,676 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:34:47,688 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:34:47,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:34:47,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:34:47,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:34:47,689 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:34:47,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:34:47,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:34:47,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:34:47,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:34:47,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:34:47,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:34:47,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:34:47,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:34:47,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:34:47,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:34:47,691 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:34:47,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:34:47,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:34:47,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:34:47,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:34:47,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:34:47,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:34:47,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:34:47,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:34:47,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:34:47,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:34:47,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:34:47,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:34:47,693 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:34:47,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2019-12-07 12:34:47,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:34:47,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:34:47,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:34:47,807 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:34:47,808 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:34:47,808 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_9.c [2019-12-07 12:34:47,847 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/uautomizer/data/f78211eb0/4a5d907a39ea4111a240d52a2d6bc7ff/FLAG09f8d2b86 [2019-12-07 12:34:48,158 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:34:48,158 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/sv-benchmarks/c/locks/test_locks_9.c [2019-12-07 12:34:48,165 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/uautomizer/data/f78211eb0/4a5d907a39ea4111a240d52a2d6bc7ff/FLAG09f8d2b86 [2019-12-07 12:34:48,177 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/uautomizer/data/f78211eb0/4a5d907a39ea4111a240d52a2d6bc7ff [2019-12-07 12:34:48,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:34:48,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:34:48,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:34:48,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:34:48,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:34:48,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:34:48" (1/1) ... [2019-12-07 12:34:48,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fee84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48, skipping insertion in model container [2019-12-07 12:34:48,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:34:48" (1/1) ... [2019-12-07 12:34:48,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:34:48,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:34:48,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:34:48,346 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:34:48,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:34:48,377 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:34:48,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48 WrapperNode [2019-12-07 12:34:48,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:34:48,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:34:48,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:34:48,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:34:48,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48" (1/1) ... [2019-12-07 12:34:48,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48" (1/1) ... [2019-12-07 12:34:48,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:34:48,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:34:48,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:34:48,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:34:48,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48" (1/1) ... [2019-12-07 12:34:48,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48" (1/1) ... [2019-12-07 12:34:48,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48" (1/1) ... [2019-12-07 12:34:48,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48" (1/1) ... [2019-12-07 12:34:48,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48" (1/1) ... [2019-12-07 12:34:48,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48" (1/1) ... [2019-12-07 12:34:48,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48" (1/1) ... [2019-12-07 12:34:48,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:34:48,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:34:48,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:34:48,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:34:48,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/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 [2019-12-07 12:34:48,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:34:48,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:34:48,626 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:34:48,627 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 12:34:48,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:34:48 BoogieIcfgContainer [2019-12-07 12:34:48,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:34:48,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:34:48,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:34:48,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:34:48,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:34:48" (1/3) ... [2019-12-07 12:34:48,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717569f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:34:48, skipping insertion in model container [2019-12-07 12:34:48,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:48" (2/3) ... [2019-12-07 12:34:48,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717569f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:34:48, skipping insertion in model container [2019-12-07 12:34:48,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:34:48" (3/3) ... [2019-12-07 12:34:48,634 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-12-07 12:34:48,642 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:34:48,647 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:34:48,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:34:48,674 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:34:48,674 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:34:48,674 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:34:48,674 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:34:48,674 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:34:48,675 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:34:48,675 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:34:48,675 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:34:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-12-07 12:34:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:34:48,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:48,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:48,691 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:48,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1076851140, now seen corresponding path program 1 times [2019-12-07 12:34:48,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:48,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541209985] [2019-12-07 12:34:48,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:48,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541209985] [2019-12-07 12:34:48,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:48,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:48,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640972316] [2019-12-07 12:34:48,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:48,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:48,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:48,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:48,826 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-12-07 12:34:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:48,855 INFO L93 Difference]: Finished difference Result 76 states and 132 transitions. [2019-12-07 12:34:48,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:48,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 12:34:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:48,864 INFO L225 Difference]: With dead ends: 76 [2019-12-07 12:34:48,864 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 12:34:48,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 12:34:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-12-07 12:34:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 12:34:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2019-12-07 12:34:48,892 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 77 transitions. Word has length 15 [2019-12-07 12:34:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:48,892 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 77 transitions. [2019-12-07 12:34:48,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 77 transitions. [2019-12-07 12:34:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:34:48,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:48,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:48,893 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:48,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:48,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1335016578, now seen corresponding path program 1 times [2019-12-07 12:34:48,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:48,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161455640] [2019-12-07 12:34:48,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:48,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161455640] [2019-12-07 12:34:48,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:48,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:48,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679302458] [2019-12-07 12:34:48,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:48,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:48,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:48,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:48,926 INFO L87 Difference]: Start difference. First operand 42 states and 77 transitions. Second operand 3 states. [2019-12-07 12:34:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:48,944 INFO L93 Difference]: Finished difference Result 103 states and 188 transitions. [2019-12-07 12:34:48,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:48,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 12:34:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:48,945 INFO L225 Difference]: With dead ends: 103 [2019-12-07 12:34:48,945 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 12:34:48,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 12:34:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-12-07 12:34:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 12:34:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 109 transitions. [2019-12-07 12:34:48,952 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 109 transitions. Word has length 15 [2019-12-07 12:34:48,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:48,952 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 109 transitions. [2019-12-07 12:34:48,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 109 transitions. [2019-12-07 12:34:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:34:48,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:48,953 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:48,953 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:48,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash -977139357, now seen corresponding path program 1 times [2019-12-07 12:34:48,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:48,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481424875] [2019-12-07 12:34:48,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:48,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481424875] [2019-12-07 12:34:48,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:48,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:48,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957252444] [2019-12-07 12:34:48,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:48,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:48,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:48,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:48,985 INFO L87 Difference]: Start difference. First operand 60 states and 109 transitions. Second operand 3 states. [2019-12-07 12:34:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:48,998 INFO L93 Difference]: Finished difference Result 95 states and 167 transitions. [2019-12-07 12:34:48,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:48,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:34:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:48,999 INFO L225 Difference]: With dead ends: 95 [2019-12-07 12:34:48,999 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 12:34:49,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 12:34:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-12-07 12:34:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 12:34:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 111 transitions. [2019-12-07 12:34:49,005 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 111 transitions. Word has length 16 [2019-12-07 12:34:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,005 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 111 transitions. [2019-12-07 12:34:49,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2019-12-07 12:34:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:34:49,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,006 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,006 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1563945371, now seen corresponding path program 1 times [2019-12-07 12:34:49,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136394345] [2019-12-07 12:34:49,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136394345] [2019-12-07 12:34:49,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164933971] [2019-12-07 12:34:49,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,029 INFO L87 Difference]: Start difference. First operand 63 states and 111 transitions. Second operand 3 states. [2019-12-07 12:34:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,042 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2019-12-07 12:34:49,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:34:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,044 INFO L225 Difference]: With dead ends: 120 [2019-12-07 12:34:49,044 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 12:34:49,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 12:34:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2019-12-07 12:34:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 12:34:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 148 transitions. [2019-12-07 12:34:49,051 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 148 transitions. Word has length 16 [2019-12-07 12:34:49,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,051 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 148 transitions. [2019-12-07 12:34:49,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 148 transitions. [2019-12-07 12:34:49,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:34:49,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,052 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1305779933, now seen corresponding path program 1 times [2019-12-07 12:34:49,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614768640] [2019-12-07 12:34:49,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614768640] [2019-12-07 12:34:49,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784962419] [2019-12-07 12:34:49,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,072 INFO L87 Difference]: Start difference. First operand 84 states and 148 transitions. Second operand 3 states. [2019-12-07 12:34:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,084 INFO L93 Difference]: Finished difference Result 200 states and 354 transitions. [2019-12-07 12:34:49,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:34:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,085 INFO L225 Difference]: With dead ends: 200 [2019-12-07 12:34:49,085 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 12:34:49,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 12:34:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2019-12-07 12:34:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 12:34:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 206 transitions. [2019-12-07 12:34:49,093 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 206 transitions. Word has length 16 [2019-12-07 12:34:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,093 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 206 transitions. [2019-12-07 12:34:49,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 206 transitions. [2019-12-07 12:34:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:34:49,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,094 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1237452233, now seen corresponding path program 1 times [2019-12-07 12:34:49,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147208790] [2019-12-07 12:34:49,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147208790] [2019-12-07 12:34:49,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008675964] [2019-12-07 12:34:49,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,117 INFO L87 Difference]: Start difference. First operand 118 states and 206 transitions. Second operand 3 states. [2019-12-07 12:34:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,127 INFO L93 Difference]: Finished difference Result 179 states and 309 transitions. [2019-12-07 12:34:49,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:34:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,128 INFO L225 Difference]: With dead ends: 179 [2019-12-07 12:34:49,128 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 12:34:49,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 12:34:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-12-07 12:34:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 12:34:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 206 transitions. [2019-12-07 12:34:49,134 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 206 transitions. Word has length 17 [2019-12-07 12:34:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,134 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 206 transitions. [2019-12-07 12:34:49,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 206 transitions. [2019-12-07 12:34:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:34:49,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,135 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1824258247, now seen corresponding path program 1 times [2019-12-07 12:34:49,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807707847] [2019-12-07 12:34:49,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807707847] [2019-12-07 12:34:49,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078184964] [2019-12-07 12:34:49,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,156 INFO L87 Difference]: Start difference. First operand 120 states and 206 transitions. Second operand 3 states. [2019-12-07 12:34:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,169 INFO L93 Difference]: Finished difference Result 344 states and 592 transitions. [2019-12-07 12:34:49,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:34:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,171 INFO L225 Difference]: With dead ends: 344 [2019-12-07 12:34:49,171 INFO L226 Difference]: Without dead ends: 230 [2019-12-07 12:34:49,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-12-07 12:34:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2019-12-07 12:34:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-12-07 12:34:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 386 transitions. [2019-12-07 12:34:49,180 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 386 transitions. Word has length 17 [2019-12-07 12:34:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,181 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 386 transitions. [2019-12-07 12:34:49,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 386 transitions. [2019-12-07 12:34:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:34:49,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,182 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2082423685, now seen corresponding path program 1 times [2019-12-07 12:34:49,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344602116] [2019-12-07 12:34:49,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344602116] [2019-12-07 12:34:49,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234340867] [2019-12-07 12:34:49,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,198 INFO L87 Difference]: Start difference. First operand 228 states and 386 transitions. Second operand 3 states. [2019-12-07 12:34:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,209 INFO L93 Difference]: Finished difference Result 288 states and 492 transitions. [2019-12-07 12:34:49,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:34:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,211 INFO L225 Difference]: With dead ends: 288 [2019-12-07 12:34:49,211 INFO L226 Difference]: Without dead ends: 286 [2019-12-07 12:34:49,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-12-07 12:34:49,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 228. [2019-12-07 12:34:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-12-07 12:34:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 382 transitions. [2019-12-07 12:34:49,218 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 382 transitions. Word has length 17 [2019-12-07 12:34:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,218 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 382 transitions. [2019-12-07 12:34:49,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 382 transitions. [2019-12-07 12:34:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:34:49,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,219 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,219 INFO L82 PathProgramCache]: Analyzing trace with hash -717216456, now seen corresponding path program 1 times [2019-12-07 12:34:49,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614802496] [2019-12-07 12:34:49,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614802496] [2019-12-07 12:34:49,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952807513] [2019-12-07 12:34:49,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,235 INFO L87 Difference]: Start difference. First operand 228 states and 382 transitions. Second operand 3 states. [2019-12-07 12:34:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,247 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-12-07 12:34:49,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:34:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,250 INFO L225 Difference]: With dead ends: 420 [2019-12-07 12:34:49,250 INFO L226 Difference]: Without dead ends: 418 [2019-12-07 12:34:49,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-07 12:34:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 320. [2019-12-07 12:34:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-07 12:34:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 526 transitions. [2019-12-07 12:34:49,258 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 526 transitions. Word has length 18 [2019-12-07 12:34:49,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,258 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 526 transitions. [2019-12-07 12:34:49,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 526 transitions. [2019-12-07 12:34:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:34:49,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,259 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash -459051018, now seen corresponding path program 1 times [2019-12-07 12:34:49,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181781839] [2019-12-07 12:34:49,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181781839] [2019-12-07 12:34:49,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420475470] [2019-12-07 12:34:49,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,273 INFO L87 Difference]: Start difference. First operand 320 states and 526 transitions. Second operand 3 states. [2019-12-07 12:34:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,286 INFO L93 Difference]: Finished difference Result 756 states and 1248 transitions. [2019-12-07 12:34:49,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:34:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,289 INFO L225 Difference]: With dead ends: 756 [2019-12-07 12:34:49,289 INFO L226 Difference]: Without dead ends: 442 [2019-12-07 12:34:49,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-12-07 12:34:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2019-12-07 12:34:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-12-07 12:34:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 714 transitions. [2019-12-07 12:34:49,299 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 714 transitions. Word has length 18 [2019-12-07 12:34:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,299 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 714 transitions. [2019-12-07 12:34:49,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 714 transitions. [2019-12-07 12:34:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:34:49,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,300 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,301 INFO L82 PathProgramCache]: Analyzing trace with hash -758658962, now seen corresponding path program 1 times [2019-12-07 12:34:49,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896260462] [2019-12-07 12:34:49,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896260462] [2019-12-07 12:34:49,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713661382] [2019-12-07 12:34:49,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,314 INFO L87 Difference]: Start difference. First operand 440 states and 714 transitions. Second operand 3 states. [2019-12-07 12:34:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,329 INFO L93 Difference]: Finished difference Result 668 states and 1080 transitions. [2019-12-07 12:34:49,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 12:34:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,333 INFO L225 Difference]: With dead ends: 668 [2019-12-07 12:34:49,333 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 12:34:49,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 12:34:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 452. [2019-12-07 12:34:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-12-07 12:34:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 722 transitions. [2019-12-07 12:34:49,346 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 722 transitions. Word has length 19 [2019-12-07 12:34:49,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,346 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 722 transitions. [2019-12-07 12:34:49,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 722 transitions. [2019-12-07 12:34:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:34:49,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,348 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1345464976, now seen corresponding path program 1 times [2019-12-07 12:34:49,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680944443] [2019-12-07 12:34:49,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680944443] [2019-12-07 12:34:49,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440252371] [2019-12-07 12:34:49,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,366 INFO L87 Difference]: Start difference. First operand 452 states and 722 transitions. Second operand 3 states. [2019-12-07 12:34:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,383 INFO L93 Difference]: Finished difference Result 808 states and 1308 transitions. [2019-12-07 12:34:49,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 12:34:49,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,388 INFO L225 Difference]: With dead ends: 808 [2019-12-07 12:34:49,388 INFO L226 Difference]: Without dead ends: 806 [2019-12-07 12:34:49,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-12-07 12:34:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 644. [2019-12-07 12:34:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-12-07 12:34:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1002 transitions. [2019-12-07 12:34:49,406 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1002 transitions. Word has length 19 [2019-12-07 12:34:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,407 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1002 transitions. [2019-12-07 12:34:49,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1002 transitions. [2019-12-07 12:34:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:34:49,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,408 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1087299538, now seen corresponding path program 1 times [2019-12-07 12:34:49,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602622031] [2019-12-07 12:34:49,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602622031] [2019-12-07 12:34:49,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483504322] [2019-12-07 12:34:49,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,425 INFO L87 Difference]: Start difference. First operand 644 states and 1002 transitions. Second operand 3 states. [2019-12-07 12:34:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,447 INFO L93 Difference]: Finished difference Result 1496 states and 2332 transitions. [2019-12-07 12:34:49,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 12:34:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,452 INFO L225 Difference]: With dead ends: 1496 [2019-12-07 12:34:49,452 INFO L226 Difference]: Without dead ends: 870 [2019-12-07 12:34:49,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-12-07 12:34:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 868. [2019-12-07 12:34:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-12-07 12:34:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2019-12-07 12:34:49,482 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 19 [2019-12-07 12:34:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,482 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2019-12-07 12:34:49,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2019-12-07 12:34:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:34:49,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,485 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1240473739, now seen corresponding path program 1 times [2019-12-07 12:34:49,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636399848] [2019-12-07 12:34:49,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636399848] [2019-12-07 12:34:49,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706118324] [2019-12-07 12:34:49,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,505 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand 3 states. [2019-12-07 12:34:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,526 INFO L93 Difference]: Finished difference Result 1304 states and 1988 transitions. [2019-12-07 12:34:49,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:34:49,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,531 INFO L225 Difference]: With dead ends: 1304 [2019-12-07 12:34:49,532 INFO L226 Difference]: Without dead ends: 886 [2019-12-07 12:34:49,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-12-07 12:34:49,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2019-12-07 12:34:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-12-07 12:34:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1330 transitions. [2019-12-07 12:34:49,554 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1330 transitions. Word has length 20 [2019-12-07 12:34:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,554 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1330 transitions. [2019-12-07 12:34:49,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1330 transitions. [2019-12-07 12:34:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:34:49,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,555 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,555 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash 653667725, now seen corresponding path program 1 times [2019-12-07 12:34:49,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371165073] [2019-12-07 12:34:49,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371165073] [2019-12-07 12:34:49,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477923822] [2019-12-07 12:34:49,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,572 INFO L87 Difference]: Start difference. First operand 884 states and 1330 transitions. Second operand 3 states. [2019-12-07 12:34:49,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,594 INFO L93 Difference]: Finished difference Result 1544 states and 2356 transitions. [2019-12-07 12:34:49,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:34:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,600 INFO L225 Difference]: With dead ends: 1544 [2019-12-07 12:34:49,600 INFO L226 Difference]: Without dead ends: 1542 [2019-12-07 12:34:49,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-12-07 12:34:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1284. [2019-12-07 12:34:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-07 12:34:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1874 transitions. [2019-12-07 12:34:49,631 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1874 transitions. Word has length 20 [2019-12-07 12:34:49,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,631 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 1874 transitions. [2019-12-07 12:34:49,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1874 transitions. [2019-12-07 12:34:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:34:49,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,633 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,633 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,633 INFO L82 PathProgramCache]: Analyzing trace with hash 911833163, now seen corresponding path program 1 times [2019-12-07 12:34:49,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661379635] [2019-12-07 12:34:49,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661379635] [2019-12-07 12:34:49,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417107944] [2019-12-07 12:34:49,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,648 INFO L87 Difference]: Start difference. First operand 1284 states and 1874 transitions. Second operand 3 states. [2019-12-07 12:34:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,685 INFO L93 Difference]: Finished difference Result 2952 states and 4308 transitions. [2019-12-07 12:34:49,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:34:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,692 INFO L225 Difference]: With dead ends: 2952 [2019-12-07 12:34:49,692 INFO L226 Difference]: Without dead ends: 1702 [2019-12-07 12:34:49,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-12-07 12:34:49,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1700. [2019-12-07 12:34:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2019-12-07 12:34:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2434 transitions. [2019-12-07 12:34:49,732 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2434 transitions. Word has length 20 [2019-12-07 12:34:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,732 INFO L462 AbstractCegarLoop]: Abstraction has 1700 states and 2434 transitions. [2019-12-07 12:34:49,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2434 transitions. [2019-12-07 12:34:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:34:49,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,734 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1210921629, now seen corresponding path program 1 times [2019-12-07 12:34:49,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804048111] [2019-12-07 12:34:49,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804048111] [2019-12-07 12:34:49,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650582457] [2019-12-07 12:34:49,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,748 INFO L87 Difference]: Start difference. First operand 1700 states and 2434 transitions. Second operand 3 states. [2019-12-07 12:34:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,782 INFO L93 Difference]: Finished difference Result 2552 states and 3636 transitions. [2019-12-07 12:34:49,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 12:34:49,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,791 INFO L225 Difference]: With dead ends: 2552 [2019-12-07 12:34:49,791 INFO L226 Difference]: Without dead ends: 1734 [2019-12-07 12:34:49,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-12-07 12:34:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2019-12-07 12:34:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-12-07 12:34:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2434 transitions. [2019-12-07 12:34:49,823 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2434 transitions. Word has length 21 [2019-12-07 12:34:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,824 INFO L462 AbstractCegarLoop]: Abstraction has 1732 states and 2434 transitions. [2019-12-07 12:34:49,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2434 transitions. [2019-12-07 12:34:49,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:34:49,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,825 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1797727643, now seen corresponding path program 1 times [2019-12-07 12:34:49,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414886729] [2019-12-07 12:34:49,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414886729] [2019-12-07 12:34:49,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412913152] [2019-12-07 12:34:49,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,837 INFO L87 Difference]: Start difference. First operand 1732 states and 2434 transitions. Second operand 3 states. [2019-12-07 12:34:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,874 INFO L93 Difference]: Finished difference Result 2952 states and 4196 transitions. [2019-12-07 12:34:49,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 12:34:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,888 INFO L225 Difference]: With dead ends: 2952 [2019-12-07 12:34:49,888 INFO L226 Difference]: Without dead ends: 2950 [2019-12-07 12:34:49,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-12-07 12:34:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2564. [2019-12-07 12:34:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2564 states. [2019-12-07 12:34:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3490 transitions. [2019-12-07 12:34:49,934 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3490 transitions. Word has length 21 [2019-12-07 12:34:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:49,934 INFO L462 AbstractCegarLoop]: Abstraction has 2564 states and 3490 transitions. [2019-12-07 12:34:49,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3490 transitions. [2019-12-07 12:34:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:34:49,936 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:49,936 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:49,937 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:49,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:49,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1539562205, now seen corresponding path program 1 times [2019-12-07 12:34:49,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:49,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59866942] [2019-12-07 12:34:49,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:49,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59866942] [2019-12-07 12:34:49,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:49,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:49,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912168315] [2019-12-07 12:34:49,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:49,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:49,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:49,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,948 INFO L87 Difference]: Start difference. First operand 2564 states and 3490 transitions. Second operand 3 states. [2019-12-07 12:34:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:49,981 INFO L93 Difference]: Finished difference Result 5832 states and 7908 transitions. [2019-12-07 12:34:49,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:49,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 12:34:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:49,993 INFO L225 Difference]: With dead ends: 5832 [2019-12-07 12:34:49,993 INFO L226 Difference]: Without dead ends: 3334 [2019-12-07 12:34:49,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-12-07 12:34:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3332. [2019-12-07 12:34:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-12-07 12:34:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4418 transitions. [2019-12-07 12:34:50,054 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4418 transitions. Word has length 21 [2019-12-07 12:34:50,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:50,054 INFO L462 AbstractCegarLoop]: Abstraction has 3332 states and 4418 transitions. [2019-12-07 12:34:50,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4418 transitions. [2019-12-07 12:34:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:34:50,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:50,057 INFO L410 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] [2019-12-07 12:34:50,057 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash 105233632, now seen corresponding path program 1 times [2019-12-07 12:34:50,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:50,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401887737] [2019-12-07 12:34:50,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:50,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401887737] [2019-12-07 12:34:50,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:50,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:50,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944218112] [2019-12-07 12:34:50,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:50,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:50,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:50,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:50,069 INFO L87 Difference]: Start difference. First operand 3332 states and 4418 transitions. Second operand 3 states. [2019-12-07 12:34:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:50,106 INFO L93 Difference]: Finished difference Result 5000 states and 6596 transitions. [2019-12-07 12:34:50,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:50,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 12:34:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:50,121 INFO L225 Difference]: With dead ends: 5000 [2019-12-07 12:34:50,122 INFO L226 Difference]: Without dead ends: 3398 [2019-12-07 12:34:50,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-12-07 12:34:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3396. [2019-12-07 12:34:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2019-12-07 12:34:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4418 transitions. [2019-12-07 12:34:50,181 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4418 transitions. Word has length 22 [2019-12-07 12:34:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:50,182 INFO L462 AbstractCegarLoop]: Abstraction has 3396 states and 4418 transitions. [2019-12-07 12:34:50,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4418 transitions. [2019-12-07 12:34:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:34:50,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:50,185 INFO L410 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] [2019-12-07 12:34:50,185 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:50,185 INFO L82 PathProgramCache]: Analyzing trace with hash -481572382, now seen corresponding path program 1 times [2019-12-07 12:34:50,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:50,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167663320] [2019-12-07 12:34:50,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:50,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167663320] [2019-12-07 12:34:50,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:50,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:50,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497442226] [2019-12-07 12:34:50,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:50,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:50,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:50,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:50,197 INFO L87 Difference]: Start difference. First operand 3396 states and 4418 transitions. Second operand 3 states. [2019-12-07 12:34:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:50,258 INFO L93 Difference]: Finished difference Result 5640 states and 7364 transitions. [2019-12-07 12:34:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:50,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 12:34:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:50,277 INFO L225 Difference]: With dead ends: 5640 [2019-12-07 12:34:50,277 INFO L226 Difference]: Without dead ends: 5638 [2019-12-07 12:34:50,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2019-12-07 12:34:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5124. [2019-12-07 12:34:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-12-07 12:34:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 6466 transitions. [2019-12-07 12:34:50,342 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 6466 transitions. Word has length 22 [2019-12-07 12:34:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:50,342 INFO L462 AbstractCegarLoop]: Abstraction has 5124 states and 6466 transitions. [2019-12-07 12:34:50,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 6466 transitions. [2019-12-07 12:34:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:34:50,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:50,347 INFO L410 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] [2019-12-07 12:34:50,347 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash -223406944, now seen corresponding path program 1 times [2019-12-07 12:34:50,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:50,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2595271] [2019-12-07 12:34:50,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:50,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2595271] [2019-12-07 12:34:50,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:50,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:50,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71295139] [2019-12-07 12:34:50,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:50,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:50,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:50,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:50,358 INFO L87 Difference]: Start difference. First operand 5124 states and 6466 transitions. Second operand 3 states. [2019-12-07 12:34:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:50,433 INFO L93 Difference]: Finished difference Result 11528 states and 14404 transitions. [2019-12-07 12:34:50,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:50,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 12:34:50,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:50,449 INFO L225 Difference]: With dead ends: 11528 [2019-12-07 12:34:50,449 INFO L226 Difference]: Without dead ends: 6534 [2019-12-07 12:34:50,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-12-07 12:34:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 6532. [2019-12-07 12:34:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-12-07 12:34:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 7938 transitions. [2019-12-07 12:34:50,549 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 7938 transitions. Word has length 22 [2019-12-07 12:34:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:50,549 INFO L462 AbstractCegarLoop]: Abstraction has 6532 states and 7938 transitions. [2019-12-07 12:34:50,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 7938 transitions. [2019-12-07 12:34:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:34:50,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:50,554 INFO L410 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] [2019-12-07 12:34:50,554 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:50,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:50,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2043625896, now seen corresponding path program 1 times [2019-12-07 12:34:50,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:50,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191230511] [2019-12-07 12:34:50,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:50,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191230511] [2019-12-07 12:34:50,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:50,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:50,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843235952] [2019-12-07 12:34:50,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:50,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:50,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:50,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:50,565 INFO L87 Difference]: Start difference. First operand 6532 states and 7938 transitions. Second operand 3 states. [2019-12-07 12:34:50,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:50,621 INFO L93 Difference]: Finished difference Result 9800 states and 11844 transitions. [2019-12-07 12:34:50,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:50,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 12:34:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:50,632 INFO L225 Difference]: With dead ends: 9800 [2019-12-07 12:34:50,632 INFO L226 Difference]: Without dead ends: 6662 [2019-12-07 12:34:50,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:50,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2019-12-07 12:34:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 6660. [2019-12-07 12:34:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-12-07 12:34:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 7938 transitions. [2019-12-07 12:34:50,709 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 7938 transitions. Word has length 23 [2019-12-07 12:34:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:50,709 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 7938 transitions. [2019-12-07 12:34:50,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 7938 transitions. [2019-12-07 12:34:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:34:50,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:50,714 INFO L410 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] [2019-12-07 12:34:50,714 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:50,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:50,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1664535386, now seen corresponding path program 1 times [2019-12-07 12:34:50,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:50,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362489278] [2019-12-07 12:34:50,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:50,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362489278] [2019-12-07 12:34:50,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:50,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:50,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003532973] [2019-12-07 12:34:50,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:50,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:50,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:50,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:50,725 INFO L87 Difference]: Start difference. First operand 6660 states and 7938 transitions. Second operand 3 states. [2019-12-07 12:34:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:50,783 INFO L93 Difference]: Finished difference Result 10758 states and 12675 transitions. [2019-12-07 12:34:50,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:50,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 12:34:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:50,794 INFO L225 Difference]: With dead ends: 10758 [2019-12-07 12:34:50,794 INFO L226 Difference]: Without dead ends: 10756 [2019-12-07 12:34:50,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2019-12-07 12:34:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 10244. [2019-12-07 12:34:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10244 states. [2019-12-07 12:34:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 11906 transitions. [2019-12-07 12:34:50,920 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 11906 transitions. Word has length 23 [2019-12-07 12:34:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:50,921 INFO L462 AbstractCegarLoop]: Abstraction has 10244 states and 11906 transitions. [2019-12-07 12:34:50,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 11906 transitions. [2019-12-07 12:34:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:34:50,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:50,928 INFO L410 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] [2019-12-07 12:34:50,929 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:50,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:50,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1922700824, now seen corresponding path program 1 times [2019-12-07 12:34:50,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:34:50,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291953296] [2019-12-07 12:34:50,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:50,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291953296] [2019-12-07 12:34:50,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:50,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:50,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907719620] [2019-12-07 12:34:50,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:50,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:34:50,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:50,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:50,939 INFO L87 Difference]: Start difference. First operand 10244 states and 11906 transitions. Second operand 3 states. [2019-12-07 12:34:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:51,030 INFO L93 Difference]: Finished difference Result 22788 states and 25986 transitions. [2019-12-07 12:34:51,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:51,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 12:34:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:51,030 INFO L225 Difference]: With dead ends: 22788 [2019-12-07 12:34:51,030 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:34:51,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:34:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:34:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:34:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:34:51,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-12-07 12:34:51,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:51,042 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:34:51,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:34:51,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:34:51,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:34:51,054 INFO L246 CegarLoopResult]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,054 INFO L246 CegarLoopResult]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,054 INFO L246 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2019-12-07 12:34:51,054 INFO L246 CegarLoopResult]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L61(lines 61 63) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L249 CegarLoopResult]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,055 INFO L246 CegarLoopResult]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,056 INFO L249 CegarLoopResult]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-12-07 12:34:51,056 INFO L246 CegarLoopResult]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,056 INFO L246 CegarLoopResult]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,056 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-12-07 12:34:51,056 INFO L249 CegarLoopResult]: At program point L148(lines 4 149) the Hoare annotation is: true [2019-12-07 12:34:51,056 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 12:34:51,056 INFO L246 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2019-12-07 12:34:51,056 INFO L242 CegarLoopResult]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-12-07 12:34:51,056 INFO L246 CegarLoopResult]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,056 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:34:51,056 INFO L246 CegarLoopResult]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,056 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 12:34:51,056 INFO L246 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2019-12-07 12:34:51,056 INFO L246 CegarLoopResult]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,056 INFO L246 CegarLoopResult]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 12:34:51,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:34:51 BoogieIcfgContainer [2019-12-07 12:34:51,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:34:51,064 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:34:51,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:34:51,064 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:34:51,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:34:48" (3/4) ... [2019-12-07 12:34:51,066 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:34:51,074 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 12:34:51,074 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 12:34:51,110 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_37181f71-1c1b-4657-bdc6-d21b1e7dcc84/bin/uautomizer/witness.graphml [2019-12-07 12:34:51,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:34:51,111 INFO L168 Benchmark]: Toolchain (without parser) took 2931.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -68.2 MB). Peak memory consumption was 82.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:34:51,112 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:34:51,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:34:51,112 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:34:51,112 INFO L168 Benchmark]: Boogie Preprocessor took 15.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:34:51,112 INFO L168 Benchmark]: RCFGBuilder took 208.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:34:51,113 INFO L168 Benchmark]: TraceAbstraction took 2434.74 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.6 MB). Peak memory consumption was 102.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:34:51,113 INFO L168 Benchmark]: Witness Printer took 46.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:34:51,114 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 208.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2434.74 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.6 MB). Peak memory consumption was 102.1 MB. Max. memory is 11.5 GB. * Witness Printer took 46.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 2.3s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1841 SDtfs, 922 SDslu, 1207 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10244occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 18136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...