./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/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 f2cbbf56a13532141372a32a461d64a9d1351c0e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:03,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:03,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:03,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:03,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:03,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:03,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:03,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:03,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:03,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:03,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:03,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:03,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:03,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:03,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:03,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:03,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:03,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:03,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:03,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:03,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:03,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:03,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:03,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:03,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:03,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:03,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:03,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:03,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:03,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:03,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:03,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:03,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:03,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:03,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:03,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:03,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:03,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:03,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:03,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:03,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:03,442 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:59:03,456 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:03,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:03,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:03,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:03,458 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:03,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:03,458 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:03,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:03,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:03,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:03,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:59:03,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:59:03,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:59:03,459 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:03,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:03,460 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:03,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:59:03,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:03,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:03,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:59:03,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:59:03,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:59:03,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:03,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:59:03,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:59:03,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:03,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:59:03,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:59:03,462 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/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2019-10-22 08:59:03,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:03,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:03,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:03,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:03,517 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:03,518 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_8.c [2019-10-22 08:59:03,569 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/bin/uautomizer/data/c448eaa6d/dd7548979d2e483487306158ad1e1597/FLAGef5bac1ec [2019-10-22 08:59:03,939 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:03,939 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/sv-benchmarks/c/locks/test_locks_8.c [2019-10-22 08:59:03,946 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/bin/uautomizer/data/c448eaa6d/dd7548979d2e483487306158ad1e1597/FLAGef5bac1ec [2019-10-22 08:59:04,347 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/bin/uautomizer/data/c448eaa6d/dd7548979d2e483487306158ad1e1597 [2019-10-22 08:59:04,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:04,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:04,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:04,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:04,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:04,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4720b07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04, skipping insertion in model container [2019-10-22 08:59:04,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,365 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:04,385 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:04,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:04,530 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:04,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:04,632 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:04,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04 WrapperNode [2019-10-22 08:59:04,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:04,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:04,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:04,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:04,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:04,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:04,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:04,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:04,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:04,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:04,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:04,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:04,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/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-10-22 08:59:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:04,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:05,008 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:05,008 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:59:05,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:05 BoogieIcfgContainer [2019-10-22 08:59:05,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:05,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:59:05,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:59:05,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:59:05,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:59:04" (1/3) ... [2019-10-22 08:59:05,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52266322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:05, skipping insertion in model container [2019-10-22 08:59:05,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04" (2/3) ... [2019-10-22 08:59:05,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52266322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:05, skipping insertion in model container [2019-10-22 08:59:05,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:05" (3/3) ... [2019-10-22 08:59:05,016 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-10-22 08:59:05,033 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:59:05,046 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:59:05,062 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:59:05,102 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:59:05,102 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:59:05,102 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:59:05,102 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:05,103 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:05,103 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:59:05,103 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:05,103 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:59:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-22 08:59:05,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 08:59:05,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,130 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,132 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2043472865, now seen corresponding path program 1 times [2019-10-22 08:59:05,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851888578] [2019-10-22 08:59:05,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:05,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851888578] [2019-10-22 08:59:05,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752602840] [2019-10-22 08:59:05,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,305 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-10-22 08:59:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,349 INFO L93 Difference]: Finished difference Result 70 states and 120 transitions. [2019-10-22 08:59:05,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 08:59:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,361 INFO L225 Difference]: With dead ends: 70 [2019-10-22 08:59:05,361 INFO L226 Difference]: Without dead ends: 56 [2019-10-22 08:59:05,364 INFO L600 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-10-22 08:59:05,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-22 08:59:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-10-22 08:59:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 08:59:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2019-10-22 08:59:05,397 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 69 transitions. Word has length 14 [2019-10-22 08:59:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,397 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 69 transitions. [2019-10-22 08:59:05,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 69 transitions. [2019-10-22 08:59:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 08:59:05,398 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,398 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,398 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1342408287, now seen corresponding path program 1 times [2019-10-22 08:59:05,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159040463] [2019-10-22 08:59:05,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:05,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159040463] [2019-10-22 08:59:05,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252055366] [2019-10-22 08:59:05,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,449 INFO L87 Difference]: Start difference. First operand 38 states and 69 transitions. Second operand 3 states. [2019-10-22 08:59:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,470 INFO L93 Difference]: Finished difference Result 93 states and 168 transitions. [2019-10-22 08:59:05,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 08:59:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,473 INFO L225 Difference]: With dead ends: 93 [2019-10-22 08:59:05,473 INFO L226 Difference]: Without dead ends: 56 [2019-10-22 08:59:05,474 INFO L600 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-10-22 08:59:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-22 08:59:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-10-22 08:59:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-22 08:59:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-10-22 08:59:05,483 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 14 [2019-10-22 08:59:05,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,483 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-10-22 08:59:05,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,483 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-10-22 08:59:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 08:59:05,486 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,486 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,487 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1077064620, now seen corresponding path program 1 times [2019-10-22 08:59:05,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188667687] [2019-10-22 08:59:05,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:05,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188667687] [2019-10-22 08:59:05,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228981365] [2019-10-22 08:59:05,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,529 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-10-22 08:59:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,547 INFO L93 Difference]: Finished difference Result 86 states and 149 transitions. [2019-10-22 08:59:05,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 08:59:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,548 INFO L225 Difference]: With dead ends: 86 [2019-10-22 08:59:05,548 INFO L226 Difference]: Without dead ends: 59 [2019-10-22 08:59:05,549 INFO L600 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-10-22 08:59:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-22 08:59:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-10-22 08:59:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-22 08:59:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2019-10-22 08:59:05,555 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 15 [2019-10-22 08:59:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,556 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2019-10-22 08:59:05,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2019-10-22 08:59:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 08:59:05,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,557 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,557 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1335230058, now seen corresponding path program 1 times [2019-10-22 08:59:05,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670499450] [2019-10-22 08:59:05,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:05,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670499450] [2019-10-22 08:59:05,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317586910] [2019-10-22 08:59:05,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,589 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand 3 states. [2019-10-22 08:59:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,606 INFO L93 Difference]: Finished difference Result 108 states and 188 transitions. [2019-10-22 08:59:05,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 08:59:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,608 INFO L225 Difference]: With dead ends: 108 [2019-10-22 08:59:05,608 INFO L226 Difference]: Without dead ends: 106 [2019-10-22 08:59:05,608 INFO L600 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-10-22 08:59:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-22 08:59:05,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2019-10-22 08:59:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 08:59:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 132 transitions. [2019-10-22 08:59:05,618 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 132 transitions. Word has length 15 [2019-10-22 08:59:05,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,618 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 132 transitions. [2019-10-22 08:59:05,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2019-10-22 08:59:05,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 08:59:05,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,619 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,619 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2036294636, now seen corresponding path program 1 times [2019-10-22 08:59:05,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528686099] [2019-10-22 08:59:05,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:05,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528686099] [2019-10-22 08:59:05,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384242130] [2019-10-22 08:59:05,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,678 INFO L87 Difference]: Start difference. First operand 76 states and 132 transitions. Second operand 3 states. [2019-10-22 08:59:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,713 INFO L93 Difference]: Finished difference Result 180 states and 314 transitions. [2019-10-22 08:59:05,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 08:59:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,714 INFO L225 Difference]: With dead ends: 180 [2019-10-22 08:59:05,714 INFO L226 Difference]: Without dead ends: 108 [2019-10-22 08:59:05,715 INFO L600 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-10-22 08:59:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-22 08:59:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-10-22 08:59:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-22 08:59:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 182 transitions. [2019-10-22 08:59:05,723 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 182 transitions. Word has length 15 [2019-10-22 08:59:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,724 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 182 transitions. [2019-10-22 08:59:05,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 182 transitions. [2019-10-22 08:59:05,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:59:05,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,724 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,725 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1557326826, now seen corresponding path program 1 times [2019-10-22 08:59:05,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347917364] [2019-10-22 08:59:05,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:05,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347917364] [2019-10-22 08:59:05,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461848945] [2019-10-22 08:59:05,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,750 INFO L87 Difference]: Start difference. First operand 106 states and 182 transitions. Second operand 3 states. [2019-10-22 08:59:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,764 INFO L93 Difference]: Finished difference Result 161 states and 273 transitions. [2019-10-22 08:59:05,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 08:59:05,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,765 INFO L225 Difference]: With dead ends: 161 [2019-10-22 08:59:05,765 INFO L226 Difference]: Without dead ends: 110 [2019-10-22 08:59:05,766 INFO L600 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-10-22 08:59:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-22 08:59:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-10-22 08:59:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-22 08:59:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 182 transitions. [2019-10-22 08:59:05,773 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 182 transitions. Word has length 16 [2019-10-22 08:59:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,773 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 182 transitions. [2019-10-22 08:59:05,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 182 transitions. [2019-10-22 08:59:05,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:59:05,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,774 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,774 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1299161388, now seen corresponding path program 1 times [2019-10-22 08:59:05,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033881844] [2019-10-22 08:59:05,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:05,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033881844] [2019-10-22 08:59:05,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194008592] [2019-10-22 08:59:05,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,798 INFO L87 Difference]: Start difference. First operand 108 states and 182 transitions. Second operand 3 states. [2019-10-22 08:59:05,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,814 INFO L93 Difference]: Finished difference Result 308 states and 520 transitions. [2019-10-22 08:59:05,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 08:59:05,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,815 INFO L225 Difference]: With dead ends: 308 [2019-10-22 08:59:05,815 INFO L226 Difference]: Without dead ends: 206 [2019-10-22 08:59:05,816 INFO L600 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-10-22 08:59:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-22 08:59:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2019-10-22 08:59:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-10-22 08:59:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 338 transitions. [2019-10-22 08:59:05,832 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 338 transitions. Word has length 16 [2019-10-22 08:59:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,833 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 338 transitions. [2019-10-22 08:59:05,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 338 transitions. [2019-10-22 08:59:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:59:05,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,834 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,834 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2000225966, now seen corresponding path program 1 times [2019-10-22 08:59:05,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296182110] [2019-10-22 08:59:05,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:05,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296182110] [2019-10-22 08:59:05,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216198613] [2019-10-22 08:59:05,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,860 INFO L87 Difference]: Start difference. First operand 204 states and 338 transitions. Second operand 3 states. [2019-10-22 08:59:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,873 INFO L93 Difference]: Finished difference Result 256 states and 428 transitions. [2019-10-22 08:59:05,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 08:59:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,875 INFO L225 Difference]: With dead ends: 256 [2019-10-22 08:59:05,875 INFO L226 Difference]: Without dead ends: 254 [2019-10-22 08:59:05,875 INFO L600 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-10-22 08:59:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-22 08:59:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2019-10-22 08:59:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-10-22 08:59:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 334 transitions. [2019-10-22 08:59:05,886 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 334 transitions. Word has length 16 [2019-10-22 08:59:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,887 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 334 transitions. [2019-10-22 08:59:05,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 334 transitions. [2019-10-22 08:59:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 08:59:05,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,888 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,888 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1619082687, now seen corresponding path program 1 times [2019-10-22 08:59:05,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109653050] [2019-10-22 08:59:05,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:05,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109653050] [2019-10-22 08:59:05,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981723710] [2019-10-22 08:59:05,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,922 INFO L87 Difference]: Start difference. First operand 204 states and 334 transitions. Second operand 3 states. [2019-10-22 08:59:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,954 INFO L93 Difference]: Finished difference Result 372 states and 616 transitions. [2019-10-22 08:59:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 08:59:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,957 INFO L225 Difference]: With dead ends: 372 [2019-10-22 08:59:05,957 INFO L226 Difference]: Without dead ends: 370 [2019-10-22 08:59:05,957 INFO L600 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-10-22 08:59:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-10-22 08:59:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 288. [2019-10-22 08:59:05,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-10-22 08:59:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 462 transitions. [2019-10-22 08:59:05,988 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 462 transitions. Word has length 17 [2019-10-22 08:59:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,988 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 462 transitions. [2019-10-22 08:59:05,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 462 transitions. [2019-10-22 08:59:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 08:59:05,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,990 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,990 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash -918018109, now seen corresponding path program 1 times [2019-10-22 08:59:05,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323952424] [2019-10-22 08:59:05,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:06,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323952424] [2019-10-22 08:59:06,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:06,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941957426] [2019-10-22 08:59:06,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:06,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:06,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:06,018 INFO L87 Difference]: Start difference. First operand 288 states and 462 transitions. Second operand 3 states. [2019-10-22 08:59:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,036 INFO L93 Difference]: Finished difference Result 676 states and 1088 transitions. [2019-10-22 08:59:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:06,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 08:59:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,038 INFO L225 Difference]: With dead ends: 676 [2019-10-22 08:59:06,038 INFO L226 Difference]: Without dead ends: 394 [2019-10-22 08:59:06,039 INFO L600 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-10-22 08:59:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-10-22 08:59:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2019-10-22 08:59:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-22 08:59:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 618 transitions. [2019-10-22 08:59:06,062 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 618 transitions. Word has length 17 [2019-10-22 08:59:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:06,062 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 618 transitions. [2019-10-22 08:59:06,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 618 transitions. [2019-10-22 08:59:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:59:06,064 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:06,065 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,065 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:06,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1348259273, now seen corresponding path program 1 times [2019-10-22 08:59:06,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110915862] [2019-10-22 08:59:06,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:06,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110915862] [2019-10-22 08:59:06,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:06,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040603863] [2019-10-22 08:59:06,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:06,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:06,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:06,085 INFO L87 Difference]: Start difference. First operand 392 states and 618 transitions. Second operand 3 states. [2019-10-22 08:59:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,111 INFO L93 Difference]: Finished difference Result 596 states and 936 transitions. [2019-10-22 08:59:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:06,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 08:59:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,113 INFO L225 Difference]: With dead ends: 596 [2019-10-22 08:59:06,113 INFO L226 Difference]: Without dead ends: 406 [2019-10-22 08:59:06,114 INFO L600 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-10-22 08:59:06,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-10-22 08:59:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2019-10-22 08:59:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-10-22 08:59:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 626 transitions. [2019-10-22 08:59:06,133 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 626 transitions. Word has length 18 [2019-10-22 08:59:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:06,134 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 626 transitions. [2019-10-22 08:59:06,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 626 transitions. [2019-10-22 08:59:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:59:06,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:06,135 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,135 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:06,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1606424711, now seen corresponding path program 1 times [2019-10-22 08:59:06,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784293669] [2019-10-22 08:59:06,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:06,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784293669] [2019-10-22 08:59:06,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:06,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121224153] [2019-10-22 08:59:06,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:06,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:06,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:06,153 INFO L87 Difference]: Start difference. First operand 404 states and 626 transitions. Second operand 3 states. [2019-10-22 08:59:06,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,179 INFO L93 Difference]: Finished difference Result 712 states and 1116 transitions. [2019-10-22 08:59:06,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:06,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 08:59:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,184 INFO L225 Difference]: With dead ends: 712 [2019-10-22 08:59:06,184 INFO L226 Difference]: Without dead ends: 710 [2019-10-22 08:59:06,184 INFO L600 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-10-22 08:59:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-10-22 08:59:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 580. [2019-10-22 08:59:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-22 08:59:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 874 transitions. [2019-10-22 08:59:06,204 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 874 transitions. Word has length 18 [2019-10-22 08:59:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:06,204 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 874 transitions. [2019-10-22 08:59:06,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 874 transitions. [2019-10-22 08:59:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:59:06,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:06,206 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,206 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1987478007, now seen corresponding path program 1 times [2019-10-22 08:59:06,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748874740] [2019-10-22 08:59:06,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,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-10-22 08:59:06,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748874740] [2019-10-22 08:59:06,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:06,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597819984] [2019-10-22 08:59:06,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:06,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:06,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:06,234 INFO L87 Difference]: Start difference. First operand 580 states and 874 transitions. Second operand 3 states. [2019-10-22 08:59:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,265 INFO L93 Difference]: Finished difference Result 1336 states and 2012 transitions. [2019-10-22 08:59:06,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:06,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 08:59:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,268 INFO L225 Difference]: With dead ends: 1336 [2019-10-22 08:59:06,268 INFO L226 Difference]: Without dead ends: 774 [2019-10-22 08:59:06,269 INFO L600 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-10-22 08:59:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-10-22 08:59:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 772. [2019-10-22 08:59:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-10-22 08:59:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1138 transitions. [2019-10-22 08:59:06,295 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1138 transitions. Word has length 18 [2019-10-22 08:59:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:06,296 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1138 transitions. [2019-10-22 08:59:06,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1138 transitions. [2019-10-22 08:59:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:59:06,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:06,297 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,297 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1740226152, now seen corresponding path program 1 times [2019-10-22 08:59:06,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011928239] [2019-10-22 08:59:06,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:06,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011928239] [2019-10-22 08:59:06,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:06,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622578098] [2019-10-22 08:59:06,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:06,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:06,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:06,318 INFO L87 Difference]: Start difference. First operand 772 states and 1138 transitions. Second operand 3 states. [2019-10-22 08:59:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,358 INFO L93 Difference]: Finished difference Result 1160 states and 1700 transitions. [2019-10-22 08:59:06,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:06,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 08:59:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,363 INFO L225 Difference]: With dead ends: 1160 [2019-10-22 08:59:06,363 INFO L226 Difference]: Without dead ends: 790 [2019-10-22 08:59:06,364 INFO L600 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-10-22 08:59:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-22 08:59:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2019-10-22 08:59:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-22 08:59:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1138 transitions. [2019-10-22 08:59:06,388 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1138 transitions. Word has length 19 [2019-10-22 08:59:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:06,389 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1138 transitions. [2019-10-22 08:59:06,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1138 transitions. [2019-10-22 08:59:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:59:06,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:06,390 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,390 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1482060714, now seen corresponding path program 1 times [2019-10-22 08:59:06,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017751377] [2019-10-22 08:59:06,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:06,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017751377] [2019-10-22 08:59:06,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:06,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918645694] [2019-10-22 08:59:06,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:06,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:06,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:06,421 INFO L87 Difference]: Start difference. First operand 788 states and 1138 transitions. Second operand 3 states. [2019-10-22 08:59:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,454 INFO L93 Difference]: Finished difference Result 1352 states and 1972 transitions. [2019-10-22 08:59:06,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:06,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 08:59:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,458 INFO L225 Difference]: With dead ends: 1352 [2019-10-22 08:59:06,458 INFO L226 Difference]: Without dead ends: 1350 [2019-10-22 08:59:06,459 INFO L600 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-10-22 08:59:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-10-22 08:59:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1156. [2019-10-22 08:59:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-10-22 08:59:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1618 transitions. [2019-10-22 08:59:06,491 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1618 transitions. Word has length 19 [2019-10-22 08:59:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:06,491 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1618 transitions. [2019-10-22 08:59:06,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1618 transitions. [2019-10-22 08:59:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:59:06,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:06,493 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,493 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:06,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,493 INFO L82 PathProgramCache]: Analyzing trace with hash -780996136, now seen corresponding path program 1 times [2019-10-22 08:59:06,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129200715] [2019-10-22 08:59:06,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:06,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129200715] [2019-10-22 08:59:06,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:06,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396000478] [2019-10-22 08:59:06,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:06,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:06,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:06,512 INFO L87 Difference]: Start difference. First operand 1156 states and 1618 transitions. Second operand 3 states. [2019-10-22 08:59:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,548 INFO L93 Difference]: Finished difference Result 2632 states and 3668 transitions. [2019-10-22 08:59:06,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:06,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 08:59:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,556 INFO L225 Difference]: With dead ends: 2632 [2019-10-22 08:59:06,557 INFO L226 Difference]: Without dead ends: 1510 [2019-10-22 08:59:06,559 INFO L600 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-10-22 08:59:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-10-22 08:59:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1508. [2019-10-22 08:59:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2019-10-22 08:59:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2050 transitions. [2019-10-22 08:59:06,605 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2050 transitions. Word has length 19 [2019-10-22 08:59:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:06,605 INFO L462 AbstractCegarLoop]: Abstraction has 1508 states and 2050 transitions. [2019-10-22 08:59:06,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2050 transitions. [2019-10-22 08:59:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:59:06,607 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:06,607 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,607 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1300973822, now seen corresponding path program 1 times [2019-10-22 08:59:06,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927760299] [2019-10-22 08:59:06,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:06,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927760299] [2019-10-22 08:59:06,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:06,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386666785] [2019-10-22 08:59:06,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:06,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:06,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:06,635 INFO L87 Difference]: Start difference. First operand 1508 states and 2050 transitions. Second operand 3 states. [2019-10-22 08:59:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,667 INFO L93 Difference]: Finished difference Result 2264 states and 3060 transitions. [2019-10-22 08:59:06,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:06,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 08:59:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,671 INFO L225 Difference]: With dead ends: 2264 [2019-10-22 08:59:06,672 INFO L226 Difference]: Without dead ends: 1542 [2019-10-22 08:59:06,673 INFO L600 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-10-22 08:59:06,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-10-22 08:59:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1540. [2019-10-22 08:59:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-10-22 08:59:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2050 transitions. [2019-10-22 08:59:06,739 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2050 transitions. Word has length 20 [2019-10-22 08:59:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:06,740 INFO L462 AbstractCegarLoop]: Abstraction has 1540 states and 2050 transitions. [2019-10-22 08:59:06,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2050 transitions. [2019-10-22 08:59:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:59:06,742 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:06,742 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,743 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1559139260, now seen corresponding path program 1 times [2019-10-22 08:59:06,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456372984] [2019-10-22 08:59:06,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:06,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456372984] [2019-10-22 08:59:06,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:06,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544330297] [2019-10-22 08:59:06,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:06,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:06,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:06,764 INFO L87 Difference]: Start difference. First operand 1540 states and 2050 transitions. Second operand 3 states. [2019-10-22 08:59:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,801 INFO L93 Difference]: Finished difference Result 2568 states and 3428 transitions. [2019-10-22 08:59:06,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:06,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 08:59:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,807 INFO L225 Difference]: With dead ends: 2568 [2019-10-22 08:59:06,807 INFO L226 Difference]: Without dead ends: 2566 [2019-10-22 08:59:06,808 INFO L600 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-10-22 08:59:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-10-22 08:59:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2308. [2019-10-22 08:59:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-10-22 08:59:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 2978 transitions. [2019-10-22 08:59:06,861 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 2978 transitions. Word has length 20 [2019-10-22 08:59:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:06,861 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 2978 transitions. [2019-10-22 08:59:06,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2978 transitions. [2019-10-22 08:59:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:59:06,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:06,865 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,865 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:06,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2034763458, now seen corresponding path program 1 times [2019-10-22 08:59:06,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470450330] [2019-10-22 08:59:06,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:06,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470450330] [2019-10-22 08:59:06,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:06,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953104346] [2019-10-22 08:59:06,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:06,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:06,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:06,887 INFO L87 Difference]: Start difference. First operand 2308 states and 2978 transitions. Second operand 3 states. [2019-10-22 08:59:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,934 INFO L93 Difference]: Finished difference Result 5192 states and 6628 transitions. [2019-10-22 08:59:06,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:06,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 08:59:06,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,943 INFO L225 Difference]: With dead ends: 5192 [2019-10-22 08:59:06,943 INFO L226 Difference]: Without dead ends: 2950 [2019-10-22 08:59:06,945 INFO L600 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-10-22 08:59:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-10-22 08:59:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2948. [2019-10-22 08:59:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2019-10-22 08:59:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3650 transitions. [2019-10-22 08:59:07,016 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3650 transitions. Word has length 20 [2019-10-22 08:59:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:07,016 INFO L462 AbstractCegarLoop]: Abstraction has 2948 states and 3650 transitions. [2019-10-22 08:59:07,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3650 transitions. [2019-10-22 08:59:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:59:07,019 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:07,019 INFO L380 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-10-22 08:59:07,019 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:07,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1088892845, now seen corresponding path program 1 times [2019-10-22 08:59:07,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145498032] [2019-10-22 08:59:07,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:07,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145498032] [2019-10-22 08:59:07,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:07,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:07,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892224301] [2019-10-22 08:59:07,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:07,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:07,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:07,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:07,041 INFO L87 Difference]: Start difference. First operand 2948 states and 3650 transitions. Second operand 3 states. [2019-10-22 08:59:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:07,082 INFO L93 Difference]: Finished difference Result 4424 states and 5444 transitions. [2019-10-22 08:59:07,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:07,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 08:59:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:07,090 INFO L225 Difference]: With dead ends: 4424 [2019-10-22 08:59:07,090 INFO L226 Difference]: Without dead ends: 3014 [2019-10-22 08:59:07,092 INFO L600 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-10-22 08:59:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-10-22 08:59:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3012. [2019-10-22 08:59:07,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3012 states. [2019-10-22 08:59:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3650 transitions. [2019-10-22 08:59:07,157 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3650 transitions. Word has length 21 [2019-10-22 08:59:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:07,157 INFO L462 AbstractCegarLoop]: Abstraction has 3012 states and 3650 transitions. [2019-10-22 08:59:07,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3650 transitions. [2019-10-22 08:59:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:59:07,159 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:07,159 INFO L380 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-10-22 08:59:07,160 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1347058283, now seen corresponding path program 1 times [2019-10-22 08:59:07,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404991773] [2019-10-22 08:59:07,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:07,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404991773] [2019-10-22 08:59:07,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:07,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:07,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722087098] [2019-10-22 08:59:07,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:07,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:07,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:07,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:07,182 INFO L87 Difference]: Start difference. First operand 3012 states and 3650 transitions. Second operand 3 states. [2019-10-22 08:59:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:07,244 INFO L93 Difference]: Finished difference Result 4870 states and 5827 transitions. [2019-10-22 08:59:07,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:07,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 08:59:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:07,255 INFO L225 Difference]: With dead ends: 4870 [2019-10-22 08:59:07,255 INFO L226 Difference]: Without dead ends: 4868 [2019-10-22 08:59:07,257 INFO L600 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-10-22 08:59:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2019-10-22 08:59:07,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4612. [2019-10-22 08:59:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4612 states. [2019-10-22 08:59:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 5442 transitions. [2019-10-22 08:59:07,352 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 5442 transitions. Word has length 21 [2019-10-22 08:59:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:07,353 INFO L462 AbstractCegarLoop]: Abstraction has 4612 states and 5442 transitions. [2019-10-22 08:59:07,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 5442 transitions. [2019-10-22 08:59:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:59:07,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:07,358 INFO L380 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-10-22 08:59:07,358 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2048122861, now seen corresponding path program 1 times [2019-10-22 08:59:07,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304913436] [2019-10-22 08:59:07,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:07,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304913436] [2019-10-22 08:59:07,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:07,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:07,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917181829] [2019-10-22 08:59:07,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:07,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:07,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:07,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:07,375 INFO L87 Difference]: Start difference. First operand 4612 states and 5442 transitions. Second operand 3 states. [2019-10-22 08:59:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:07,447 INFO L93 Difference]: Finished difference Result 10244 states and 11842 transitions. [2019-10-22 08:59:07,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:07,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 08:59:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:07,448 INFO L225 Difference]: With dead ends: 10244 [2019-10-22 08:59:07,448 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:59:07,495 INFO L600 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-10-22 08:59:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:59:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:59:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:59:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:59:07,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-22 08:59:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:07,499 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:07,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:07,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:59:07,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:59:07,519 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-10-22 08:59:07,519 INFO L439 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-10-22 08:59:07,519 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,519 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,519 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:59:07,519 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:59:07,519 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-10-22 08:59:07,519 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,520 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,520 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-10-22 08:59:07,520 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-22 08:59:07,520 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,520 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,520 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,520 INFO L443 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,520 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-10-22 08:59:07,520 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,520 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-22 08:59:07,520 INFO L446 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-10-22 08:59:07,520 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-10-22 08:59:07,521 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,521 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,521 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:59:07,521 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-22 08:59:07,521 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-10-22 08:59:07,521 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,521 INFO L446 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-10-22 08:59:07,521 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,521 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,521 INFO L446 ceAbstractionStarter]: At program point L134(lines 4 135) the Hoare annotation is: true [2019-10-22 08:59:07,521 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-10-22 08:59:07,521 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-10-22 08:59:07,521 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-10-22 08:59:07,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:59:07 BoogieIcfgContainer [2019-10-22 08:59:07,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:59:07,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:07,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:07,530 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:07,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:05" (3/4) ... [2019-10-22 08:59:07,534 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:59:07,545 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 08:59:07,546 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:59:07,603 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4f247619-d019-436f-bb74-ccc9587b677f/bin/uautomizer/witness.graphml [2019-10-22 08:59:07,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:07,605 INFO L168 Benchmark]: Toolchain (without parser) took 3253.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -227.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:07,605 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:07,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:07,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:07,606 INFO L168 Benchmark]: Boogie Preprocessor took 37.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:07,606 INFO L168 Benchmark]: RCFGBuilder took 302.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:07,606 INFO L168 Benchmark]: TraceAbstraction took 2519.96 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:07,607 INFO L168 Benchmark]: Witness Printer took 73.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:07,611 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 302.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2519.96 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 73.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Result: SAFE, OverallTime: 2.4s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1452 SDtfs, 720 SDslu, 942 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4612occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 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.3s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 13195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...